Understanding the Metropolis-Hastings Algorithm

by: Siddhartha Chib, Edward Greenberg

The American Statistician, Vol. 49, No. 4. (1995), pp. 327-335.

View FullText article

DOI, JSTOR

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

i-stevenson, ansobol, quianominorleo, jrw, FAB-lab (group), rvosa, Metaheuristics (group), nojhan, markusd, ldietz, pcarbo, icosma, adriandefroment, leonnovelo

Find related articles with these CiteULike tags

1995, algorithms, bayesian, code, computation, gibbs, machine-learning, markov, markov-chains, mcmc, methods, metropolis, metropolishastings, metropolis-hastings, model, monte-carlo, mva, pdf, probability, probability-density, review, sampling, simulated-annealing, simulation, statistics, tutorial

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.

@article{citeulike:831786, 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.}, author = {Chib, Siddhartha and Greenberg, Edward }, citeulike-article-id = {831786}, doi = {10.2307/2684568}, journal = {The American Statistician}, keywords = {algorithms, computation}, number = {4}, pages = {327--335}, posted-at = {2008-05-13 07:29:34}, priority = {2}, title = {Understanding the Metropolis-Hastings Algorithm}, url = {http://dx.doi.org/10.2307/2684568}, volume = {49}, year = {1995} }

RIS record

TY - JOUR ID - citeulike:831786 L3 - citeulike-article-id:831786 TI - Understanding the Metropolis-Hastings Algorithm JF - The American Statistician VL - 49 IS - 4 SP - 327 EP - 335 N2 - 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. KW - algorithms KW - computation AU - Chib, Siddhartha AU - Greenberg, Edward PY - 1995/// UR - http://dx.doi.org/10.2307/2684568 ER -

RIS BibTeX