Probabilistic discrepancy bound for monte carlo point sets

Mathematics of Computation

Volumn 83, Issue 287, 2014, Pages 1373-1381

  Aistleitner, Christoph ^a   Hofer, Markus ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84894783657     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-2013-02773-1     Document Type: Article

References (14)

1. Christoph Aistleitner, Covering numbers, dyadic chaining and discrepancy, J. Complexity 27 (2011), no. 6, 531-540, DOI 10.1016/j.jco.2011.03.001. MR2846704 (2012j:11149)
2. Benjamin Doerr, Michael Gnewuch, Peter Kritzer, and Friedrich Pillichshammer, Componentby-component construction of low-discrepancy point sets of small size, Monte Carlo Methods Appl. 14 (2008), no. 2, 129-149, DOI 10.1515/MCMA.2008.007. MR2431686 (2009e:11144)
3. Benjamin Doerr, Michael Gnewuch, and Magnus Wahlström, Algorithmic construction of low-discrepancy point sets via dependent randomized rounding, J. Complexity 26 (2010), no. 5, 490-507, DOI 10.1016/j.jco.2010.03.004. MR2719644 (2011j:11139)
4. Panos Giannopoulos, Christian Knauer, Magnus Wahlström, and Daniel Werner, Hardness of discrepancy computation and isin;-net verification in high dimension, J. Complexity 28 (2012), no. 2, 162-176, DOI 10.1016/j.jco.2011.09.001. MR2900826
5. Michael Gnewuch, Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy, J. Complexity 24 (2008), no. 2, 154-172, DOI 10.1016/j.jco.2007.08.003. MR2400314 (2009e:11145)
6. Michael Gnewuch, Construction of minimal bracketing covers for rectangles, Electron. J. Combin. 15 (2008), no. 1, Research Paper 95, 20. MR2426158 (2009e:52034)
7. M. Gnewuch. Entropy, randomization, derandomization, and discrepancy. In Monte Carlo and quasi-Monte Carlo methods 2010. Springer Proceedings in Mathematics and Statistics, Vol. 23, L. Plaskota; H. Woźniakowski (Eds.), Springer, p. 43 - 78, 2012.
8. Michael Gnewuch, Anand Srivastav, and Carola Winzen, Finding optimal volume subintervals with k-points and calculating the star discrepancy are NP-hard problems, J. Complexity 25 (2009), no. 2, 115-127, DOI 10.1016/j.jco.2008.10.001. MR2513611 (2010i:68156)
9. Stefan Heinrich, Some open problems concerning the star-discrepancy, J. Complexity 19 (2003), no. 3, 416-419, DOI 10.1016/S0885-064X(03)00014-1. Numerical integration and its complexity (Oberwolfach, 2001). MR1984123 (2004b:11112)
10. Stefan Heinrich, Erich Novak, Grzegorz W. Wasilkowski, and Henryk Woźniakowski, The inverse of the star-discrepancy depends linearly on the dimension, Acta Arith. 96 (2001), no. 3, 279-302, DOI 10.4064/aa96-3-7. MR1814282 (2002b:11103)
11. Aicke Hinrichs, Covering numbers, Vapnik-Červonenkis classes and bounds for the stardiscrepancy, J. Complexity 20 (2004), no. 4, 477-483, DOI 10.1016/j.jco.2004.01.001. MR2068153 (2005e:11098)
12. A. Hinrichs. Discrepancy, Integration and Tractability. Preprint. Available at http://users. minet.uni-jena.de/~hinrichs/paper/50/article.pdf.
13. Erich Novak and Henryk Woźniakowski, Tractability of multivariate problems. Vol. 1: Linear information, EMS Tracts in Mathematics, vol. 6, European Mathematical Society (EMS), Zürich, 2008. MR2455266 (2009m:46037)
14. Erich Novak and Henryk Woźniakowski, Tractability of multivariate problems. Volume II: Standard information for functionals, EMS Tracts in Mathematics, vol. 12, European Mathematical Society (EMS), Zürich, 2010. MR2676032 (2011h:46093)