Recursive Scheme for Angles of Random Simplices, and Applications to Random Polytopes
Abstract
Consider a random simplex defined as the convex hull of independent identically distributed random points in with the following beta density: Let be the expected internal angle of the simplex at its face . Define analogously for i.i.d. random points distributed according to the beta' density We derive formulae for and which make it possible to compute these quantities symbolically, in finitely many steps, for any integer or half-integer value of . For 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 -vectors of the typical Poisson-Voronoi cells in dimensions up to . (ii) Consider the random polytope where are i.i.d. random points sampled uniformly inside some -dimensional convex body with smooth boundary and unit volume. M. Reitzner proved the existence of the limit of the normalized expected -vector of : where is the affine surface area of , and is an unknown vector not depending on . We compute explicitly in dimensions up to and also solve the analogous problem for random polytopes with vertices distributed uniformly on the sphere.
Cite
@article{arxiv.1907.07534,
title = {Recursive Scheme for Angles of Random Simplices, and Applications to Random Polytopes},
author = {Zakhar Kabluchko},
journal= {arXiv preprint arXiv:1907.07534},
year = {2020}
}
Comments
30 pages. Minor changes. References updated