A Lower Bound for the Discrepancy of a Random Point Set
Abstract
We show that there is a constant K > 0 such that for all N, s ∈ , s 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-(-Θ(s)) admits an axis parallel rectangle [0,x] ⊂eq [0,1]s containing K sN points more than expected. Consequently, the expected star discrepancy of a random point set is of order s/N.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.