Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 19 October 2019

Abstract and Keywords

The purpose of this article is to provide an overview of Monte Carlo methods for generating variates from a target probability distribution that are based on Markov chains. These methods, called Markov chain Monte Carlo (MCMC) methods, are widely used to summarize complicated posterior distributions in Bayesian statistics and econometrics. This article begins with an intuitive explanation of the ideas and concepts that underlie popular algorithms such as the Metropolis-Hastings algorithm and multi-block algorithm. It provides the concept of a source or proposal density, which is used to supply a randomization step or an acceptance condition to determine if the candidate draw should be accepted. It is important to assess the performance of the sampling algorithm to determine the rate of mixing. Finally, this article offers an extensive discussion of marginal likelihood calculation using posterior simulator output.

Keywords: Monte Carlo methods, Markov chains, Metropolis-Hastings algorithm, multi-block algorithm, randomization step

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.