An elementary proof of a lower bound for the inverse of the star discrepancy

DOI10.1016/J.JCO.2022.101713MaRDI QIDQ2685069OpenAlexFDO

Authors Stefan Steinerberger

Publication date 17 February 2023

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

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

zbMATH Keywords

curse of dimensionalityinversestar discrepancy

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Irregularities of distribution, discrepancy (11K38)

Recommendations

• The inverse of the star-discrepancy depends linearly on the dimension
• An improved bound for the star discrepancy of sequences in the unit interval
• Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy
• On the inverse of the discrepancy for infinite dimensional infinite sequences
• On an explicit lower bound for the star discrepancy in three dimensions

Cites work

• A combinatorial problem; stability and order for models and theories in infinitary languages
• A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy
• A lower bound for the discrepancy of a random point set
• Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy
• Covering numbers, dyadic chaining and discrepancy
• Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples
• Improving a constant in high-dimensional discrepancy estimates
• Irregularities of distributions and extremal sets in combinatorial complexity theory
• On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence
• On the density of families of sets
• Probabilistic lower bounds for the discrepancy of Latin hypercube samples
• The inverse of the star-discrepancy depends linearly on the dimension

Cited in

(6)

• A lower bound for the discrepancy of a random point set
• Irregularities of distributions and extremal sets in combinatorial complexity theory
• Computing bounds for the star discrepancy
• An algorithm to compute bounds for the star discrepancy
• A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
• An elementary proof of a lower bound for the inverse of the star discrepancy

This page was built for publication: An elementary proof of a lower bound for the inverse of the star discrepancy

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