Abstract
The two previous chapters have presented the theoretical foundations of MCMC algorithms and showed that under fairly general conditions, the chains produced by these algorithms are ergodic, or even geometrically ergodic. While such developments are obviously necessary, they are nonetheless insufficient from the point of view of the implementation of MCMC methods. They do not directly result in methods of controlling the chain produced by an algorithm (in the sense of a stopping rule to guarantee that the number of iterations is sufficient). In other words, general convergence results do not tell us when to stop the MCMC algorithm and produce our estimates.
“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
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Robert, C.P., Casella, G. (1999). Diagnosing Convergence. In: Monte Carlo Statistical Methods. Springer Texts in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3071-5_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3071-5_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-3073-9
Online ISBN: 978-1-4757-3071-5
eBook Packages: Springer Book Archive