English

A Lower Bound for the Discrepancy of a Random Point Set

Numerical Analysis 2013-10-08 v3 Discrete Mathematics Combinatorics

Abstract

We show that there is a constant K>0K > 0 such that for all N,sNN, s \in \N, sNs \le N, the point set consisting of NN points chosen uniformly at random in the ss-dimensional unit cube [0,1]s[0,1]^s with probability at least 1exp(Θ(s))1-\exp(-\Theta(s)) admits an axis parallel rectangle [0,x][0,1]s[0,x] \subseteq [0,1]^s containing KsNK \sqrt{sN} points more than expected. Consequently, the expected star discrepancy of a random point set is of order s/N\sqrt{s/N}.

Keywords

Cite

@article{arxiv.1210.0572,
  title  = {A Lower Bound for the Discrepancy of a Random Point Set},
  author = {Benjamin Doerr},
  journal= {arXiv preprint arXiv:1210.0572},
  year   = {2013}
}

Comments

7 pages

R2 v1 2026-06-21T22:14:16.522Z