In Chapter 5, we introduced the use of simulation in Bayesian inference. Rejection sampling is a general method for simulating from an arbitrary posterior distribution, but it can be difficult to set up since it requires the construction of a suitable proposal density. Importance sampling and SIR algorithms are also general-purpose algorithms, but they also require proposal densities that may be difficult to find for high-dimensional problems. In this chapter, we illustrate the use of Markov chain Monte Carlo (MCMC) algorithms in summarizing posterior distributions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag New York
About this chapter
Cite this chapter
Albert, J. (2009). Markov Chain Monte Carlo Methods. In: Bayesian Computation with R. Springer, New York, NY. https://doi.org/10.1007/978-0-387-92298-0_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-92298-0_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-92297-3
Online ISBN: 978-0-387-92298-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)