On the asymptotic distribution of scrambled net quadrature

Annals of Statistics

Volumn 31, Issue 4, 2003, Pages 1282-1324

  Loh, Wei Liem ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Asymptotic normality; Computer experiment; Numerical integration; Quasi Monte Carlo; Scrambled net; Stein's method

Indexed keywords

EID: 0042859915     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/aos/1059655914     Document Type: Article

References (25)

1. BOLTHAUSEN, E. (1984). An estimate of the remainder in a combinatorial central limit theorem. Z Wahrsch. Verw. Gebiete 66 379-386.
2. BOLTHAUSEN.E. and GÖTZE, F. (1993). The rate of convergence for multivariate sampling statistics. Ann. Statist. 21 1692-1710.
3. DAVIS, P. J. and RABINOWITZ, P. (1984). Methods of Numerical Integration, 2nd ed. Academic Press, Orlando, FL.
4. EVANS, M. and SWARTZ, T. (2000). Approximating Integrals via Monte Carlo and Deterministic Methods. Oxford Univ. Press.
5. HICKERNELL, F. J. and YUE, R.-X. (2000). The mean square discrepancy of scrambled (t, s)-sequences. SIAM J. Numer. Anal. 38 1089-1112.
6. p bound for the remainder in a combinatorial central limit theorem. Ann. Probab. 6 231-249.
7. HONG, H. S., HICKERNELL, F. J. and WEI, G. (2001). The distribution of the discrepancy of scrambled digital (t, m, s)-nets. Preprint.
8. LOH, W.-L. (1996a). A combinatorial central limit theorem for randomized orthogonal array sampling designs. Ann. Statist. 24 1209-1224.
9. LOH, W.-L. (1996b). On Latin hypercube sampling. Ann. Statist. 24 2058-2080.
10. McKAY, M. D., BECKMAN, R. J. and CONOVER, W. J. (1979). A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21 239-245.
11. NIEDERREITER, H. (1992). Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia.
12. NIEDERREITER, H. and XING, C. (1998). Nets, (t, s)-sequences, and algebraic geometry. Random and Quasi-Random Point Sets. Lecture Notes in Statist. 138 267-302. Springer, New York.
13. OWEN, A. B. (1992a). Orthogonal arrays for computer experiments, integration and visualization. Statist. Sinica 2 439-452.
14. OWEN, A. B. (1992b). A central limit theorem for Latin hypercube sampling. J. R. Statist. Soc. Ser. B 54 541-551.
15. OWEN, A. B. (1995). Randomly permuted (t, m, s)-nets and (t, s)-sequences. Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Lecture Notes in Statist. 106 299-317. Springer, New York.
16. OWEN, A. B. (1997a). Monte Carlo variance of scrambled net quadrature. SIAM J. Numer. Anal. 34 1884-1910.
17. OWEN, A. B. (1997b). Scrambled net variance for integrals of smooth functions. Ann. Statist. 25 1541-1562.
18. OWEN, A. B. (1998). Scrambling Sobol' and Niederreiter-Xing points. J. Complexity 14 466-489.
19. SHORACK, G. R. (2000). Probability for Statisticians. Springer, New York.
20. STEIN, C. M. (1972). A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. Proc. Sixth Berkeley Symp. Math. Statist. Probab. 2 583-602. Univ. California Press, Berkeley.
21. STEIN, C. M. (1986). Approximate Computation of Expectations. IMS, Hayward, CA.
22. STEIN, M. L. (1987). Large sample properties of simulations using Latin hypercube sampling. Technometrics 29 143-151.
23. TANG, B. (1993). Orthogonal array-based Latin hypercubes. J. Amer. Statist. Assoc. 88 1392-1397.
24. YUE, R.-X. (1999). Variance of quadrature over scrambled unions of nets. Statist. Sinica 9 451-473.
25. YUE, R.-X. and MAO, S.-S. (1999). On the variance of quadrature over scrambled nets and sequences. Statist. Probab. Lett. 44 267-280.