SearcharxivSearch

arXiv · 1602.00548

Multilevel Monte Carlo for Lévy-driven SDEs: Central limit theorems for adaptive Euler schemes

Abstract

In this article, we consider multilevel Monte Carlo for the numerical computation of expectations for stochastic differential equations driven by Lévy processes. The underlying numerical schemes are based on jump-adapted Euler schemes. We prove stable convergence of an idealised scheme. Further, we deduce limit theorems for certain classes of functionals depending on the whole trajectory of the process. In particular, we allow dependence on marginals, integral averages and the supremum of the process. The idealised scheme is related to two practically implementable schemes and corresponding central limit theorems are given. In all cases, we obtain errors of order $N^{-1/2}(\log N)^{1/2}$ in the computational time $N$ which is the same order as obtained in the classical set-up analysed by Giles [Oper. Res. 56 (2008) 607-617]. Finally, we use the central limit theorems to optimise the parameters of the multilevel scheme.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Steffen Dereich, Sangmeng Li. 2016-02-01. Multilevel Monte Carlo for Lévy-driven SDEs: Central limit theorems for adaptive Euler schemes. https://doi.org/10.1214/14-aap1087

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