Tight bounds on the expected number of holes in random point sets
Martin Balko, Manfred Scheucher, Pavel Valtr

TL;DR
This paper establishes tight asymptotic bounds on the expected number of holes in random point sets in high-dimensional spaces, providing exact constants for small holes and improving previous bounds.
Contribution
It provides asymptotically tight lower bounds on the expected number of k-holes in random point sets, with exact constants for small holes and dimension-independent results in the plane.
Findings
Expected number of k-holes is at least proportional to n^d.
Exact leading constants are determined for small holes.
Improves previous bounds on the asymptotic number of holes.
Abstract
For integers and , a -hole in a set of points in general position in is a -tuple of points from in convex position such that the interior of their convex hull does not contain any point from . For a convex body of unit -dimensional volume, we study the expected number of -holes in a set of points drawn uniformly and independently at random from . We prove an asymptotically tight lower bound on by showing that, for all fixed integers and , the number is at least . For some small holes, we even determine the leading constant exactly. We improve the currently best known lower bound on by Reitzner and Temesvari (2019). In the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Robotics and Sensor-Based Localization
