This paper surveys various results about Markov chains on gen- eral (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, sucient conditions for geomet- ric 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 con- ditions. Necessary and sucient conditions for Central Limit Theorems (CLTs) are also presented, in some cases proved via the Poisson Equa- tion 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.
General state space Markov chains and MCMC algorithms
Published 2004 in Probability Surveys
ABSTRACT
PUBLICATION RECORD
- Publication year
2004
- Venue
Probability Surveys
- Publication date
2004-04-02
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-83 of 83 references · Page 1 of 1