Geometry of a Set and its Random covers
Abstract
Let E be a bounded open subset of Rn. We study the following questions: For i.i.d. samples X1, …, XN drawn uniformly from E, what is the probability that i B(Xi, δ), the union of δ-balls centered at Xi, covers E? And how does the probability depend on sample size N and the radius of balls δ? We present geometric conditions of E under which we derive lower bounds to this probability. These lower bounds tend to 1 as a function of (-δn N). The basic tool that we use to derive the lower bounds is a good partition of E, 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 Ec, the complement of E, has positive reach then we can construct a good partition of E. This partition is motivated by the Whitney decomposition of E. On the other hand, we identify a class of bounded open subsets of Rn that do not satisfy this positive reach condition but do have good partitions. In 2D when Ec⊂ R2 does not have positive reach, we show that the mutliscale flat norm can be used to approximate E with a set that has a good partition under certain conditions. In this case, we provide a lower bound on the probability that the union of the balls almost covers E.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.