Search arXivSearch

arXiv · 2510.26330

Conditioning random points by the number of vertices of their convex hull: the bi-pointed case

Abstract

Pick $N$ random points $U_1,\cdots,U_{N}$ independently and uniformly in a triangle ABC with area 1, and take the convex hull of the set $\{A,B,U_1,\cdots,U_{N}\}$. The boundary of this convex hull is a convex chain $V_0=B,V_1,\cdots,$ $V_{\mathbf{n}(N)}$, $V_{\mathbf{n}(N)+1}=A$ with random size $\mathbf{n}(N)$. The first aim of this paper is to study the asymptotic behavior of this chain, conditional on $\mathbf{n}(N)=n$, when both $n$ and $m=N-n$ go to $+\infty$. We prove a phase transition: if $m=\lfloor nλ\rfloor$ where $λ>0$, this chain converges in probability for the Hausdorff topology to an (explicit) hyperbola ${\cal H}_λ$ as $n\to+\infty$, while, if $m=o(n)$, the limit shape is a parabola. We prove that this hyperbola is solution to an optimization problem: among all concave curves ${\cal C}$ in $ABC$ (incident with $A$ and $B$), ${\cal H}_λ$ is the unique curve maximizing the functional ${\cal C}\mapsto {\sf Area}({\cal C})^λ {\sf L}({\cal C})^3$ where ${\sf L}({\cal C})$ is the affine perimeter of ${\cal C}$. We also give the logarithm expansion of the probability ${\bf Q}^{\triangle \bullet\bullet}_{n,\lfloor nλ\rfloor}$, that $\mathbf{n}(N)=n$ when $N=n+\lfloor nλ\rfloor$. Take a compact convex set $\mathbf{K}$ with area 1 in the plane, and denote by ${\bf Q}^{\mathbf{K}}_{n,m}$ the probability of the event that the convex hull of $n+m$ iid uniform points in $\mathbf{K}$ is a polygon with $n$ vertices. We provide some results and conjectures regarding the asymptotic logarithm expansion of ${\bf Q}^{\mathbf{K}}_{n,m}$, as well as results and conjectures concerning limit shape theorems, conditional on this event. These results and conjectures generalize Bárány's results, who treated the case $λ=0$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-François Marckert, Ludovic Morin. 2025-10-30. Conditioning random points by the number of vertices of their convex hull: the bi-pointed case. https://arxiv.org/abs/2510.26330

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The extremal process of a cascading family of branching Brownian motion

We study the asymptotic behaviour of the extremal process of a cascading family of branching Brownian motions. This is a particle system on the real line such that each particle has a type in addition to his position. Particles of type $1$ move on the real line according to Brownian motions and branch at rate $1$ into two children of type $1$. Furthermore, at rate $α$, they give birth to children too of type $2$. Particles of type $2$ move according to standard Brownian motion and branch at rate $1$, but cannot give birth to descendants of type $1$. We obtain the asymptotic behaviour of the extremal process of particles of type $2$.

math.PR

Breuer-Major Theorems for Hilbert Space-Valued Random Variables

Let $\{X_k\}_{k\in\mathbb Z}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal H_1$, and let $G:\mathcal H_1\to\mathcal H_2$ be a measurable map into another separable Hilbert space $\mathcal H_2$. We derive a central limit theorem for the centered normalized partial sums of the Hilbert space-valued subordinated process $\{G[X_k]\}_{k\in\mathbb Z}$. Our result holds under either of two sets of sufficient conditions, formulated in terms of the transformation $G$ and the temporal and cross-sectional dependence structure of $\{X_k\}_{k\in\mathbb Z}$. These conditions coincide in finite dimensions but lead to genuinely different phenomena in the infinite-dimensional setting. The proof relies on the recently developed Fourth Moment Theorem on Hilbert spaces, leveraging tools from the infinite-dimensional Malliavin-Stein framework. We also provide continuous-time and quantitative versions of the central limit theorem. In a series of examples, we recover and strengthen limit theorems for a wide array of statistics relevant in functional data analysis, and present, as an application of our result, a novel limit theorem in the framework of neural operators.

math.PR

Controlled rough SDEs, pathwise stochastic control and dynamic programming principles

We study stochastic optimal control of rough stochastic differential equations (RSDEs). This is in the spirit of the pathwise control problem (Lions--Souganidis 1998, Buckdahn--Ma 2007; also Davis--Burstein 1992), with renewed interest and recent works drawing motivation from filtering, SPDEs, and reinforcement learning. Results include regularity of rough value functions, validity of a rough dynamic programming principles and new rough stability results for HJB equations, removing excessive regularity demands previously imposed by flow transformation methods. Measurable selection is used to relate RSDEs to "doubly stochastic" SDEs under conditioning. In contrast to previous works, Brownian statistics for the to-be-conditioned-on noise are not required, aligned with the "pathwise" intuition that these should not matter upon conditioning. Depending on the chosen class of admissible controls, the involved processes may also be anticipating. The resulting stochastic value functions coincide in great generality for different classes of controls. RSDE theory offers a powerful and unified perspective on this problem class.

math.PR