Abstract
We study the error of reversible Markov chain Monte Carlo methods for approximating the expectation of a function. Explicit error bounds with respect to the l2-, l4- and l∞-norm of the function are proven. By the estimation the well-known asymptotical limit of the error is attained, i.e. our bounds are correct to first order as n → ∞. We discuss the dependence of the error on a burn-in of the Markov chain. Furthermore we suggest and justify a specific burn-in for optimizing the algorithm.
Keywords.: Markov chain Monte Carlo methods; Markov chain Monte Carlo; error bounds; explicit error bounds; burn-in; mixing time; eigenvalue
Received: 2009-09-25
Revised: 2010-09-08
Published Online: 2010-10-20
Published in Print: 2010-December
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Editiorial
- Random packing of hyperspheres and Marsaglia's parking lot test
- Diffusion in a nonhomogeneous medium: quasi-random walk on a lattice
- Improved Halton sequences and discrepancy bounds
- Generalizing Sudoku to three dimensions
- Adaptive integration and approximation over hyper-rectangular regions with applications to basket option pricing
- Exact simulation of Bessel diffusions
- A good permutation for one-dimensional diaphony
- Error bounds for computing the expectation by Markov chain Monte Carlo
- Stochastic iterative projection methods for large linear systems
- Increasing the number of inner replications of multifactor portfolio credit risk simulation in the t-copula model
- A genetic algorithm approach to estimate lower bounds of the star discrepancy
- Random and deterministic fragmentation models
- MCMC imputation in autologistic model
Keywords for this article
Markov chain Monte Carlo methods;
Markov chain Monte Carlo;
error bounds;
explicit error bounds;
burn-in;
mixing time;
eigenvalue
Articles in the same Issue
- Editiorial
- Random packing of hyperspheres and Marsaglia's parking lot test
- Diffusion in a nonhomogeneous medium: quasi-random walk on a lattice
- Improved Halton sequences and discrepancy bounds
- Generalizing Sudoku to three dimensions
- Adaptive integration and approximation over hyper-rectangular regions with applications to basket option pricing
- Exact simulation of Bessel diffusions
- A good permutation for one-dimensional diaphony
- Error bounds for computing the expectation by Markov chain Monte Carlo
- Stochastic iterative projection methods for large linear systems
- Increasing the number of inner replications of multifactor portfolio credit risk simulation in the t-copula model
- A genetic algorithm approach to estimate lower bounds of the star discrepancy
- Random and deterministic fragmentation models
- MCMC imputation in autologistic model