Computation of expectations by Markov chain Monte Carlo methods
Preprint
Abstract
Markov chain Monte Carlo (MCMC) methods are a very versatile and widely used tool to compute integrals and expectations. In this short survey we focus on error bounds, rules for choosing the burn in, high dimensional problems and tractability versus curse of dimension.Keywords
All Related Versions
- Version 1, 2013-11-08, ArXiv
- Version 2, 2014-09-08, ArXiv
- Published version: , 397.
This publication has 13 references indexed in Scilit:
- Positivity of hit-and-run and related algorithmsElectronic Communications in Probability, 2013
- Consistency of Markov chain quasi-Monte Carlo on continuous state spacesThe Annals of Statistics, 2011
- Curvature, concentration and error estimates for Markov chain Monte CarloThe Annals of Probability, 2010
- On the computational complexity of MCMC-based estimators in large samplesThe Annals of Statistics, 2009
- Simple Monte Carlo and the Metropolis algorithmJournal of Complexity, 2007
- General state space Markov chains and MCMC algorithmsProbability Surveys, 2004
- Geometric L 2 and L 1 convergence are equivalent for reversible Markov chainsJournal of Applied Probability, 2001
- Geometric Ergodicity and Hybrid Markov ChainsElectronic Communications in Probability, 1997
- Rates of convergence of the Hastings and Metropolis algorithmsThe Annals of Statistics, 1996
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded RegionsOperations Research, 1984