IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v85y2000i2p341-361.html
   My bibliography  Save this article

Geometric ergodicity of Metropolis algorithms

Author

Listed:
  • Jarner, Søren Fiig
  • Hansen, Ernst

Abstract

In this paper we derive conditions for geometric ergodicity of the random-walk-based Metropolis algorithm on . We show that at least exponentially light tails of the target density is a necessity. This extends the one-dimensional result of Mengersen and Tweedie (1996, Ann. Statist. 24, 101-121). For super-exponential target densities we characterize the geometrically ergodic algorithms and we derive a practical sufficient condition which is stable under addition and multiplication. This condition is especially satisfied for the class of densities considered in Roberts and Tweedie (1996, Biometrika 83, 95-110).

Suggested Citation

  • Jarner, Søren Fiig & Hansen, Ernst, 2000. "Geometric ergodicity of Metropolis algorithms," Stochastic Processes and their Applications, Elsevier, vol. 85(2), pages 341-361, February.
    • Handle: RePEc:eee:spapps:v:85:y:2000:i:2:p:341-361
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(99)00082-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Roberts, G. O. & Tweedie, R. L., 1999. "Bounds on regeneration times and convergence rates for Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 80(2), pages 211-229, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lacour, Claire, 2008. "Nonparametric estimation of the stationary density and the transition density of a Markov chain," Stochastic Processes and their Applications, Elsevier, vol. 118(2), pages 232-260, February.
    2. Denis Belomestny & Leonid Iosipoi, 2019. "Fourier transform MCMC, heavy tailed distributions and geometric ergodicity," Papers 1909.00698, arXiv.org, revised Dec 2019.
    3. Franks, Jordan & Vihola, Matti, 2020. "Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance," Stochastic Processes and their Applications, Elsevier, vol. 130(10), pages 6157-6183.
    4. Kamatani, Kengo, 2020. "Random walk Metropolis algorithm in high dimension with non-Gaussian target distributions," Stochastic Processes and their Applications, Elsevier, vol. 130(1), pages 297-327.
    5. Yves Atchade, 2005. "An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift," RePAd Working Paper Series LRSP-WP1, Département des sciences administratives, UQO.
    6. Yves F. Atchadé, 2006. "An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift," Methodology and Computing in Applied Probability, Springer, vol. 8(2), pages 235-254, June.
    7. RADU HERBEI & IAN W. McKEAGUE, 2009. "Hybrid Samplers for Ill‐Posed Inverse Problems," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 36(4), pages 839-853, December.
    8. Allassonnière, Stéphanie & Kuhn, Estelle, 2015. "Convergent stochastic Expectation Maximization algorithm with efficient sampling in high dimension. Application to deformable template model estimation," Computational Statistics & Data Analysis, Elsevier, vol. 91(C), pages 4-19.
    9. Dalalyan, Arnak S. & Karagulyan, Avetik, 2019. "User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient," Stochastic Processes and their Applications, Elsevier, vol. 129(12), pages 5278-5311.
    10. Fort, Gersende & Moulines, Eric, 2000. "V-Subgeometric ergodicity for a Hastings-Metropolis algorithm," Statistics & Probability Letters, Elsevier, vol. 49(4), pages 401-410, October.
    11. Fort, G. & Moulines, E., 2003. "Polynomial ergodicity of Markov transition kernels," Stochastic Processes and their Applications, Elsevier, vol. 103(1), pages 57-99, January.
    12. Chris Sherlock & Anthony Lee, 2022. "Variance Bounding of Delayed-Acceptance Kernels," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 2237-2260, September.
    13. Arnak S. Dalalyan, 2017. "Theoretical guarantees for approximate sampling from smooth and log-concave densities," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(3), pages 651-676, June.
    14. David A. Spade, 2020. "Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths," Computational Statistics, Springer, vol. 35(4), pages 2043-2076, December.
    15. O. F. Christensen & J. Møller & R. P. Waagepetersen, 2001. "Geometric Ergodicity of Metropolis-Hastings Algorithms for Conditional Simulation in Generalized Linear Mixed Models," Methodology and Computing in Applied Probability, Springer, vol. 3(3), pages 309-327, September.
    16. Belomestny, Denis & Iosipoi, Leonid, 2021. "Fourier transform MCMC, heavy-tailed distributions, and geometric ergodicity," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 181(C), pages 351-363.
    17. Samuel Livingstone, 2021. "Geometric Ergodicity of the Random Walk Metropolis with Position-Dependent Proposal Covariance," Mathematics, MDPI, vol. 9(4), pages 1-14, February.
    18. Matti Vihola & Jouni Helske & Jordan Franks, 2020. "Importance sampling type estimators based on approximate marginal Markov chain Monte Carlo," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 47(4), pages 1339-1376, December.
    19. Samuel Livingstone & Giacomo Zanella, 2022. "The Barker proposal: Combining robustness and efficiency in gradient‐based MCMC," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 496-523, April.
    20. Vihola, Matti, 2011. "On the stability and ergodicity of adaptive scaling Metropolis algorithms," Stochastic Processes and their Applications, Elsevier, vol. 121(12), pages 2839-2860.
    21. Sanha Noh, 2020. "Posterior Inference on Parameters in a Nonlinear DSGE Model via Gaussian-Based Filters," Computational Economics, Springer;Society for Computational Economics, vol. 56(4), pages 795-841, December.
    22. Medina-Aguayo, Felipe & Rudolf, Daniel & Schweizer, Nikolaus, 2020. "Perturbation bounds for Monte Carlo within Metropolis via restricted approximations," Stochastic Processes and their Applications, Elsevier, vol. 130(4), pages 2200-2227.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fort, G. & Moulines, E., 2003. "Polynomial ergodicity of Markov transition kernels," Stochastic Processes and their Applications, Elsevier, vol. 103(1), pages 57-99, January.
    2. Jeffrey S. Rosenthal, 2003. "Geometric Convergence Rates for Time-Sampled Markov Chains," Journal of Theoretical Probability, Springer, vol. 16(3), pages 671-688, July.
    3. Hervé, Loïc & Ledoux, James, 2014. "Approximating Markov chains and V-geometric ergodicity via weak perturbation theory," Stochastic Processes and their Applications, Elsevier, vol. 124(1), pages 613-638.
    4. Yang, Jun & Roberts, Gareth O. & Rosenthal, Jeffrey S., 2020. "Optimal scaling of random-walk metropolis algorithms on general target distributions," Stochastic Processes and their Applications, Elsevier, vol. 130(10), pages 6094-6132.
    5. Jarner, S. F. & Tweedie, R. L., 2002. "Convergence rates and moments of Markov chains associated with the mean of Dirichlet processes," Stochastic Processes and their Applications, Elsevier, vol. 101(2), pages 257-271, October.
    6. Svetlana Ekisheva & Mark Borodovsky, 2011. "Uniform Accuracy of the Maximum Likelihood Estimates for Probabilistic Models of Biological Sequences," Methodology and Computing in Applied Probability, Springer, vol. 13(1), pages 105-120, March.
    7. Mattingly, J. C. & Stuart, A. M. & Higham, D. J., 2002. "Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise," Stochastic Processes and their Applications, Elsevier, vol. 101(2), pages 185-232, October.
    8. Roberts, Gareth O. & Rosenthal, Jeffrey S., 2002. "One-shot coupling for certain stochastic recursive sequences," Stochastic Processes and their Applications, Elsevier, vol. 99(2), pages 195-208, June.
    9. Gareth O. Roberts & Jeffrey S. Rosenthal, 2019. "Hitting Time and Convergence Rate Bounds for Symmetric Langevin Diffusions," Methodology and Computing in Applied Probability, Springer, vol. 21(3), pages 921-929, September.
    10. Quan Zhou & Jun Yang & Dootika Vats & Gareth O. Roberts & Jeffrey S. Rosenthal, 2022. "Dimension‐free mixing for high‐dimensional Bayesian variable selection," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(5), pages 1751-1784, November.
    11. Athreya, Krishna B. & Roy, Vivekananda, 2014. "When is a Markov chain regenerative?," Statistics & Probability Letters, Elsevier, vol. 84(C), pages 22-26.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:85:y:2000:i:2:p:341-361. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.