Skip to main content

New Inputs and Methods for Markov Chain Quasi-Monte Carlo

  • Conference paper
  • First Online:
Monte Carlo and Quasi-Monte Carlo Methods 2010

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 23))

Abstract

We present some new results on incorporating quasi-Monte Carlo rules into Markov chain Monte Carlo. First, we present some new constructions of points, fully equidistributed LFSRs, which are small enough that the entire point set can be used in a Monte Carlo calculation. Second, we introduce some antithetic and round trip sampling constructions and show that they preserve the completely uniformly distributed property necessary for QMC in MCMC. Finally, we also give some new empirical results. We see large improvements in sampling some GARCH and stochastic volatility models.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Chen, S., Dick, J., Owen, A.B.: Consistency of Markov chain quasi-Monte Carlo on continuous state spaces. 39, 673–701 (2011).

    Google Scholar 

  2. Chentsov, N.N.: Pseudorandom numbers for modelling Markov chains. Computational Mathematics and Mathematical Physics 7, 218–233 (1967)

    Google Scholar 

  3. Craiu, R.V., Meng, X.L.: Multi-process parallel antithetic coupling for backward and forward Markov chain Monte Carlo. Annals of Statistics 33, 661–697 (2005)

    Google Scholar 

  4. Cranley, R., Patterson, T.: Randomization of number theoretic methods for multiple integration. SIAM Journal of Numerical Analysis 13, 904–914 (1976)

    Google Scholar 

  5. Duan, J.C.: The garch option pricing model. Mathematical Finance 5(1), 13–32 (1995)

    Google Scholar 

  6. Frigessi, A., Gäsemyr, J., Rue, H.H.: Antithetic coupling of two Gibbs sampler chains. Annals of Statistics 28, 1128–1149 (2000)

    Google Scholar 

  7. Hansen, T., Mullen, G.L.: Primitive polynomials over finite fields. Mathematics of Computation 59, 639–643, S47–S50 (1992)

    Google Scholar 

  8. Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 97–109 (1970)

    Google Scholar 

  9. L’Ecuyer, P.: Tables of maximallychenmatsumotonishimuraowen-equidistributed combined lfsr generators. Mathematics of Computation 68, 261–269 (1999)

    Google Scholar 

  10. Levin, M.B.: Discrepancy estimates of completely uniformly distributed and pseudo-random number sequences. International Mathematics Research Notices pp. 1231–1251 (1999)

    Google Scholar 

  11. Liao, L.G.: Variance reduction in Gibbs sampler using quasi random numbers. Journal of Computational and Graphical Statistics 7, 253–266 (1998)

    Google Scholar 

  12. Liu, J.S.: Monte Carlo strategies in scientific computing. Springer, New York (2001)

    Google Scholar 

  13. Owen, A.B., Tribble, S.D.: A quasi-Monte Carlo Metropolis algorithm. Proceedings of the National Academy of Sciences 102(25), 8844–8849 (2005)

    Google Scholar 

  14. Robert, C.P., Casella, G.: Monte Carlo Statistical Methods, 2nd edn. Springer, New York (2004)

    Google Scholar 

  15. Sobol’, I.M.: Pseudo-random numbers for constructing discrete Markov chains by the Monte Carlo method. USSR Computational Mathematics and Mathematical Physics 14(1), 36–45 (1974)

    Google Scholar 

  16. Tootill, J.P.R., Robinson, W.D., Eagle, D.J.: An asymptotically random Tausworthe sequence. Journal of the ACM 20(3), 469–481 (1973)

    Google Scholar 

  17. Tribble, S.D.: Markov chain Monte Carlo algorithms using completely uniformly distributed driving sequences. Ph.D. thesis, Stanford University (2007)

    Google Scholar 

  18. Tribble, S.D., Owen, A.B.: Construction of weakly CUD sequences for MCMC sampling. Electronic Journal of Statistics 2, 634–660 (2008)

    Google Scholar 

  19. Zhu, J.: A simple and exact simulation approach to Heston model. Tech. rep., Lucht Probst Associates (2008)

    Google Scholar 

Download references

Acknowledgements

This work was supported by grant DMS-0906056 from the U.S. National Science Foundation and by JSPS Grant-in-Aid for Scientific Research No.19204002, No.21654017, No.23244002 and JSPS Core-to-Core Program No.18005. We thank the organizers of MCQMC 2010, Leszek Pleskota and Henryk Woźniakowski, for providing an excellent scientific venue.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Su Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, S., Matsumoto, M., Nishimura, T., Owen, A.B. (2012). New Inputs and Methods for Markov Chain Quasi-Monte Carlo. In: Plaskota, L., Woźniakowski, H. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2010. Springer Proceedings in Mathematics & Statistics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27440-4_15

Download citation

Publish with us

Policies and ethics