Title: Understanding the Metropolis-Hastings Algorithm
Abstract: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 t...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. Key Words: Gibbs samplingMarkov chain Monte CarloMultivariate density simulationReversible Markov chainsRead More
Publication Year: 1995
Publication Date: 1995-11-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 3536
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot