Consistency of markov chain quasi-monte carlo on continuous state spaces

Annals of Statistics

Volumn 39, Issue 2, 2011, Pages 673-701

  Chen, S ^a   Dick, J ^b   Owen, A B ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Completely uniformly distributed; Coupling; Iterated function mappings; Markov chain Monte Carlo

Indexed keywords

EID: 79952931614     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/10-AOS831     Document Type: Article

References (45)

1. ALBERT, J. and CHIB, S. (1993). Bayesian analysis of binary and polychotomous response data. J. Amer. Statist. Assoc. 88 669-679. MR1224394
2. ALSMEYER, G. and FUH, C.-D. (2001). Limit theorems for iterated function mappings. Stochastic Process. Appl. 96 123-142. MR1856683
3. ANDRIEU, C. and MOULINES, E. (2006). On the ergodicity properties of some MCMC algorithms. Ann. Appl. Probab. 16 1462-1505. MR2260070 (Pubitemid 44662199)
4. ASH, R. B. (1972). Real Analysis and Probability. Academic Press, New York. MR0435320
5. BILLINGSLEY, P. (1999). Convergence of Probability Measures. Wiley, New York. MR1700749
6. CHAUDARY, S. (2004). Acceleration of Monte Carlo methods using low discrepancy sequences. Ph.D. thesis, UCLA.
7. CHENTSOV, N. N. (1967). Pseudorandom numbers for modelling Markov chains. Comput. Math. Math. Phys. 7 218-2332.
8. CRAIU, R. V. and LEMIEUX, C. (2007). Acceleration of the multiple-try Metropolis algorithm using antithetic and stratified sampling. Stat. Comput. 17 109-120. MR2380640
9. DEVROYE, L. (1986). Non-Uniform Random Variate Generation. Springer, New York. MR0836973
10. DIACONIS, P. and FREEDMAN, D. (1999). Iterated random functions. SIAM Rev. 41 45-76. MR1669737 (Pubitemid 129723747)
11. DICK, J. (2007). A note on the existence of sequences with small star discrepancy. J. Complexity 23 649-652. MR2372019 (Pubitemid 350122950)
12. DICK, J. (2009). On quasi-Monte Carlo rules achieving higher order convergence. In Monte Carlo and Quasi-Monte Carlo Methods 2008 (P. L'Ecuyer and A. B. Owen, eds.) 73-96. Springer, Heidelberg.
13. DOERR, B. and FRIEDRICH, T. (2009). Deterministic random walks on the two-dimensional grid. Combin. Probab. Comput. 18 123-144. MR2497377
14. FINNEY, D. J. (1947). The estimation from individual records of the relationship between dose and quantal response. Biometrika 34 320-334.
15. GAVER, D. and O'MURCHEARTAIGH, I. (1987). Robust empirical Bayes analysis of event rates. Technometrics 29 1-15. MR0876882 (Pubitemid 17526860)
16. GELFAND, A. E. and SMITH, A. F. M. (1990). Sampling-based approaches to calculating marginal densities. J. Amer. Statist. Assoc. 85 398-409. MR1141740
17. GELMAN, A. and SHIRLEY, K. (2010). Inference from simulations and monitoring convergence. In Handbook of Markov Chain Monte Carlo: Methods and Applications. (S. Brooks, A. Gelman, G. Jones and X.-L. Meng, eds.) 131-143. Chapman and Hall/CRC Press, Boca Raton, FL.
18. GHORPADE, S. R. and LIMAYE, B. V. (2006). A Course in Calculus and Real Analysis. Springer, New York. MR2229667
19. GNEWUCH, M., SRIVASTAV, A. andWINZEN, C. (2008). Finding optimal volume subintervals with k points and computing the star discrepancy are NP-hard. J. Complexity 24 154-172.
20. GORDON, R. D. (1941). Value of Mill's ratio of area to bounding ordinate and of the normal probability integral for large values of the argument. Ann. Math. Statist. 18 364-366. MR0005558
21. HAARIO, H., SAKSMAN, E. and TAMMINEN, J. (2001). An adaptive Metropolis algorithm. Bernoulli 7 223-242. MR1828504 (Pubitemid 33793059)
22. KNUTH, D. E. (1998). The Art of Computer Programming, 3rd ed. Seminumerical Algorithms 2. Addison-Wesley, Reading, MA. MR0378456
23. LEBESGUE, H. L. (1902). Intélgrale, longueur, aire. Ph.D. thesis, Univ. de Paris.
24. L'ECUYER, P., LECOT, C. and TUFFIN, B. (2008). A randomized quasi-Monte Carlo simulation method for Markov chains. Oper. Res. 56 958-975.
25. L'ECUYER, P. and LEMIEUX, C. (1999). Quasi-Monte Carlo via linear shift-register sequences. In Proceedings of the 1999 Winter Simulation Conference (P. A. Farrington, H. B. Nembhard, D. T. Sturrock and G. W. Evans, eds.) 632-639. IEEE Press, Piscataway, NJ. (Pubitemid 30574822)
26. LEMIEUX, C. and SIDORSKY, P. (2006). Exact sampling with highly uniform point sets. Math. Comput. Modelling 43 339-349. MR2214643 (Pubitemid 43330861)
27. LIAO, L. G. (1998). Variance reduction in Gibbs sampler using quasi random numbers. J. Comput. Graph. Statist. 7 253-266.
28. LIU, J. S. (2001). Monte Carlo Strategies in Scientific Computing. Springer, New York. MR1842342
29. MATSUMOTO, M. and NISHIMURA, T. (1998). Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Transactions on Modeling and Computer Simulation 8 3-30.
30. MARSDEN, J. E. andHOFFMAN, M. J. (1993). Elementary Classical Analysis, 2nd ed.Macmillan, New York.
31. MOROKOFF, W. and CAFLISCH, R. E. (1993). A quasi-Monte Carlo approach to particle simulation of the heat equ ation. SIAM J. Numer. Anal. 30 1558-1573. MR1249033
32. NEAL, R. M. (2003). Slice sampling. Ann. Statist. 31 705-767. MR1994729
33. NIEDERREITER, H. (1986). Multidimensional integration using pseudo-random numbers. Math. Programming Stud. 27 17-38. MR0836749 (Pubitemid 16534517)
34. NIEDERREITER, H. (1992). Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, PA. MR1172997
35. OWEN, A. B. (1995). Randomly permuted (t,m, s)-nets and (t, s)-sequences. In Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (H. Niederreiter and P. Jau-Shyong Shiue, eds.) 299-317. Springer, New York. MR1445791
36. OWEN, A. B. (2005). Multidimensional variation for quasi-Monte Carlo. In Contemporary Multivariate Analysis and Design of Experiments: In Celebration of Prof. Kai-Tai Fang's 65th Birthday (J. Fan and G. Li, eds.). World Sci. Publ., Hackensack, NJ. MR2271076
37. OWEN, A. B. and TRIBBLE, S. D. (2005). A quasi-Monte Carlo Metropolis algorithm. Proc. Natl. Acad. Sci. USA 102 8844-8849. MR2168266 (Pubitemid 40881041)
38. PROPP, J. G. andWILSON, D. B. (1996). Exact sampling with coupled Markov chains. Random Structures and Algorithms 9 223-252. MR1611693
39. ROBERT, C. P. and CASELLA, G. (2004). Monte Carlo Statistical Methods, 2nd ed. Springer, New York. MR2080278
40. ROBERTS, G. O., ROSENTHAL, J. S. and SCHWARTZ, P. O. (1998). Convergence properties of perturbed Markov chains. J. Appl. Probab. 35 1-11. MR1622440
41. ROSENBLATT, M. (1952). Remarks on a multivariate transformation. Ann. Math. Statist. 23 470-472. MR0049525
42. SOBOL', I. M. (1974). Pseudo-random numbers for constructing discrete Markov chains by the Monte Carlo method. USSR Comput. Math. Math. Phys. 14 36-45. MR0339444
43. TRIBBLE, S. D. (2007). Markov chain Monte Carlo algorithms using completely uniformly distributed driving sequences. Ph.D. thesis, Stanford Univ. MR2710331
44. TRIBBLE, S. D. and OWEN, A. B. (2008). Construction of weakly CUD sequences for MCMC sampling. Electron. J. Stat. 2 634-660. MR2426105
45. WEYL, H. (1916). über die gleichverteilung von zahlen mod. eins. Math. Ann. 77 313-352. MR1511862