Metropolis–Hastings Algorithms with acceptance ratios of nearly 1



We develop the results on polynomial ergodicity of Markov chains and apply to the Metropolis–Hastings algorithms based on a Langevin diffusion. When a prescribed distribution p has heavy tails, the Metropolis–Hastings algorithms based on a Langevin diffusion do not converge to p at any geometric rate. However, those Langevin based algorithms behave like the diffusion itself in the tail area, and using this fact, we provide sufficient conditions of a polynomial rate convergence. By the feature in the tail area, our results can be applied to a large class of distributions to which p belongs. Then, we show that the convergence rate can be improved by a transformation. We also prove central limit theorems for those algorithms.


Metropolis–Hastings algorithm Polynomial ergodicity Langevin diffusion Metropolis adjusted Langevin algorithm 


  1. Douc R., Fort G., Moulines E. (2004) Practical drift conditions for subgeometric rates of convergence. The Annals of Applied Probability 14: 1353–1377MATHMathSciNetGoogle Scholar
  2. Fort G., Moulines E. (2000) V-subgeometric ergodicity for a Hastings–Metropolis algorithm. Statistics Probability Letters 49: 401–410MATHCrossRefMathSciNetGoogle Scholar
  3. Fort G., Roberts G.O. (2005) Subgeometric ergodicity of strong Markov processes. The Annals of Applied Probability 15: 1565–1589MATHCrossRefMathSciNetGoogle Scholar
  4. Grenander U., Miller M.I. (1994) Representations of knowledge in complex systems. Journal of the Royal Statistical Society, Series B (Statistical Methodology) 56: 549–603MATHMathSciNetGoogle Scholar
  5. Hastings W.K. (1970) Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57: 97–109MATHCrossRefGoogle Scholar
  6. Jarner, S. F., Roberts, G. O. (2002a). Convergence of heavy tailed MCMC algorithms.
  7. Jarner S.F., Roberts G.O. (2002b) Polynomial convergence rates of Markov chains. The Annals of Applied Probability 12: 224–247MATHCrossRefMathSciNetGoogle Scholar
  8. Jarner S.F., Roberts G.O. (2007) Convergence of Heavy-tailed Monte Carlo Markov Chain Algorithms. Scandinavian Journal of Statistics 34: 781–815MATHMathSciNetGoogle Scholar
  9. Jones G.L. (2004) On the Markov chain central limit theorem. Probability Surveys 1: 299–320CrossRefMathSciNetGoogle Scholar
  10. Mengersen K.L., Tweedie R.L. (1996) Rates of convergence of the Hastings and Metropolis algorithms. The Annals of Statistics 24: 101–121MATHCrossRefMathSciNetGoogle Scholar
  11. Metropolis N., Rosenbluth W.A., Rosenbluth M.N., Teller A.H., Teller E. (1953) Equations of state calculations by fast computing machines. Journal of Chemical Physics 21: 1087–1092CrossRefGoogle Scholar
  12. Meyn S.P., Tweedie R.L. (1993) Markov chains and stochastic stability. Springer, LondonMATHGoogle Scholar
  13. Nummelin E. (1984) General irreducible Markov chains and nonnegative operators. Cambridge University Press, CambridgeGoogle Scholar
  14. Roberts G.O., Stramer O. (2002) Langevin diffusions and Metropolis-Hastings algorithms. International workshop in applied probability. Methodology and Computing in Applied Probability 4: 337–357MATHCrossRefMathSciNetGoogle Scholar
  15. Roberts G.O., Tweedie R.L. (1996a) Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83: 95–110MATHCrossRefMathSciNetGoogle Scholar
  16. Roberts G.O., Tweedie R.L. (1996b) Exponential convergence of Langevin diffusions and their discrete approximations. Bernoulli 2: 341–363MATHCrossRefMathSciNetGoogle Scholar
  17. Stramer O., Tweedie R.L. (1999a) Langevin-type models. I. Diffusions with given stationary distributions and their discretizations. Methodology and Computing in Applied Probability 1: 283–306MATHCrossRefMathSciNetGoogle Scholar
  18. Stramer O., Tweedie R.L. (1999b) Langevin-type models. II. Self-targeting candidates for MCMC algorithms. Methodology and Computing in Applied Probability 1: 307–328MATHCrossRefMathSciNetGoogle Scholar
  19. Tuominen P., Tweedie R.L. (1994) Subgeometric rates of convergence of f-ergodic Markov chains. Advances in Applied Probability 26: 775–798MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© The Institute of Statistical Mathematics, Tokyo 2008

Authors and Affiliations

  1. 1.Graduate School of Mathematical SciencesThe University of TokyoTokyoJapan

Personalised recommendations