In mathematics, a random polytope is a structure commonly used in convex analysis and the analysis of linear programs in d-dimensional Euclidean space R d {\displaystyle \mathbb {R} ^{d}} . Depending on use the construction and definition, random polytopes may differ.
Definition There are multiple non equivalent definitions of a Random polytope. For the following definitions. Let K be a bounded convex set in a Euclidean space:
The convex hull of random points selected with respect to a uniform distribution inside K. The nonempty intersection of half-spaces in R d {\displaystyle \mathbb {R} ^{d}} . The following parameterization has been used: r : ( R d × { 0 , 1 } ) m → Polytopes ∈ R d {\displaystyle r:(\mathbb {R} ^{d}\times \{0,1\})^{m}\rightarrow {\text{Polytopes}}\in \mathbb {R} ^{d}} such that r ( ( p 1 , 0 ) , ( p 2 , 1 ) , ( p 3 , 1 ) . . . ( p m , i m ) ) = { x ∈ R n : | p j | | p j | | ⋅ x ≤ | | p j | | if i j = 1 , p j | | p j | | ⋅ x ≥ | | p j | | if i j = 0 } {\displaystyle r((p_{1},0),(p_{2},1),(p_{3},1)...(p_{m},i_{m}))=\{x\in \mathbb {R} ^{n}:|{\frac {p_{j}}{||p_{j}||}}\cdot x\leq ||p_{j}||{\text{ if }}i_{j}=1,{\frac {p_{j}}{||p_{j}||}}\cdot x\geq ||p_{j}||{\text{ if }}i_{j}=0\}} (Note: these polytopes can be empty).
Properties definition 1 Let K {\displaystyle \mathrm {K} } be the set of convex bodies in R d {\displaystyle \mathbb {R} ^{d}} . Assume K ∈ K {\displaystyle K\in \mathrm {K} } and consider a set of uniformly distributed points x 1 , . . . , x n {\displaystyle x_{1},...,x_{n}} in K {\displaystyle K} . The convex hull of these points, K n {\displaystyle K_{n}} , is called a random polytope inscribed in K {\displaystyle K} . K n = [ x 1 , . . . , x n ] {\displaystyle K_{n}=[x_{1},...,x_{n}]} where the set [ S ] {\displaystyle [S]} stands for the convex hull of the set. We define E ( k , n ) {\displaystyle E(k,n)} to be the expected volume of K − K n {\displaystyle K-K_{n}} . For a large enough n {\displaystyle n} and given K ∈ R n {\displaystyle K\in \mathbb {R} ^{n}} .
… excerpt ends here. Continue reading the full article.


