Central limit theorem for the multilevel Monte Carlo Euler method
arXiv:1501.06365 · doi:10.1214/13-AAP993
Abstract
This paper focuses on studying the multilevel Monte Carlo method recently introduced by Giles [Oper. Res. 56 (2008) 607-617] which is significantly more efficient than the classical Monte Carlo one. Our aim is to prove a central limit theorem of Lindeberg-Feller type for the multilevel Monte Carlo method associated with the Euler discretization scheme. To do so, we prove first a stable law convergence theorem, in the spirit of Jacod and Protter [Ann. Probab. 26 (1998) 267-307], for the Euler scheme error on two consecutive levels of the algorithm. This leads to an accurate description of the optimal choice of parameters and to an explicit characterization of the limiting variance in the central limit theorem of the algorithm. A complexity of the multilevel Monte Carlo algorithm is carried out.
Published in at http://dx.doi.org/10.1214/13-AAP993 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (3)
Cited by in corpus (12)
- Multilevel Richardson-Romberg extrapolation
- Multilevel Monte Carlo for Lévy-driven SDEs: Central limit theorems for adaptive Euler schemes
- Limit theorems for weighted and regular Multilevel estimators
- Central limit theorems for multilevel Monte Carlo methods
- Goal-Oriented Adaptive Finite Element Multilevel Monte Carlo with Convergence Rates
- Improved adaptive Multilevel Monte Carlo and applications to finance
- Discrete-time Simulation of Stochastic Volterra Equations
- Central Limit Theorem for the -antithetic multilevel Monte Carlo method
- Coupling Importance Sampling and Multilevel Monte Carlo using Sample Average Approximation
- Monte Carlo algorithm for the extrema of tempered stable processes
- Asymptotics for the normalized error of the Ninomiya-Victoir scheme
- Asymptotic behavior of the multilevel type error for SDEs driven by a pure jump Lévy process