from Part I - Concepts from Modeling, Inference, and Computing
Published online by Cambridge University Press: 17 August 2023
In this chapter we present computational Monte Carlo methods to sample from probability distributions, including Bayesian posteriors, that do not permit direct sampling. In doing so, we introduce the basis for Monte Carlo and Markov chain Monte Carlo sampling schemes and delve into specific methods. These include, at first, samplers such as the Metropolis–Hastings algorithms and Gibbs samplers and discuss the interpretation of the output of these samplers including the concept of burn-in and sample correlation. We also discuss more advanced sampling schemes including auxiliary variable samplers, multiplicative random walk samplers, and Hamiltonian Monte Carlo.
To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.