Jump to ContentJump to Main Navigation
Bayesian Theory and Applications$
Users without a subscription are not able to see the full content.

Paul Damien, Petros Dellaportas, Nicholas G. Polson, and David A. Stephens

Print publication date: 2013

Print ISBN-13: 9780199695607

Published to Oxford Scholarship Online: May 2013

DOI: 10.1093/acprof:oso/9780199695607.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 13 May 2021

Markov chain Monte Carlo methods

Markov chain Monte Carlo methods

(p.87) 6 Markov chain Monte Carlo methods
Bayesian Theory and Applications

Chib Siddhartha

Oxford University Press

This chapter provides a brief summary of Markov chain Monte Carlo (MCMC) methods. The chapter is organized as follows. Section 6.2 describes the Metropolis–Hastings algorithm and its generalized version. Section 6.3 considers the Gibbs sampling algorithm while additional topics of importance, such as sampling with latent data and calculation of the marginal likelihood, are discussed in Section 6.4. Section 6.5 has concluding remarks.

Keywords:   MCMC methods, Metropolis–Hastings algorithm, Gibbs sampling algorithm, latent data, marginal likelihood

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .