Another measure of discrepancy for numeric sequences is the star discrepancy D∗ N , which is equivalent to the Kolmogorov–Smirnov distance between the empirical distribution function FN (x) of the sequence and the uniform distribution function F(x) = x on [0, 1]. Show that D∗ N ≤ DN ≤ 2D∗ N .
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here