Probability that n points are in convex position in a regular κ-gon: Asymptotic results
Ludovic Morin
What the paper says
Let $\mathbb{P}_\kappa(n)$ be the probability that n points $z_1,\ldots,z_n$ picked uniformly and independently in $\mathfrak{C}_\kappa$ , a regular $\kappa$ -gon with area 1, are in convex position, that is, form the vertex set of a convex polygon. In this paper, we compute $\mathbb{P}_\kappa(n)$ up to asymptotic equivalence, as $n\to+\infty$ , for all $\kappa\geq 3$ , which improves on a famous result of Bárány ( Ann. Prob. 27 , 1999). The second purpose of this paper is to establish a limit theorem which describes the fluctuations around the limit shape of an n -tuple of points in convex position when $n\to+\infty$ . Finally, we give an asymptotically exact algorithm for the random generation of $z_1,\ldots,z_n$ , conditioned to be in convex position in $\mathfrak{C}_\kappa$ .
2 citations
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.25 × 0.4 = 0.10 |
| M · momentum | 0.55 × 0.15 = 0.08 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.