Abstract
The goal of this chapter is to present different monitoring methods (or diagnostics) proposed to check (for) the convergence of an MCMC algorithm when considering its output and to answer the most commonly asked question about MCMC, namely “when do we stop our MCMC algorithm?” We distinguish here between two separate notions of convergence, namely convergence to stationarity and convergence of ergodic average, in contrast with iid settings. We also discuss several types of convergence diagnostics, primarily those contained in the coda package of Plummer et al. (2006), even though more accurate methods may be available in specific settings.
“Why does he insist that we must have a diagnosis? Some things are not meant to be known by man.”
Susanna Gregory
An Unholy Alliance
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
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Robert, C.P., Casella, G. (2010). Convergence Monitoring and Adaptation for MCMC Algorithms. In: Introducing Monte Carlo Methods with R. Use R. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-1576-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1576-4_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-1575-7
Online ISBN: 978-1-4419-1576-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)