Geometry of a Set and its Random covers
Enrique Alvarado, Bala Krishnamoorthy, Kevin R. Vixie

TL;DR
This paper investigates the probability that random balls centered at uniform samples from a set cover the set, deriving bounds based on geometric properties and partitions, with applications in approximation and coverage analysis.
Contribution
It introduces geometric conditions and partitioning methods, including Whitney decomposition and multiscale flat norm, to establish coverage probability bounds for random ball unions.
Findings
Lower bounds tend to 1 as exp(-δ^n N)
Good partitions exist if the complement has positive reach
Multiscale flat norm helps approximate sets without positive reach
Abstract
Let be a bounded open subset of . We study the following questions: For i.i.d. samples drawn uniformly from , what is the probability that , the union of -balls centered at , covers ? And how does the probability depend on sample size and the radius of balls ? We present geometric conditions of under which we derive lower bounds to this probability. These lower bounds tend to as a function of . The basic tool that we use to derive the lower bounds is a good partition of , i.e., one whose partition elements have diameters that are uniformly bounded from above and have volumes that are uniformly bounded from below. We show that if , the complement of , has positive reach then we can construct a good partition of . This partition is motivated by…
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
TopicsPoint processes and geometric inequalities · Mathematical Dynamics and Fractals · Morphological variations and asymmetry
