Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms

Abstract

AbstractMarkov chain Monte Carlo (MCMC) simulation methods are being used increasingly in statistical computation to explore and estimate features of likelihood surfaces and Bayesian posterior distributions. This paper presents simple conditions which ensure the convergence of two widely used versions of MCMC, the Gibbs sampler and Metropolis-Hastings algorithms