Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy

Journal of Complexity

Volumn 24, Issue 2, 2008, Pages 154-172

  Gnewuch, Michael ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Bracketing; Covering number; Extreme discrepancy; Metric entropy; Star discrepancy

Indexed keywords

APPROXIMATION ALGORITHMS; NEURAL NETWORKS; NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

BRACKETING; COVERING NUMBER; EXTREME DISCREPANCY; METRIC ENTROPY; STAR DISCREPANCY;

COMPUTATIONAL GEOMETRY;

EID: 40749150012     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2007.08.003     Document Type: Article

References (16)

1. Doerr B. Generating randomized roundings with cardinality constraints and derandomizations. In: Durand B., and Thomas W. (Eds). Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS'06) (2006), LNiCS 3884 571-583
2. B. Doerr, M. Gnewuch, Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding, Berichtsreihe des Mathematischen Seminars der Universität Kiel, Report 06-14, 2006 (to appear in the proceedings of Monte Carlo and quasi-Monte Carlo Methods 2006).
3. Doerr B., Gnewuch M., and Srivastav A. Bounds and constructions for the star-discrepancy via δ-covers. J. Complexity 21 (2005) 691-709
4. Drmota M., and Tichy R.F. Sequences, Discrepancies and Applications, Lecture Notes in Mathematics vol. 1651 (1997), Springer, Berlin
5. ∞-extreme discrepancy, Electron. J. Combin. 12 (2005), Research Paper 54.
6. Gnewuch M., and Doerr B. Geometric discrepancies and δ-covers. Oberwolfach Rep. 1 (2004) 687-690
7. Haussler D. Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension. J. Combin. Theory A 69 (1995) 217-232
8. Heinrich S., Novak E., Wasilkowski G.W., and Woźniakowski H. The inverse of the star-discrepancy depends linearly on the dimension. Acta Arith. 96 (2001) 279-302
9. s. Math. Comp. 73 (2004) 1885-1905
10. Hinrichs A. Covering numbers. Vapnik-Červonenkis classes and bounds for the star-discrepancy, J. Complexity 20 (2004) 477-483
11. Mhaskar H.N. On the tractability of multivariate integration and approximation by neural networks. J. Complexity 20 (2004) 561-590
12. Niederreiter H. Random Number Generation and Quasi-Monte Carlo Methods (1992), SIAM, Philadelphia
13. Novak E., and Woźniakowski H. When are integration and discrepancy tractable?. In: DeVore R.A., Iserles A., and Süli E. (Eds). Foundations of Computational Mathematics (2001), Cambridge University Press, Cambridge 211-266
14. Talagrand M. Sharper bounds for Gaussian and empirical processes. Ann. Probab. 22 (1994) 28-76
15. Thiémard E. An algorithm to compute bounds for the star discrepancy. J. Complexity 17 (2001) 850-880
16. van der Vaart A.W., and Wellner J.A. Weak Convergence and Empirical Processes (1996), Springer Series in Statistics, Springer, New York