Mathematics – Numerical Analysis
Scientific paper
2008-05-23
D. Rudolf, Explicit error bounds for lazy reversible Markov chain Monte Carlo, J. Complexity, 25(1):11--24, 2009
Mathematics
Numerical Analysis
Scientific paper
10.1016/j.jco.2008.05.005
We prove explicit, i.e., non-asymptotic, error bounds for Markov Chain Monte Carlo methods, such as the Metropolis algorithm. The problem is to compute the expectation (or integral) of f with respect to a measure which can be given by a density with respect to another measure. A straight simulation of the desired distribution by a random number generator is in general not possible. Thus it is reasonable to use Markov chain sampling with a burn-in. We study such an algorithm and extend the analysis of Lovasz and Simonovits (1993) to obtain an explicit error bound.
No associations
LandOfFree
Explicit error bounds for lazy reversible Markov Chain Monte Carlo does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Explicit error bounds for lazy reversible Markov Chain Monte Carlo, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Explicit error bounds for lazy reversible Markov Chain Monte Carlo will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-500250