Sufficient burn-in for Gibbs samplers for a hierarchical random effects model

Abstract

We consider Gibbs and block Gibbs samplers for a Bayesian hierarchical version of the one-way random effects model. Drift and minorization conditions are established for the underlying Markov chains. The drift and minorization are used in conjunction with results from J. S. Rosenthal [J. Amer. Statist. Assoc. 90 (1995) 558-566] and G. O. Roberts and R. L. Tweedie [Stochastic Process. Appl. 80 (1999) 211-229] to construct analytical upper bounds on the distance to stationarity. These lead to upper bounds on the amount of burn-in that is required to get the chain within a prespecified (total variation) distance of the stationary distribution. The results are illustrated with a numerical example.

Cited by in corpus (16)

• General state space Markov chains and MCMC algorithms
• Markov Chain Monte Carlo: Can We Trust the Third Significant Figure?
• Batch means and spectral variance estimators in Markov chain Monte Carlo
• Component-Wise Markov Chain Monte Carlo: Uniform and Geometric Ergodicity under Mixing and Composition
• Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm
• Markov Chain Monte Carlo Estimation of Quantiles
• Variance bounding Markov chains
• A mixture representation of πwith applications in Markov chain Monte Carlo and perfect sampling
• Nonasymptotic bounds on the estimation error of MCMC algorithms
• Exact sampling for intractable probability distributions via a Bernoulli factory
• Rigorous confidence bounds for MCMC under a geometric drift condition
• Convergence rate of Markov chain methods for genomic motif discovery
• Comment: Gibbs Sampling, Exponential Families, and Orthogonal Polynomials
• Numerical simulation of polynomial-speed convergence phenomenon
• Gibbs Sampling, Exponential Families and Orthogonal Polynomials
• Estimating MCMC convergence rates using common random number simulation