ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Statistics & Probability Letters
Volume 49, Issue 4, 1 October 2000, Pages 401-410
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (121 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0167-7152(00)00074-2    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2000 Elsevier Science B.V. All rights reserved.

V-Subgeometric ergodicity for a Hastings–Metropolis algorithm

Gersende FortCorresponding Author Contact Information, E-mail The Corresponding Author and Eric MoulinesE-mail The Corresponding Author

Ecole Nationale Supérieure des Télécommunications, Dpt TSI, CNRS URA 820, 46, rue Barrault, 75634 Paris Cedex 13, France

Received 1 July 1999;
revised 1 December 1999.
Available online 22 August 2000.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

We study the symmetric random-walk Hastings–Metropolis algorithm in situations where the density is not log-concave in the tails. We show that, under mild technical conditions this algorithm is V-ergodic at a subgeometrical rate.

Author Keywords: Hastings–Metropolis algorithm; V-ergodicity; Drift conditions; Subgeometrical rates

Article Outline

1. Introduction
2. V-subgeometric criteria
3. The Metropolis algorithm
3.1. Concluding remark
Appendix A. Proof of Proposition 2
Appendix B. Proofs of the Section 3
B.1. Proof of Proposition 3
B.2. Proof of Theorem 5
References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.