Geometry of a Set and its Random covers

Authors Enrique Alvarado, Bala Krishnamoorthy, Kevin R. Vixie

Publication date 30 December 2021

Length, area, volume, other geometric measure theory (28A75) Minimal surfaces and optimization (49Q05) Geometric measure and integration theory, integral and normal currents in optimization (49Q15) Geometric probability and stochastic geometry (60D05)

Abstract: Let

E

be a bounded open subset of

m a t h b b R^{n}

. We study the following questions: For i.i.d. samples

X_{1}, d o t s, X_{N}

drawn uniformly from

E

, what is the probability that

c u p_{i} m a t h b f B (X_{i}, d e l t a)

, the union of

d e l t a

-balls centered at

X_{i}

, covers

E

? And how does the probability depend on sample size

N

and the radius of balls

d e l t a

? 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

e x p (- d e l t a^{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

E^{c}

, 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

m a t h b b R^{n}

that do not satisfy this positive reach condition but do have good partitions. In 2D when

E^{c} s u b s e t m a t h b b R^{2}

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

.

This page was built for publication: Geometry of a Set and its Random covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6387070)