Generalized Discrepancy of Random Points
Abstract
We study the -discrepancy of random point sets in high dimensions, with emphasis on small values of . Although the classical -discrepancy suffers from the curse of dimensionality for all , the gap between known upper and lower bounds remains substantial, in particular for small . To clarify this picture, we review the existing results for i.i.d.\ uniformly distributed points and derive new upper bounds for \emph{generalized} -discrepancies, obtained by allowing non-uniform sampling densities and corresponding non-negative quadrature weights. Using the probabilistic method, we show that random points drawn from optimally chosen product densities lead to significantly improved upper bounds. For these bounds are explicit and optimal; for general we obtain sharp asymptotic estimates. The improvement can be interpreted as a form of importance sampling for the underlying Sobolev space . Our results also reveal that, even with optimal densities, the curse of dimensionality persists for random points when , and it becomes most pronounced for small . This suggests that the curse should also hold for the classical -discrepancy for deterministic point sets.
Cite
@article{arxiv.2512.08364,
title = {Generalized Discrepancy of Random Points},
author = {Erich Novak and Friedrich Pillichshammer},
journal= {arXiv preprint arXiv:2512.08364},
year = {2025}
}