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

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published at http://dx.doi.org/10.1214/105051606000000510 in the Annals of Applied Probability (http://www.imstat.org/aap/) by

Scientific paper

10.1214/105051606000000510

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-209952

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.