Conditioning random points by the number of vertices of their convex hull: the bi-pointed case
Abstract
Pick N random points U1,·s,UN independently and uniformly in a triangle ABC with area 1, and take the convex hull of the set \A,B,U1,·s,UN\. The boundary of this convex hull is a convex chain V0=B,V1,·s, Vn(N), Vn(N)+1=A with random size n(N). The first aim of this paper is to study the asymptotic behavior of this chain, conditional on n(N)=n, when both n and m=N-n go to +∞. We prove a phase transition: if m= nλ where λ>0, this chain converges in probability for the Hausdorff topology to an (explicit) hyperbola Hλ as n+∞, 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 C in ABC (incident with A and B), Hλ is the unique curve maximizing the functional C Area( C)λ L( C)3 where L( C) is the affine perimeter of C. We also give the logarithm expansion of the probability Q n, nλ, that n(N)=n when N=n+ nλ. Take a compact convex set K with area 1 in the plane, and denote by QKn,m the probability of the event that the convex hull of n+m iid uniform points in K is a polygon with n vertices. We provide some results and conjectures regarding the asymptotic logarithm expansion of QKn,m, as well as results and conjectures concerning limit shape theorems, conditional on this event. These results and conjectures generalize B\'ar\'any's results, who treated the case λ=0.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.