Geometry of a Set and its Random covers
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 the Whitney decomposition of . On the other hand, we identify a class of bounded open subsets of that do not satisfy this positive reach condition but do have good partitions. In 2D when does not have positive reach, we show that the mutliscale flat norm can be used to approximate 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 .
Keywords
Cite
@article{arxiv.2112.14979,
title = {Geometry of a Set and its Random covers},
author = {Enrique Alvarado and Bala Krishnamoorthy and Kevin R. Vixie},
journal= {arXiv preprint arXiv:2112.14979},
year = {2023}
}
Comments
Relevant results included from 1702.08068 and 0710.3980 for completeness; presentation improved