Abstract

The dispersion of a point set in [0,1]d[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 nn points determined by an i.i.d. sequence of uniformly distributed random variables. Depending on the number of points nn and the dimension dd 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)\varepsilon\in(0,1) depends linearly on the dimension dd.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.