Recursive Scheme for Angles of Random Simplices, and Applications to Random Polytopes
Abstract
Consider a random simplex [X1,…,Xn] defined as the convex hull of independent identically distributed random points X1,…,Xn in Rn-1 with the following beta density: fn-1,β (x) (1-\|x\|2)β 1\\|x\| < 1\, x∈Rn-1, β>-1. Let Jn,k(β) be the expected internal angle of the simplex [X1,…,Xn] at its face [X1,…,Xk]. Define Jn,k(β) analogously for i.i.d. random points distributed according to the beta' density fn-1,β (x) (1+\|x\|2)-β, x∈Rn-1, β > n-12. We derive formulae for Jn,k(β) and Jn,k(β) which make it possible to compute these quantities symbolically, in finitely many steps, for any integer or half-integer value of β. For Jn,1( 1/2) we even provide explicit formulae in terms of products of Gamma functions. We give applications of these results to two seemingly unrelated problems of stochastic geometry. (i) We compute the expected f-vectors of the typical Poisson-Voronoi cells in dimensions up to 10. (ii) Consider the random polytope Kn,d := [U1,…,Un] where U1,…,Un are i.i.d. random points sampled uniformly inside some d-dimensional convex body K with smooth boundary and unit volume. M. Reitzner proved the existence of the limit of the normalized expected f-vector of Kn,d: n∞ n-d-1d+1 E f(Kn,d) = cd · (K), where (K) is the affine surface area of K, and cd is an unknown vector not depending on K. We compute cd explicitly in dimensions up to d=10 and also solve the analogous problem for random polytopes with vertices distributed uniformly on the sphere.
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.