Explaining the Gibbs Sampler
George Casella, Edward I. George · The American Statistician · 1992
Computer-intensive algorithms, such as the Gibbs sampler, have become increasingly popular statistical tools, both in applied and theoretical work. The properties of such algorithms, however, may sometimes not be obvious. Here we give a simple explanation of how and why the Gibbs sampler works. We analytically establish its properties in a simple case and provide insight for more complicated cases. There are also a number of examples.
Cited by 2,364 works. doi:10.1080/00031305.1992.10475878
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Equation of State Calculations by Fast Computing Machines
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- The Jackknife, the Bootstrap and Other Resampling Plans
- Monte Carlo sampling methods using Markov chains and their applications
- Maximum likelihood estimation from incomplete data via the EM algorithm
- Spatial Interaction and the Statistical Analysis of Lattice Systems
- Sampling-Based Approaches to Calculating Marginal Densities
- The Calculation of Posterior Distributions by Data Augmentation
- Markov Chains for Exploring Posterior Distributions