A lower bound for the discrepancy of a random point set

From MaRDI portal
Publication:2252138

DOI10.1016/J.JCO.2013.06.001zbMATH Open1295.60012arXiv1210.0572OpenAlexW2163000644MaRDI QIDQ2252138FDOQ2252138


Authors: Benjamin Doerr Edit this on Wikidata


Publication date: 16 July 2014

Published in: Journal of Complexity (Search for Journal in Brave)

Abstract: We show that there is a constant K>0 such that for all N,sinN, sleN, the point set consisting of N points chosen uniformly at random in the s-dimensional unit cube [0,1]s with probability at least 1exp(Theta(s)) admits an axis parallel rectangle [0,x]subseteq[0,1]s containing KsqrtsN points more than expected. Consequently, the expected star discrepancy of a random point set is of order sqrts/N.


Full work available at URL: https://arxiv.org/abs/1210.0572




Recommendations




Cites Work


Cited In (23)





This page was built for publication: A lower bound for the discrepancy of a random point set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252138)