The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Honest Exploration of Intractable Probability Distributions via Markov Chain Monte Carlo
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 address (Q1) and (Q2) formally comes from establishing a drift condition and an associated minorization condition, which together imply that the underlying Markov chain is geometrically ergodic. In this article, 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 normal distribution. Hence, an asymptotic standard error can be calculated, which provides an answer to (Q2) in the sense that an appropriate time to stop sampling can be determined. The methods are illustrated using a Gibbs sampler for a Bayesian version of the one-way random effects model and a data set concerning styrene exposure.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Sampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606
Monte Carlo Statistical Methods
Kim, H. (2000) · Technometrics · doi:10.1080/00401706.2000.10485722 · Cited by 5,508
Markov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041
Understanding the Metropolis-Hastings Algorithm
Chib, S., & Greenberg, E. (1995) · The American Statistician · doi:10.1080/00031305.1995.10476177 · Cited by 4,145
The Calculation of Posterior Distributions by Data Augmentation
Tanner, M. A., & Wong, W. H. (1987) · Journal of the American Statistical Association · doi:10.1080/01621459.1987.10478458 · Cited by 3,928
Markov Chains for Exploring Posterior Distributions
Tierney, L. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325750 · Cited by 3,452
Monte Carlo Statistical Methods
Robert, C. P., & Casella, G. (1999) · Springer Texts in Statistics · doi:10.1007/978-1-4757-3071-5 · Cited by 2,278
Ripley, B. D. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316726 · Cited by 2,241
Practical markov chain monte carlo
Geyer, C. J. (1992) · Statistical Science · doi:10.1214/ss/1177011137 · Cited by 2,045
Searle, S. R., Casella, G., & McCulloch, C. E. (1992) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316856 · Cited by 1,926
Sampling-Based Approaches to Calculating Marginal Densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.2307/2289776 · Cited by 1,504
Bratley, P., Fox, B. L., & Schrage, L. E. (1987) · Springer eBooks · doi:10.1007/978-1-4419-8724-2 · Cited by 1,468
Lectures on the Coupling Method
Lindvall, T. (1992) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,096
van Dyk, D. A., & Meng, X.-L. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/10618600152418584 · Cited by 1,052
Illustration of Bayesian Inference in Normal Data Models Using Gibbs Sampling
Gelfand, A. E., Hills, S. E., Racine-Poon, A., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10474968 · Cited by 969
Bayesian Computation and Stochastic Systems
Besag, J., Green, P., Higdon, D., & Mengersen, K. (1995) · Statistical Science · doi:10.1214/ss/1177010123 · Cited by 944
Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
Geyer, C. J., & Thompson, E. A. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476590 · Cited by 910
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Maximum Likelihood Algorithms for Generalized Linear Mixed Models
McCulloch, C. E. (1997) · Journal of the American Statistical Association · doi:10.1080/01621459.1997.10473613 · Cited by 761
General Irreducible Markov Chains and Non-Negative Operators
Nummelin, E. (1984) · Cambridge University Press eBooks · doi:10.1017/cbo9780511526237 · Cited by 639
Algebraic algorithms for sampling from conditional distributions
Diaconis, P., & Sturmfels, B. (1998) · The Annals of Statistics · doi:10.1214/aos/1030563990 · Cited by 616
General Irreducible Markov Chains and Non-Negative Operators.
Rao, M. B., & Nummelin, E. (1985) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981963 · Cited by 599
Rates of convergence of the Hastings and Metropolis algorithms
Mengersen, K. L., & Tweedie, R. L. (1996) · The Annals of Statistics · doi:10.1214/aos/1033066201 · Cited by 553
LIU, J. S., WONG, W. H., & KONG, A. (1994) · Biometrika · doi:10.1093/biomet/81.1.27 · Cited by 542
Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
Rosenthal, J. S. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476548 · Cited by 487
Schruben, L. W., Bratley, P., Fox, B. L., & Schrage, L. E. (1985) · Journal of the American Statistical Association · doi:10.2307/2287950 · Cited by 426
Roberts, G. (1996) · Biometrika · doi:10.1093/biomet/83.1.95 · Cited by 417
A new approach to the limit theory of recurrent Markov chains
Athreya, K. B., & Ney, P. (1978) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1978-0511425-0 · Cited by 412
Updating Schemes, Correlation Structure, Blocking and Parameterization for the Gibbs Sampler
Roberts, G. O., & Sahu, S. K. (1997) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00070 · Cited by 409
Batch Size Effects in the Analysis of Simulation Output
Schmeiser, B. (1982) · Operations Research · doi:10.1287/opre.30.3.556 · Cited by 365
A note on Metropolis-Hastings kernels for general state spaces
Tierney, L. (1998) · The Annals of Applied Probability · doi:10.1214/aoap/1027961031 · Cited by 338
Adaptive Markov Chain Monte Carlo through Regeneration
Gilks, W. R., Roberts, G. O., & Sahu, S. K. (1998) · Journal of the American Statistical Association · doi:10.1080/01621459.1998.10473766 · Cited by 297
Implementations of the Monte Carlo EM Algorithm
Levine, R. A., & Casella, G. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/106186001317115045 · Cited by 235
Simulation Output Analysis Using Standardized Time Series
Glynn, P. W., & Iglehart, D. L. (1990) · Mathematics of Operations Research · doi:10.1287/moor.15.1.1 · Cited by 228
Regeneration in Markov Chain Samplers
Mykland, P., Tierney, L., & Yu, B. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476507 · Cited by 224
Geometric ergodicity of Metropolis algorithms
Jarner, S. F., & Hansen, E. (2000) · Stochastic Processes and their Applications · doi:10.1016/s0304-4149(99)00082-4 · Cited by 218
Markov‐chain monte carlo: Some practical implications of theoretical results
Roberts, G. O., & Rosenthal, J. S. (1998) · Canadian Journal of Statistics · doi:10.2307/3315667 · Cited by 151
Convergence of Slice Sampler Markov Chains
Roberts, G. O., & Rosenthal, J. S. (1999) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/1467-9868.00198 · Cited by 132
Convergence Control Methods for Markov Chain Monte Carlo Algorithms
Robert, C. P. (1995) · Statistical Science · doi:10.1214/ss/1177009937 · Cited by 113
Frigessi, A., Stefano, P., Hwang, C.-R., & Sheu, S. (1993) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.2517-6161.1993.tb01479.x · Cited by 97
Gibbs Sampling with Diffuse Proper Priors: A Valid Approach to Data-Driven Inference?
Natarajan, R., & McCulloch, C. E. (1998) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1998.10474776 · Cited by 89
A Geometric Interpretation of the Metropolis-Hastings Algorithm
Billera, L. J., & Diaconis, P. W. (2001) · Statistical Science · doi:10.1214/ss/1015346318 · Cited by 69
Geometric Ergodicity of Gibbs and Block Gibbs Samplers for a Hierarchical Random Effects Model
Hobert, J. P., & Geyer, C. J. (1998) · Journal of Multivariate Analysis · doi:10.1006/jmva.1998.1778 · Cited by 66
Self-citationAnalysis of the Gibbs sampler for a model related to James-Stein estimators
Rosenthal, J. S. (1996) · Statistics and Computing · doi:10.1007/bf00140871 · Cited by 66
A simulation approach to convergence rates for Markov chain Monte Carlo algorithms
Cowles, M. K., & Rosenthal, J. S. (1998) · Statistics and Computing · doi:10.1023/a:1008982016666 · Cited by 46
[Practical Markov Chain Monte Carlo]: Rejoinder
Geyer, C. J. (1992) · Statistical Science · doi:10.1214/ss/1177011147 · Cited by 44
On the Rate of Convergence of the Metropolis Algorithm and Gibbs Sampler by Geometric Bounds
Ingrassia, S. (1994) · The Annals of Applied Probability · doi:10.1214/aoap/1177005064 · Cited by 43
Discretization of Continuous Markov Chains and Markov Chain Monte Carlo Convergence Assessment
Guihenneuc‐Jouyaux, C., & Robert, C. P. (1998) · Journal of the American Statistical Association · doi:10.1080/01621459.1998.10473767 · Cited by 24
A note on acceptance rate criteria for CLTS for Metropolis–Hastings algorithms
Roberts, G. O. (1999) · Journal of Applied Probability · doi:10.1239/jap/1032374766 · Cited by 23
On convergence rates of Gibbs samplers for uniform distributions
Roberts, G. O., & Rosenthal, J. S. (1998) · The Annals of Applied Probability · doi:10.1214/aoap/1028903381 · Cited by 21
A review of asymptotic convergence for general state space Markov chains
Rosenthal, S. (2002) · Cited by 21
Applications of geometric bounds to the convergence rate of Markov chains on Rn
Yuen, W. K. (2000) · Stochastic Processes and their Applications · doi:10.1016/s0304-4149(99)00101-5 · Cited by 16
Corrigendum to “Bounds on regeneration times and convergence rates for Markov chains”
Roberts, G. O., & Tweedie, R. L. (2001) · Stochastic Processes and their Applications · doi:10.1016/s0304-4149(00)00074-0 · Cited by 13
Cited by
General state space Markov chains and MCMC algorithms
Roberts, G. O., & Rosenthal, J. S. (2004) · Probability Surveys · doi:10.1214/154957804100000024 · Cited by 734
Fixed-Width Output Analysis for Markov Chain Monte Carlo
Jones, G. L., Haran, M., Caffo, B. S., & Neath, R. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000492 · Cited by 301
Self-citationConvergence Diagnostics for Markov Chain Monte Carlo
Roy, V. (2020) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-031219-041300 · Cited by 298
A General Framework for the Parametrization of Hierarchical Models
Papaspiliopoulos, O., Roberts, G. O., & Sköld, M. (2007) · Statistical Science · doi:10.1214/088342307000000014 · Cited by 298
The Markov chain Monte Carlo revolution
Diaconis, P. (2008) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-08-01238-x · Cited by 295
Metadata
- Authors
- Hobert, J. P., & Jones, G. L.
- Venue
- Statistical Science
- Publisher
- Institute of Mathematical Statistics
- Published
- 2001-11-01
- Volume
- 16
- Issue
- 4
- Pages
- 312-334
- ISSN
- 0883-4237 (ISSN-L)
- OpenAlex
- W2001074797
- Cited by
- 258
- References
- 54
- FWCI
- 7.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.