Understanding the Metropolis-Hastings Algorithm
Siddhartha Chib, Edward Greenberg · The American Statistician · 1995
We provide a detailed, introductory exposition of the Metropolis-Hastings algorithm, a powerful Markov chain method to simulate multivariate distributions. A simple, intuitive derivation of this method is given along with guidance on implementation. Also discussed are two applications of the algorithm, one for implementing acceptance-rejection sampling when a blanketing function is not available and the other for implementing the algorithm with block-at-a-time scans. In the latter situation, many different algorithms, including the Gibbs sampler, are shown to be special cases of the Metropolis-Hastings algorithm. The methods are illustrated with examples.
Cited by 4,145 works. doi:10.1080/00031305.1995.10476177
Authors
References
- Equation of State Calculations by Fast Computing Machines
- Time Series Analysis: Forecasting and Control
- Monte Carlo sampling methods using Markov chains and their applications
- Time Series Analysis: Forecasting and Control
- Sampling-Based Approaches to Calculating Marginal Densities
- Probability and Measure.
- Explaining the Gibbs Sampler
- Inference from Iterative Simulation Using Multiple Sequences
- The Calculation of Posterior Distributions by Data Augmentation
- Markov Chains for Exploring Posterior Distributions