# Understanding the Metropolis-Hastings Algorithm

**Siddhartha Chib****Edward Greenberg**

CiteWeb id: 20120000062

CiteWeb score: 3487

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.

Links:- astro.temple.edu/~msobel/courses_files/firstmetropolis.pdf
- www.jstor.org/stable/2684568
- www.yaroslavvb.com/papers/chib-understanding.pdf
- www.cise.ufl.edu/class/cap6617fa15/Readings/ChibGreenberg.pdf
- www.hedibert.org/wp-content/uploads/2013/12/1995ChibGreenberg.pdf
- radhakrishna.typepad.com/understanding-the-metropolis-hastings-algorithm.pdf
- faculty.uml.edu/jongsoo_lee/584/Metropolis-Hastings.pdf
- www.tandfonline.com/doi/abs/10.1080/00031305.1995.10476177
- dx.doi.org/10.1080/00031305.1995.10476177
- amstat.tandfonline.com/doi/abs/10.1080/00031305.1995.10476177
- www.umiacs.umd.edu/~pturaga/ENEE731/papers/MRFs/ChibGreenberg1995.pdf

## HTML code:

## Wiki code: