Moments of the maximal number of empty simplices of a random point set
From MaRDI portal
Publication:1991346
Abstract: For a finite set of points from , the degree of an -element subset of is defined as the number of -simplices that can be constructed from this -element subset using an additional point , such that no further point of lies in the interior of this -simplex. Furthermore, the degree of , denoted by , is the maximal degree of any of its -element subsets. The purpose of this paper is to show that the moments of the degree of satisfy , for some constant , if the elements of the set are chosen uniformly and independently from a convex body . Additionally, it will be shown that these moments converge in probability to infinity as the number of points of the set goes to infinity.
Recommendations
Cites work
- Computation of the perimeter of measurable sets via their covariogram. Applications to random sets
- scientific article; zbMATH DE number 1786502 (Why is no real title available?)
- scientific article; zbMATH DE number 1448982 (Why is no real title available?)
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- Limit theory for the Gilbert graph
- Many empty triangles have a common edge
- Planar point sets with a small number of empty convex polygons
- Research Problems in Discrete Geometry
- Stochastic and Integral Geometry
Cited in
(5)
This page was built for publication: Moments of the maximal number of empty simplices of a random point set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991346)