DeepAI AI Chat
Log In Sign Up

A Sharp Discrepancy Bound for Jittered Sampling

by   Benjamin Doerr, et al.

For m, d ∈ℕ, a jittered sampling point set P having N = m^d points in [0,1)^d is constructed by partitioning the unit cube [0,1)^d into m^d axis-aligned cubes of equal size and then placing one point independently and uniformly at random in each cube. We show that there are constants c ≥ 0 and C such that for all d and all m ≥ d the expected non-normalized star discrepancy of a jittered sampling point set satisfies c dm^d-1/2√(1 + log( md))≤𝔼 D^*(P) ≤ C dm^d-1/2√(1 + log( md)). This discrepancy is thus smaller by a factor of Θ(√(1+log(m/d)/m/d) ) than the one of a uniformly distributed random point set of m^d points. This result improves both the upper and the lower bound for the discrepancy of jittered sampling given by Pausinger and Steinerberger (Journal of Complexity (2016)). It also removes the asymptotic requirement that m is sufficiently large compared to d.


page 1

page 2

page 3

page 4


Discrepancy of stratified samples from partitions of the unit cube

We extend the notion of jittered sampling to arbitrary partitions and st...

Expected dispersion of uniformly distributed points

The dispersion of a point set in [0,1]^d is the volume of the largest ax...

Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization

Consider a unit interval [0,1] in which n points arrive one-by-one indep...

On Shallow Packings and Tusnády's Problem

Tusnády's problem asks to bound the discrepancy of points and axis-paral...

Optimal periodic L_2-discrepancy and diaphony bounds for higher order digital sequences

We present an explicit construction of infinite sequences of points (x_0...

A practical algorithm to calculate Cap Discrepancy

Uniform distribution of the points has been of interest to researchers f...

The Spherical Cap Discrepancy of HEALPix Points

In this paper we show that the spherical cap discrepancy of the point se...