We show that there is a constant $K > 0$ such that for all $N, s \in \N$, $s \le N$, the point set consisting of $N$ points chosen uniformly at random in the $s$-dimensional unit cube $[0,1]^s$ with probability at least $1-\exp(-Θ(s))$ admits an axis parallel rectangle $[0,x] \subseteq [0,1]^s$ containing $K \sqrt{sN}$ points more than expected. Consequently, the expected star discrepancy of a random point set is of order $\sqrt{s/N}$.
The inverse of the star discrepancy of a union of randomly shifted Korobov rank-1 lattice point sets depends polynomially on the dimension
School of Mathematics, South China University of Technology(华南理工大学数学学院);School of Mathematics and Statistics, The University of New South Wales(新南威尔士大学数学与统计学院)
The inverse of the star-discrepancy problem and the generation of pseudo-random numbers
School of Mathematics and Statistics, The University of New South Wales(新南威尔士大学数学与统计学院);Department of Financial Mathematics, Johannes Kepler University(约翰·开普勒大学金融数学系)
University of Washington(华盛顿大学);University of St Andrews(圣安德鲁斯大学);Stanford University(斯坦福大学);ELLIS Institute Tübingen(蒂宾根ELLIS研究所);Max Planck Institute for Intelligent Systems(马克斯·普朗克智能系统研究所);Tübingen AI Center(蒂宾根人工智能中心)