A concentration inequality for random polytopes, Dirichlet-Voronoi tiling numbers and the geometric balls and bins problem

From MaRDI portal
Publication:2664110



Abstract: Our main contribution is a concentration inequality for the symmetric volume difference of a C2 convex body with positive Gaussian curvature and a circumscribed random polytope with a restricted number of facets, for any probability measure on the boundary with a positive density function. We also show that the Dirichlet-Voronoi tiling numbers satisfy extdivn−1=(2pie)−1(n+lnn)+O(1), which improves a classical result of Zador by a factor of o(n). In addition, we provide a remarkable open problem which is the natural geometric generalization of the famous and fundamental "balls and bins" problem from probability. This problem is tightly connected to the optimality of random polytopes in high dimensions.




Cites work









This page was built for publication: A concentration inequality for random polytopes, Dirichlet-Voronoi tiling numbers and the geometric balls and bins problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664110)