Probability that \(n\) random points are in convex position (Q1892438)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Probability that n random points are in convex position |
scientific article; zbMATH DE number 764252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probability that \(n\) random points are in convex position |
scientific article; zbMATH DE number 764252 |
Statements
Probability that \(n\) random points are in convex position (English)
0 references
2 July 1995
0 references
Suppose that \(n\) points are chosen independently and uniformly from a parallelogram. The paper shows that the probability that they are the vertices of a convex polygon is \(\left( \left( \begin{smallmatrix} 2n - 2\\ n - 2\end{smallmatrix} \right)/n!\right)^ 2\). The proof proceeds by reduction to the unit square and a combinatorial treatment of approximating grid versions. A note added in proof states the following probability for the analogous problem in a triangle: \(2^ n(3n - 3)!/((n - 1)!)^ 3(2n)!\) (proof to be given elsewhere).
0 references
random points
0 references
convex polygon
0 references
combinatorial treatment of approximating grid versions
0 references
0.9281913638114928
0 references
0.927255630493164
0 references
0.8860754370689392
0 references
0.8452895879745483
0 references