vix.ing · top · new · best · stats

Understanding the Metropolis-Hastings Algorithm

1995/11/01 by Siddhartha Chib, Edward Greenberg · 3,730 citations
Computer Science · Mathematics · #Algorithm #Artificial intelligence #Bayesian Methods and Mixture Models #Bayesian probability #Computer science #Gibbs sampling #Hybrid Monte Carlo #Machine learning #Markov Chains and Monte Carlo Methods #Markov chain #Markov chain Monte Carlo #Mathematics #Metropolis–Hastings algorithm #Rejection sampling #Sampling (signal processing) #Statistical Methods and Bayesian Inference

paper · doi:10.1080/00031305.1995.10476177

published in The American Statistician 49(4), 327-335 (Taylor & Francis)

openalex publication_date 1995/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31

Abstract

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

Related