Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms
Markov chain Monte Carlo (MCMC) simulation methods are being used increasingly in statistical computation to explore and estimate features of likelihood surfaces and Bayesian posterior distributions. This paper presents simple conditions which ensure the convergence of two widely used versions of MCMC, the Gibbs sampler and Metropolis-Hastings algorithms.
Year of publication: |
1994
|
---|---|
Authors: | Roberts, G. O. ; Smith, A. F. M. |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 49.1994, 2, p. 207-216
|
Publisher: |
Elsevier |
Keywords: | Markov chain Monte Carlo Gibbs sampler Metropolis-Hastings algorithm statistical computation ergodicity lower semicontinuity |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Present position and potential developments : some personal views ; bayesian statistics
Smith, A. F. M., (1984)
-
A Bayesian analysis of some time-varying models
Smith, A. F. M., (1977)
-
The foundations of decision theory : an intuitive, operatioanl approach with mathematical extension
Bernardo, J. M., (1985)
- More ...