Skip to main content

Ergodicity of Markov chain Monte Carlo with reversible proposal

  • K. Kamatani (a1)

We describe the ergodic properties of some Metropolis–Hastings algorithms for heavy-tailed target distributions. The results of these algorithms are usually analyzed under a subgeometric ergodic framework, but we prove that the mixed preconditioned Crank–Nicolson (MpCN) algorithm has geometric ergodicity even for heavy-tailed target distributions. This useful property comes from the fact that, under a suitable transformation, the MpCN algorithm becomes a random-walk Metropolis algorithm.

Corresponding author
* Postal address: Graduate School of Engineering Science and Center for Mathematical Modeling and Data Science, Osaka University, 1-3 Machikaneyama-cho, Toyonaka, Osaka 560-8531, Japan. Email address:
Hide All
[1] Atchadé Y. and Fort G. (2010). Limit theorems for some adaptive MCMC algorithms with subgeometric kernels. Bernoulli 16, 116154.
[2] Beskos A., Roberts G., Stuart A. and Voss J. (2008). MCMC methods for diffusion bridges. Stoch. Dyn. 8, 319350.
[3] Bingham N. H., Goldie C. M. and Teugels J. L. (1989). Regular Variation (Encyclopedia Math. Appl. 27). Cambridge University Press.
[4] Brooks S., Gelman A., Jones G. L. and Meng X.-L. (2011). Handbook of Markov Chain Monte Carlo. Chapman & Hall/CRC, Boca Raton, FL.
[5] Chen Y., Keyes D., Law K. J. H. and Ltaief H. (2015). Accelerated dimension-independent adaptive Metropolis. Preprint. Available at
[6] Dellaportas P. and Roberts G. O. (2003). An introduction to MCMC. In Spatial Statistics and Computational Methods (Aalborg, 2001; Lecture Notes Statist. 173), Springer, New York, pp. 141.
[7] Douc R., Fort G., Moulines E. and Soulier P. (2004). Practical drift conditions for subgeometric rates of convergence. Ann. Appl. Prob. 14, 13531377.
[8] Dutta S. (2012). Multiplicative random walk Metropolis-Hastings on the real line. Sankhyā B 74, 315342.
[9] Fort G. and Moulines E. (2000). V-subgeometric ergodicity for a Hastings-Metropolis algorithm. Statist. Prob. Lett. 49, 401410.
[10] Fort G. and Moulines E. (2003). Polynomial ergodicity of Markov transition kernels. Stoch. Process. Appl. 103, 5799.
[11] Hairer M., Stuart A. M. and Vollmer S. J. (2014). Spectral gaps for a Metropolis–Hastings algorithm in infinite dimensions. Ann. Appl. Prob. 24, 24552490.
[12] Hu Z., Yao Z. and Li J. (2017). On an adaptive preconditioned Crank-Nicolson MCMC algorithm for infinite dimensional Bayesian inference. J. Comput. Phys. 332, 492503.
[13] Jarner S. F. and Hansen E. (2000). Geometric ergodicity of Metropolis algorithms. Stoch. Process. Appl. 85, 341361.
[14] Jarner S. F. and Roberts G. O. (2002). Polynomial convergence rates of Markov chains. Ann. Appl. Prob. 12, 224247.
[15] Jarner S. F. and Roberts G. O. (2007). Convergence of heavy-tailed Monte Carlo Markov chain algorithms. Scand. J. Statist. 34, 781815.
[16] Jarner S. F. and Tweedie R. L. (2003). Necessary conditions for geometric and polynomial ergodicity of random-walk-type Markov chains. Bernoulli 9, 559578.
[17] Johnson L. T. and Geyer C. J. (2012). Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm. Ann. Statist. 40, 30503076.
[18] Kamatani K. (2009). Metropolis-Hastings algorithms with acceptance ratios of nearly 1. Ann. Inst. Statist. Math. 61, 949967.
[19] Kamatani K. (2014). Efficient strategy for the Markov chain Monte Carlo in high-dimension with heavy-tailed target probability distribution. Preprint. Available at
[20] Kamatani K. and Uchida M. (2015). Hybrid multi-step estimators for stochastic differential equations based on sampled data. Statist. Inf. Stoch. Process. 18, 177204.
[21] Law K. J. H. (2014). Proposals which speed up function-space MCMC. J. Comput. Appl. Math. 262, 127138.
[22] Livingstone S. (2015). Geometric ergodicity of the Random Walk Metropolis with position-dependent proposal covariance. Preprint. Available at
[23] Mengersen K. L. and Tweedie R. L. (1996). Rates of convergence of the Hastings and Metropolis algorithms. Ann. Statist. 24, 101121.
[24] Meyn S. and Tweedie R. L. (2009). Markov Chains and Stochastic Stability, 2nd edn. Cambridge University Press>.
[25] Neal R. M. (1999). Regression and classification using Gaussian process priors. In Bayesian Statistics, 6 (Alcoceber, 1998), Oxford University Press, New York, pp. 475501.
[26] Nummelin E. (1984). General Irreducible Markov Chains and Nonnegative Operators (Camb. Tracts Math. 83). Cambridge University Press.
[27] Resnick S. I. (2008). Extreme Values, Regular Variation and Point Processes. Springer, New York.
[28] Roberts G. O. and Tweedie R. L. (1996). Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83, 95110.
[29] Rudolf D. and Sprungk B. (2016). On a generalization of the preconditioned Crank–Nicolson Metropolis algorithm. Found. Comput. Math. 35pp.
[30] Tierney L. (1994). Markov chains for exploring posterior distributions. Ann. Statist. 22, 17011762.
[31] Tuominen P. and Tweedie R. L. (1994). Subgeometric rates of convergence of f-ergodic Markov chains. Adv. Appl. Prob. 26, 775798.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Applied Probability
  • ISSN: 0021-9002
  • EISSN: 1475-6072
  • URL: /core/journals/journal-of-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 28 *
Loading metrics...

Abstract views

Total abstract views: 121 *
Loading metrics...

* Views captured on Cambridge Core between 22nd June 2017 - 16th January 2018. This data will be updated every 24 hours.