# On a partition with a lower expected $\mathcal{L}_2$-discrepancy than classical jittered sampling

@inproceedings{Kiderlen2021OnAP, title={On a partition with a lower expected \$\mathcal\{L\}\_2\$-discrepancy than classical jittered sampling}, author={Markus Kiderlen and Florian Pausinger}, year={2021} }

We prove that classical jittered sampling of the d-dimensional unit cube does not yield the smallest expected L2-discrepancy among all stratified samples with N = m d points. Our counterexample can be given explicitly and consists of convex partitioning sets of equal volume.

## References

SHOWING 1-10 OF 25 REFERENCES

A lower bound for the discrepancy of a random point set

- Computer Science, MathematicsJ. Complex.
- 2014

There are constants k,K>0 such that for all N, N, [email protected]?N, the point set consisting of N points chosen uniformly at random in the s-dimensional unit cube admits an axis-parallel rectangle containing KsN points more than expected.

On the discrepancy of jittered sampling

- Computer Science, MathematicsJ. Complex.
- 2016

A partition principle is proved showing that every partition of 0, 1 d combined with a jittered sampling construction gives rise to a set whose expected squared L 2 -discrepancy is smaller than that of purely random points.

Optimal Jittered Sampling for two Points in the Unit Square

- Mathematics
- 2017

Jittered Sampling is a refinement of the classical Monte Carlo sampling method. Instead of picking $n$ points randomly from $[0,1]^2$, one partitions the unit square into $n$ regions of equal measure…

A Note on Irregularities of Distribution

- Computer Science, MathematicsIntegers
- 2013

It is shown that for every n ≤ N, each of the intervals [k−1 n , k n ), 1 ≤ k ≤ n, contains at least one xi with 1 ≤ i ≤ n + d, which implies that N = O(d3).

The inverse of the star-discrepancy depends linearly on the dimension

- Mathematics
- 2001

We study bounds on the classical ∗-discrepancy and on its inverse. Let n∞(d, e) be the inverse of the ∗-discrepancy, i.e., the minimal number of points in dimension d with the ∗-discrepancy at most…

Explicit constructions of point sets and sequences with low discrepancy

- Computer Science, MathematicsUniform Distribution and Quasi-Monte Carlo Methods
- 2014

This article surveys recent results on the explicit construction of finite point sets and infinite sequences with optimal order of the $\mathcal{L}_q$ discrepancy and gives an overview of these constructions and related results.

On the L2-discrepancy for anchored boxes

- Mathematics
- 1998

The L2-discrepancy for anchored axis-parallel boxes has been used in several recent computational studies, mostly related to numerical integration, as a measure of the quality of uniform distribution…

Covering numbers, dyadic chaining and discrepancy

- Computer Science, MathematicsJ. Complex.
- 2011

In 2001 Heinrich, Novak, Wasilkowski and Wozniakowski proved that for every s>=1 and N>=1 there exists a sequence (z"1,...,z"N) of elements of the s-dimensional unit cube such that the…

A generalized discrepancy and quadrature error bound

- Computer Science, MathematicsMath. Comput.
- 1998

An error bound for multidimensional quadrature is derived that includes the Koksma-Hlawka inequality as a special case and includes as special cases the L p -star discrepancy and P α that arises in the study of lattice rules.

Uniform Distribution and Quasi-Monte Carlo Methods - Discrepancy, Integration and Applications

- Computer ScienceUniform Distribution and Quasi-Monte Carlo Methods
- 2014

This book focuses on number theoretic point constructions, uniform distribution theory, and quasi-Monte Carlo methods, which have many fruitful applications in mathematical practice, as for example in finance, computer graphics, and biology.