DMCA
Honest Exploration of Intractable Probability Distributions Via Markov Chain Monte Carlo (2001)
| Venue: | STATISTICAL SCIENCE |
| Citations: | 104 - 32 self |
BibTeX
@ARTICLE{Jones01honestexploration,
author = {Galin L. Jones and James P. Hobert},
title = {Honest Exploration of Intractable Probability Distributions Via Markov Chain Monte Carlo},
journal = {STATISTICAL SCIENCE},
year = {2001},
volume = {16},
pages = {312--334}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Two important questions that must be answered whenever a Markov chain Monte Carlo (MCMC) algorithm is used are (Q1) What is an appropriate burn-in? and (Q2) How long should the sampling continue after burn-in? Developing rigorous answers to these questions presently requires a detailed study of the convergence properties of the underlying Markov chain. Consequently, in most practical applications of MCMC, exact answers to (Q1) and (Q2) are not sought. The goal of this paper is to demystify the analysis that leads to honest answers to (Q1) and (Q2). The authors hope that this article will serve as a bridge between those developing Markov chain theory and practitioners using MCMC to solve practical problems. The ability to formally address (Q1) and (Q2) comes from establishing a drift condition and an associated minorization condition, which together imply that the underlying Markov chain is geometrically ergodic. In this paper, we explain exactly what drift and minorization are as well as how and why these conditions can be used to form rigorous answers to (Q1) and (Q2). The basic ideas are as follows. The results of Rosenthal (1995) and Roberts and Tweedie (1999) allow one to use drift and minorization conditions to construct a formula giving an analytic upper bound on the distance to stationarity. A rigorous answer to (Q1) can be calculated using this formula. The desired characteristics of the target distribution are typically estimated using ergodic averages. Geometric ergodicity of the underlying Markov chain implies that there are central limit theorems available for ergodic averages (Chan and Geyer 1994). The regenerative simulation technique (Mykland, Tierney and Yu 1995, Robert 1995) can be used to get a consistent estimate of the variance of the asymptotic nor...
Keyphrases
honest exploration rigorous answer underlying markov chain ergodic average analytic upper bound target distribution regenerative simulation technique exact answer associated minorization condition sampling continue markov chain monte carlo geometric ergodicity practical problem convergence property important question practical application underlying markov chain implies detailed study minorization condition basic idea drift condition markov chain theory consistent estimate central limit desired characteristic appropriate burn-in
