Expected Sizes of Poisson-Delaunay Mosaics and Their Discrete Morse Functions

Abstract

Mapping every simplex in the Delaunay mosaic of a discrete point set to the radius of the smallest empty circumsphere gives a generalized discrete Morse function. Choosing the points from an n-dimensional Poisson point process, we study the expected number of simplices in the Delaunay mosaic as well as the expected number of critical simplices and non-singular intervals in the corresponding generalized discrete gradient. Observing connections with other probabilistic models, we obtain precise expressions for the expected numbers in low dimensions. In particular, we get the expected numbers of simplices in the Poisson-Delaunay mosaic in dimensions up to 4.

References in corpus (1)

• Moments of minors of Wishart matrices

Cited by in corpus (11)

• A fractal dimension for measures via persistent homology
• Finding self-similar behavior in quantum many-body dynamics via persistent homology
• Poisson-Delaunay Mosaics of Order $k$
• Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics
• Topology-Driven Goodness-of-Fit Tests in Arbitrary Dimensions
• Integrating by Spheres: Summary of Blaschke-Petkantschin Formulas
• The geometry of jamming algorithms in the random Lorentz gas
• The volume of simplices in high-dimensional Poisson-Delaunay tessellations
• The self-similar evolution of stationary point processes via persistent homology
• Average and Expected Distortion of Voronoi Paths and Scapes
• On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane