Studying Convergence of Markov Chain Monte Carlo Algorithms Using Coupled Sample Paths
Journal of the American Statistical AssociationPublished 1 March 1996
Valen E. Johnson
Citations83
SJR quartileQ1
SJR score4.10
SNIP3.08
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Abstract I describe a simple procedure for investigating the convergence properties of Markov chain Monte Carlo sampling schemes. The procedure uses coupled chains from the same sampler, obtained by using the same sequence of random deviates for each run. By examining the distribution of the iteration at which all sample paths couple, convergence properties for the system can be established. The procedure also provides a simple diagnostic for detecting modes in multimodal posteriors. Several examples of the procedure are provided. In Ising models, the relation between the correlation parameter and the convergence rate of rudimentary Gibbs samplers is investigated. In another example, the effects of multiple modes on the convergence of coupled paths are explored using mixtures of bivariate normal distributions. The technique is also used to evaluate the convergence properties of a Gibbs sampling scheme applied to a model for rat growth rates.
Keywords
Mathematics
Choice Reviews OnlineNumerical recipes in C: the art of scientific computing
17,989 Citations1993Press, William H, Flannery, Brian P +2 more
IEEE Transactions on Pattern Analysis and Machine IntelligenceStochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
17,980 Citations1984Stuart Geman, Donald Geman
The analogy between images and statistical mechanics systems is made and the analogous operation under the posterior distribution yields the maximum a posteriori (MAP) estimate of the image given the degraded observations, creating a highly parallel ``relaxation'' algorithm for MAP estimation.
Statistical ScienceInference from Iterative Simulation Using Multiple Sequences
16,747 Citations1992Andrew Gelman, Donald B. Rubin
The focus is on applied inference for Bayesian posterior distributions in real problems, which often tend toward normal- ity after transformations and marginalization, and the results are derived as normal-theory approximations to exact Bayesian inference, conditional on the observed simulations.
BiometrikaMonte Carlo sampling methods using Markov chains and their applications
15,200 Citations1970W. Keith Hastings
Numerical Recipes in FORTRAN
7,671 Citations1988William T. Vetterling, Saul A. Teukolsky +2 more
Journal of the American Statistical AssociationSampling-Based Approaches to Calculating Marginal Densities
6,616 Citations1990Alan E. Gelfand, A. F. M. Smith
Stochastic substitution, the Gibbs sampler, and the sampling-importance-resampling algorithm can be viewed as three alternative sampling- (or Monte Carlo-) based approaches to the calculation of numerical estimates of marginal probability distributions.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Spatial Interaction and the Statistical Analysis of Lattice Systems
6,179 Citations1974Julian Besag
Annals of the Institute of Statistical MathematicsBayesian image restoration, with two applications in spatial statistics
4,274 Citations1991Julian Besag, Jeremy York +1 more
The present paper argues that many problems in the analysis of spatial data can be interpreted as problems of image restoration, since the amounts of data involved allow routine use of computer intensive methods, such as the Gibbs sampler, that are not yet practicable for conventional images.
Journal of the Royal Statistical Society Series B (Statistical Methodology)On the Statistical Analysis of Dirty Pictures
4,228 Citations1986Julian Besag
A simple, iterative method of reconstruction is proposed, which does not depend on these large-scale characteristics of the random field, and is illustrated by computer simulations in which the original scene is not directly related to the assumed random field.
Journal of the American Statistical AssociationThe Calculation of Posterior Distributions by Data Augmentation
3,782 Citations1987Martin A. Tanner, Wing Hung Wong
If data augmentation can be used in the calculation of the maximum likelihood estimate, then in the same cases one ought to be able to use it in the computation of the posterior distribution of parameters of interest.
The Annals of StatisticsMarkov Chains for Exploring Posterior Distributions
3,472 Citations1994Luke Tierney
This paper outlines some of the basic methods and strategies of Markov chain methods and discusses some related theoretical and practical issues.
Statistical SciencePractical Markov Chain Monte Carlo
2,028 Citations1992Charles J. Geyer
The case is made 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.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Bayesian Computation Via the Gibbs Sampler and Related Markov Chain Monte Carlo Methods
1,727 Citations1993A. F. M. Smith, Gareth O. Roberts
The use of the Gibbs sampler for Bayesian computation and other Markov chain Monte Carlo simulation methods are reviewed and illustrated in the context of some canonical examples.
CERN Document Server (European Organization for Nuclear Research)Lectures on the Coupling Method
1,168 Citations1992Torgny Lindvall
Journal of the American Statistical AssociationIllustration of Bayesian Inference in Normal Data Models Using Gibbs Sampling
966 Citations1990Alan E. Gelfand, Susan E. Hills +2 more
The use of the Gibbs sampler as a method for calculating Bayesian marginal posterior and predictive densities is reviewed and illustrated with a range of normal data models, including variance components, unordered and ordered means, hierarchical growth curves, and missing data in a crossover trial.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Constrained Monte Carlo Maximum Likelihood for Dependent Data
898 Citations1992Charles J. Geyer, E. A. Thompson
Journal of the Royal Statistical Society Series B (Statistical Methodology)Spatial Statistics and Bayesian Computation
547 Citations1993Julian Besag, Peter J. Green
The early development of MCMC in Bayesian inference is traced, some recent computational progress in statistical physics is reviewed, based on the introduction of auxiliary variables, and its current and future relevance in Bayesesian applications are discussed.
Journal of the American Statistical AssociationMinorization Conditions and Convergence Rates for Markov Chain Monte Carlo
463 Citations1995Jeffrey S. Rosenthal
Journal of the American Statistical AssociationFacilitating the Gibbs Sampler: The Gibbs Stopper and the Griddy-Gibbs Sampler
426 Citations1992Christian Ritter, Martin A. Tanner
An importance sampling device is proposed for converting the output of the Gibbs Sampler to a sample from the exact posterior, and an approach for implementing the Gibbs sampler in nonconjugate situations is presented.
A Single Series from the Gibbs Sampler Provides a False Sense of Security
202 Citations1992Andrew Gelman, Donald B. Rubin
Journal of Applied StatisticsTowards Bayesian image analysis
157 Citations1993Julian Besag
It is argued that the Bayesian approach to image analysis, still in its infancy, has considerable potential for future development.
Journal of the American Statistical AssociationA Numerical Procedure to Generate a Sample Covariance Matrix
154 Citations1966Patrick L. Odell, Alan H. Feiveson
Mathematics of Operations ResearchGeometric Convergence Rates for Stochastically Ordered Markov Chains
108 Citations1996Robert Lund, Richard L. Tweedie
A dependent sample path coupling and a Foster-Lyapunov drift inequality are used to derive convergence rate bounds and it is shown that the bounds obtained are frequently the best possible.
Journal of the American Statistical AssociationMinorization Conditions and Convergence Rates for Markov Chain Monte Carlo
85 Citations1995Jeffrey S. Rosenthal
Journal of the Royal Statistical Society Series B (Statistical Methodology)Convergence Rates of the Gibbs Sampler, the Metropolis Algorithm and Other Single-Site Updating Dynamics
83 Citations1993Arnoldo Frigessi, P. Di Stefano +2 more
Journal of the American Statistical AssociationA Model for Segmentation and Analysis of Noisy Images
47 Citations1994Valen E. Johnson
A statistical model for image generation that provides automatic segmentation of images into intensity-differentiated regions and facilitates the quantitative assessment of uncertainty associated with identified image features is proposed.