Expected dispersion of uniformly distributed points
Abstract
The dispersion of a point set in [0,1]d is the volume of the largest axis parallel box inside the unit cube that does not intersect with the point set. We study the expected dispersion with respect to a random set of n points determined by an i.i.d. sequence of uniformly distributed random variables. Depending on the number of points n and the dimension d we provide an upper and lower bound of the expected dispersion. In particular, we show that the minimal number of points required to achieve an expected dispersion less than ∈(0,1) depends linearly on the dimension d.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.