Probability that $n$ points are in convex position in a general convex polygon: Asymptotic results
Ludovic Morin

TL;DR
This paper derives an asymptotic expression for the probability that n random points in a convex polygon are in convex position, extending previous results to more general convex domains.
Contribution
It provides an asymptotic formula for the probability in general convex polygons, improving upon Bárány's classical result and previous work on regular polygons.
Findings
Derived an asymptotic expression for $ ext{P}_K(n)$ as n approaches infinity.
Extended known results from regular polygons to general convex polygons.
Improved understanding of the convex position probability in convex domains.
Abstract
Let be the probability that points picked uniformly and independently in , a non-flat compact convex polygon in , are in convex position, that is, form the vertex set of a convex polygon. In this paper, we give an equivalent of when . This improves on a famous result of B\'ar\'any (yet valid for a general convex domain ) and a result we initiated in the case where is a regular convex polygon.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Computational Geometry and Mesh Generation · Diffusion and Search Dynamics
