Open Access
November, 1992 Practical Markov Chain Monte Carlo
Charles J. Geyer
Statist. Sci. 7(4): 473-483 (November, 1992). DOI: 10.1214/ss/1177011137


Markov chain Monte Carlo using the Metropolis-Hastings algorithm is a general method for the simulation of stochastic processes having probability densities known up to a constant of proportionality. Despite recent advances in its theory, the practice has remained controversial. This article makes the case for basing all inference on one long run of the Markov chain and estimating the Monte Carlo error by standard nonparametric methods well-known in the time-series and operations research literature. In passing it touches on the Kipnis-Varadhan central limit theorem for reversible Markov chains, on some new variance estimators, on judging the relative efficiency of competing Monte Carlo schemes, on methods for constructing more rapidly mixing Markov chains and on diagnostics for Markov chain Monte Carlo.


Download Citation

Charles J. Geyer. "Practical Markov Chain Monte Carlo." Statist. Sci. 7 (4) 473 - 483, November, 1992.


Published: November, 1992
First available in Project Euclid: 19 April 2007

Digital Object Identifier: 10.1214/ss/1177011137

Keywords: central limit theorem , Gibbs sampler , Markov chain , Metropolis-Hastings algorithm , Monte Carlo , variance estimation

Rights: Copyright © 1992 Institute of Mathematical Statistics

Vol.7 • No. 4 • November, 1992
Back to Top