Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Lower Bound for the Discrepancy of a Random Point Set (1210.0572v3)

Published 1 Oct 2012 in math.NA, cs.DM, and math.CO

Abstract: 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(-\Theta(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}$.

Citations (30)

Summary

We haven't generated a summary for this paper yet.