SearcharxivSearch

arXiv · 2002.08834

Central Limit Theorem for the $\sigma$-antithetic multilevel Monte Carlo method

Abstract

In this paper, we introduce the $\sigma$-antithetic multilevel Monte Carlo (MLMC) estimator for a multi-dimensional diffusion which is an extended version of the original antithetic MLMC one introduced by Giles and Szpruch \cite{a}. Our aim is to study the asymptotic behavior of the weak errors involved in this new algorithm. Among the obtained results, we prove that the error between on the one hand the average of the Milstein scheme without L\'evy area and its $\sigma$-antithetic version build on the finer grid and on the other hand the coarse approximation stably converges in distribution with a rate of order 1. We also prove that the error between the Milstein scheme without L\'evy area and its $\sigma$-antithetic version stably converges in distribution with a rate of order $1/2$. More precisely, we have a functional limit theorem on the asymptotic behavior of the joined distribution of these errors based on a triangular array approach (see e.g. Jacod \cite{c}). Thanks to this result, we establish a central limit theorem of Lindeberg-Feller type for the $\sigma$-antithetic MLMC estimator. The time complexity of the algorithm is carried out.

Explore related subjects

Keep this discovery

BibTeXRIS

Mohamed Ben Alaya, Ahmed Kebaier, Thi Bao Tram Ngo. 2020-02-20. Central Limit Theorem for the $\sigma$-antithetic multilevel Monte Carlo method. https://doi.org/10.1214/21-aap1726

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR