General state space Markov chains and MCMC algorithms
Probability Surveys · 01.01.2004 · 1 (none) · 20-71
DOI: 10.1214/154957804100000024 ↗Kurz gefasst
Fachartikel in der Zeitschrift Probability Surveys, erschienen am 01.01.2004. Verfasst von Gareth O. Roberts und 1 weiteren Autor:innen. Die Arbeit wurde bisher 503-mal zitiert (Crossref) und nennt 94 Literaturangaben.
Abstract (Originalsprache)
This paper surveys various results about Markov chains on general (non-countable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the motivation and context for the theory which follows. Then, sufficient conditions for geometric and uniform ergodicity are presented, along with quantitative bounds on the rate of convergence to stationarity. Many of these results are proved using direct coupling constructions based on minorisation and drift conditions. Necessary and sufficient conditions for Central Limit Theorems (CLTs) are also presented, in some cases proved via the Poisson Equation or direct regeneration constructions. Finally, optimal scaling and weak convergence results for Metropolis-Hastings algorithms are discussed. None of the results presented is new, though many of the proofs are. We also describe some Open Problems.
Zitieren
APA
Roberts, G. O., & Rosenthal, J. S. (2004). General state space Markov chains and MCMC algorithms. Probability Surveys, 1(none), 20-71. https://doi.org/10.1214/154957804100000024
Vancouver
Roberts GO, Rosenthal JS. General state space Markov chains and MCMC algorithms. Probability Surveys. 2004;1(none):20-71. doi:10.1214/154957804100000024
BibTeX
@article{Roberts2004,
author = {Roberts, Gareth O. and Rosenthal, Jeffrey S.},
title = {General state space Markov chains and MCMC algorithms},
journal = {Probability Surveys},
year = {2004},
volume = {1},
number = {none},
pages = {20--71},
doi = {10.1214/154957804100000024}
}
EUVIMED