Markov chain Monte Carlo methods: computation and inference
In: Handbook of Econometrics
This chapter reviews the recent developments in Markov chain Monte Carlo simulation methods. These methods, which are concerned with the simulation of high dimensional probability distributions, have gained enormous prominence and revolutionized Bayesian statistics. The chapter provides background on the relevant Markov chain theory and provides detailed information on the theory and practice of Markov chain sampling based on the Metropolis-Hastings and Gibbs sampling algorithms. Convergence diagnostics and strategies for implementation are also discussed. A number of examples drawn from Bayesian statistics are used to illustrate the ideas. The chapter also covers in detail the application of MCMC methods to the problems of prediction and model choice.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
|This chapter was published in: ||This item is provided by Elsevier in its series Handbook of Econometrics with number
5-57.||Handle:|| RePEc:eee:ecochp:5-57||Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/bookseriesdescription.cws_home/BS_HE/description|
When requesting a correction, please mention this item's handle: RePEc:eee:ecochp:5-57. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If references are entirely missing, you can add them using this form.