Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains

From MaRDI portal
Publication:997421

DOI10.1214/105051606000000510zbMATH Open1121.60076arXivmath/0702412OpenAlexW1988251813MaRDI QIDQ997421FDOQ997421


Authors: Gareth O. Roberts, Jeffrey S. Rosenthal Edit this on Wikidata


Publication date: 6 August 2007

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: A phi-irreducible and aperiodic Markov chain with stationary probability distribution will converge to its stationary distribution from almost all starting points. The property of Harris recurrence allows us to replace ``almost all by ``all, which is potentially important when running Markov chain Monte Carlo algorithms. Full-dimensional Metropolis--Hastings algorithms are known to be Harris recurrent. In this paper, we consider conditions under which Metropolis-within-Gibbs and trans-dimensional Markov chains are or are not Harris recurrent. We present a simple but natural two-dimensional counter-example showing how Harris recurrence can fail, and also a variety of positive results which guarantee Harris recurrence. We also present some open problems. We close with a discussion of the practical implications for MCMC algorithms.


Full work available at URL: https://arxiv.org/abs/math/0702412




Recommendations




Cites Work


Cited In (19)





This page was built for publication: Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997421)