You are not currently logged in.
Access JSTOR through your library or other institution:
Understanding the Metropolis-Hastings Algorithm
Siddhartha Chib and Edward Greenberg
The American Statistician
Vol. 49, No. 4 (Nov., 1995), pp. 327-335
Stable URL: http://www.jstor.org/stable/2684568
Page Count: 9
You can always find the topics here!Topics: Simulations, Metropolitan areas, Markov chains, Random walk, Tanneries, Gaussian distributions, Correlations, Statistics, Economic statistics, Acceptance sampling
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
The American Statistician © 1995 American Statistical Association