skip to main content
article
Free access

The mean square discrepancy of randomized nets

Published: 01 October 1996 Publication History

Abstract

One popular family of low dicrepancy sets is the (t, m, s)-nets. Recently a randomization of these nets that preserves their net property has been introduced. In this article a formula for the mean square L2-discrepancy of (0, m, s)-nets in base b is derived. This formula has a computational complexity of only O(s log(N) + s2) for large N or s, where N = bm is the number of points. Moreover, the root mean square L2-discrepancy of (0, m, s)-nets is show to be O(N-1[log(N)](s-1)/2) as N tends to infinity, the same asymptotic order as the known lower bound for the L2-discrepancy of an arbitrary set.

References

[1]
ABRAMOWITZ, M., AND STEGUN, I. A. Eds. 1964. Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables. U.S. Government Printing Office, Washington, DC.
[2]
FAURE, H. 1982. Discr~pance de suites associ~es f~ un systame de numeration (en dimension s). Acta Arith. 41, 337-351.
[3]
HEINRICH, S. 1996. Efficient algorithms for computing the L2 discrepancy. Math. Camp.
[4]
HICKERNELL, F.J. 1996. Quadrature error bounds with applications to lattice rules. SIAM J. Numer. Anal. 33, 65, 1621-1633.
[5]
HICKERNELL, F.J. A generalized discrepancy and quadrature error bound. Math. Camp., to appear.
[6]
KUIPERS, L., AND NIEDERREITER, H. 1974. Uniform Distribution of Sequences. Wiley, New York.
[7]
MOROKOFF, W. J., AND CAFLISCH, R.E. 1994. Quasi-random sequences and their discrepancies. SIAM J. Sci. Camput. 15, 1251-1279.
[8]
NIEDERREITER, H. 1978. Quasi-Monte Carlo methods and pseudo-random numbers. Bull. Amer. Math. Sac. 84, 957-1041.
[9]
NIEDERREITER, H. 1992. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, Pa.
[10]
OWEN, A. B. 1995. Equidistributed Latin hypercube samples. In Monte Carlo and Quasi- Monte Carlo Methods in Scientific Computing. Lecture Notes in Statistics, Vol. 106. Springer-Verlag, New York, 299-317.
[11]
OWEN, A.B. 1997a. Monte carlo variance of scrambled equidistribution quadrature. SIAM J. Numer. Anal. 34.
[12]
OWEN, A.B. 1997b. Scrambled net variance for integrals of smooth functions. Ann. Stat. 25 (to appear).
[13]
PRUDNIKOV, A. P., BRYCIIKOV, Y. A., AND MARICIIEV, O.I. 1986. Integrals and Series. Gordon and Breach, New York.
[14]
RITTER, K. 1995. Average case analysis of numerical problems. Ph.D. dissertation, Universitiit Erlangen-Nfirnberg, Erlangen, Germany.
[15]
ROTH, K.F. 1954. On irregularities of distribution. Mathematika 1, 73-79.
[16]
SACKS, J., AND YLVISACKER, D. 1970. Statistical design and integral approximation. In Proceedings of the 12th Biennial Canadian Math Congress. Canadian Math Society, Montreal, Canada, 115-136.
[17]
SLOAN, I. H., AND JOE, S. 1994. Lattice Methods for Multiple Integration. Oxford University Press, Oxford, England.
[18]
SOBOL', I. M. 1969. Multidimensional quadrature formulas and Hoar functions. Izdat "Nauka," Moscow (in Russian).
[19]
WARNOCK, T. T. 1972. Computational investigations of low discrepancy point sets. In Applications af Number Theory to Numerical Analysis. Academic Press, Orlando, Fla., pp. 319-343.
[20]
WOZNIAKOWSKI, H. 1991. Average case complexity of multivariate integration. Bull. Amer. Math. Sac. 24, 185-194.
[21]
ZAREMBA, S. K. 1968. Some applications of multidimensional integration by parts. Ann. Palan. Math. 21, 85-96.

Cited By

View all
  • (2025)Dimension reduction for Quasi-Monte Carlo methods via quadratic regressionMathematics and Computers in Simulation10.1016/j.matcom.2024.08.016227(371-390)Online publication date: Jan-2025
  • (2024)Randomized Quasi-Monte Carlo Methods on Triangles: Extensible Lattices and SequencesMethodology and Computing in Applied Probability10.1007/s11009-024-10084-z26:2Online publication date: 1-Jun-2024
  • (2023) On the Expected ℒ 2 –Discrepancy of Jittered Sampling Uniform distribution theory10.2478/udt-2023-000518:1(65-82)Online publication date: 10-Aug-2023
  • Show More Cited By

Recommendations

Reviews

Mitchell Snyder

Multidimensional integrals over the S -dimensional unit cube can be approximated by the sample mean of the integral evaluated on a point set, P , with N points. The quadrature error depends in part on how uniformly the points in P are distributed on the unit cube. A good set P for quadrature is one that has a small discrepancy, D P , where discrepancy is defined as a measure of the spread of the points in P . Several deterministic sets have been found that have smaller discrepancies than simple random points. These sets are often called quasi-random points. Much effort has been directed towards finding quasi-random sequences that have asymptotically small L -star discrepancies as N tends to infinity. The t,m,s -nets are one example. Calculating the L -star discrepancy of a particular set is impractical because it requires O N 5 operations. By comparison, the L 2 -star discrepancy is easier to compute, requiring only O N 2 operations using a naive algorithm, or O N log 5 N operations using a more sophisticated algorithm. Recently, a randomization of t,m,s -nets was proposed that preserves their net properties. The aim is to obtain probabilistic quadrature error estimates in a similar manner as one would for simple Monte Carlo quadrature. In this paper, a formula for the mean square L 2 -discrepancy of randomized 0,m,s -nets is derived that requires only O s log N+s 2 mathematical operations as N , s , or both tend to infinity. The L 2 -discrepancy for these randomized nets is shown to decay like O N -1 log N s-1 2 for large N , the same asymptotic order as the known lower bound for the L 2 -discrepancy of an arbitrary set. — From the Introduction The paper consists primarily of mathematical derivations of the expected value of the square of the discrepancy, under various assumptions, as well as asymptotic derivations. The paper is highly mathematical and is readable only by mathematicians with a background in probability theory. It is well structured and, for those readers, should not be difficult to follow. The results should be applicable by people working in the fields of numerical quadrature and differentiation and Monte Carlo simulation, even if they cannot follow the derivations.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Modeling and Computer Simulation
ACM Transactions on Modeling and Computer Simulation  Volume 6, Issue 4
Oct. 1996
78 pages
ISSN:1049-3301
EISSN:1558-1195
DOI:10.1145/240896
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1996
Published in TOMACS Volume 6, Issue 4

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. multidimensional integration
  2. number-theoretic nets and sequences
  3. quadrature
  4. quasi-Monte Carlo methods
  5. quasi-random sets

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)73
  • Downloads (Last 6 weeks)18
Reflects downloads up to 25 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2025)Dimension reduction for Quasi-Monte Carlo methods via quadratic regressionMathematics and Computers in Simulation10.1016/j.matcom.2024.08.016227(371-390)Online publication date: Jan-2025
  • (2024)Randomized Quasi-Monte Carlo Methods on Triangles: Extensible Lattices and SequencesMethodology and Computing in Applied Probability10.1007/s11009-024-10084-z26:2Online publication date: 1-Jun-2024
  • (2023) On the Expected ℒ 2 –Discrepancy of Jittered Sampling Uniform distribution theory10.2478/udt-2023-000518:1(65-82)Online publication date: 10-Aug-2023
  • (2021) On the dependence structure and quality of scrambled ( t , m , s )-nets Monte Carlo Methods and Applications10.1515/mcma-2020-207927:1(1-26)Online publication date: 10-Jan-2021
  • (2021) On a partition with a lower expected -discrepancy than classical jittered sampling Journal of Complexity10.1016/j.jco.2021.101616(101616)Online publication date: Nov-2021
  • (2021)On Efficient Design of Pilot Experiment for Generalized Linear ModelsJournal of Statistical Theory and Practice10.1007/s42519-021-00222-y15:4Online publication date: 2-Nov-2021
  • (2018)Randomized Quasi-Monte Carlo: An Introduction for PractitionersMonte Carlo and Quasi-Monte Carlo Methods10.1007/978-3-319-91436-7_2(29-52)Online publication date: 4-Jul-2018
  • (2016)Random fuzzy numbers generation with cubic Hermit membership function and its application in simulationInternational Journal of Computing Science and Mathematics10.1504/IJCSM.2016.0787137:4(301-311)Online publication date: 1-Jan-2016
  • (2015)Spatial low-discrepancy sequences, spherical cone discrepancy, and applications in financial modelingJournal of Computational and Applied Mathematics10.1016/j.cam.2015.02.023286:C(28-53)Online publication date: 1-Oct-2015
  • (2015)Construction of Interlaced Scrambled Polynomial Lattice Rules of Arbitrary High OrderFoundations of Computational Mathematics10.1007/s10208-014-9226-815:5(1245-1278)Online publication date: 1-Oct-2015
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media