Expected dispersion of uniformly distributed points

11/27/2019
by   Aicke Hinrichs, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2021

A Sharp Discrepancy Bound for Jittered Sampling

For m, d ∈ℕ, a jittered sampling point set P having N = m^d points in [0...
research
07/27/2017

A note on minimal dispersion of point sets in the unit cube

We study the dispersion of a point set, a notion closely related to the ...
research
03/05/2022

On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves

Given a parametric polynomial curve γ:[a,b]→ℝ^n, how can we sample a ran...
research
08/05/2020

Expected Size of Random Tukey Layers and Convex Layers

We study the Tukey layers and convex layers of a planar point set, which...
research
01/13/2022

Sharp estimates on random hyperplane tessellations

We study the problem of generating a hyperplane tessellation of an arbit...
research
06/23/2023

Breakdown points of Fermat-Weber problems under gauge distances

We compute the robustness of Fermat–Weber points with respect to any fin...
research
03/15/2021

Rectilinear Steiner Trees in Narrow Strips

A rectilinear Steiner tree for a set P of points in ℝ^2 is a tree that c...

Please sign up or login with your details

Forgot password? Click here to reset