Probability that n points are in convex position in a regular -gon : Asymptotic results
Abstract
Let P(n) be the probability that n points z1,…,zn picked uniformly and independently in C, a regular -gon with area 1, are in convex position, that is, form the vertex set of a convex polygon. In this paper, we give an equivalent of P(n) for all ≥ 3, which improves on a famous result of B\'ar\'any. A second aim of the paper is to establish a limit theorem which describes the fluctuations around the limit shape of a n-tuple of points in convex position when n+∞. Finally, we give an algorithm asymptotically exact for the random generation of z1,…,zn, conditioned to be in convex position in C.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.