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

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.

[1]  J. Doob.  Stochastic processes , 1953 .

[2]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[3]  T. E. Harris.  The Existence of Stationary Measures for Certain Markov Processes , 1956 .

[4]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[5]  C. Preston.  Spatial birth and death processes , 1975, Advances in Applied Probability.

[6]  E. Nummelin.  General irreducible Markov chains and non-negative operators: Notes and comments , 1984 .

[7]  Adrian F. M. Smith,et al.  Sampling-Based Approaches to Calculating Marginal Densities , 1990 .

[8]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[9]  J. Rosenthal.  Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo , 1995 .

[10]  L. Tierney.  Markov Chains for Exploring Posterior Distributions , 1994 .

[11]  L. Tierney.  Rejoinder: Markov Chains for Exploring Posterior Distributions , 1994 .

[12]  Jeffrey S. Rosenthal,et al.  Convergence Rates for Markov Chains , 1995, SIAM Rev..

[13]  P. Green.  Reversible jump Markov chain Monte Carlo computation and Bayesian model determination , 1995 .

[14]  L. Tierney.  A note on Metropolis-Hastings kernels for general state spaces , 1998 .

[15]  Gareth O. Roberts,et al.  Convergence Properties of Perturbed Markov Chains , 1998, Journal of Applied Probability.

[16]  R. Tweedie,et al.  Bounds on regeneration times and convergence rates for Markov chains fn1 fn1 Work supported in part , 1999 .

[17]  J. Rosenthal.  A First Look at Rigorous Probability Theory , 2000 .

[18]  Galin L. Jones,et al.  Honest Exploration of Intractable Probability Distributions via Markov Chain Monte Carlo , 2001 .

[19]  S. Rosenthal,et al.  A review of asymptotic convergence for general state space Markov chains , 2002 .

[20]  J. Rosenthal.  QUANTITATIVE CONVERGENCE RATES OF MARKOV CHAINS: A SIMPLE ACCOUNT , 2002 .

[21]  J. Forster.  Efficient construction of reversible jump Markov chain Monte Carlo proposal distributions - Discussion , 2003 .

[22]  G. Roberts,et al.  Efficient construction of reversible jump Markov chain Monte Carlo proposal distributions , 2003 .

[23]  J. Rosenthal,et al.  General state space Markov chains and MCMC algorithms , 2004, math/0404033.