Search arXivSearch

arXiv · 1609.08037

A Multi-Dimensional Central Limit Bound and its Application to the Euler Approximation of L\'evy SDEs

Abstract

Rio gave a concise bound for the central limit theorem in the Vaserstein distances, which is a ratio between some higher moments and some powers of the variance. As a corollary, it gives an estimate for the normal approximation of the small jumps of the L\'evy processes, and Fournier applied that to the Euler approximation of L\'evy-driven stochastic differential equations. However both results are restricted to the one-dimensional case. It will be shown in this article that, following Davie's idea, one can generalise Rio's result to multidimensional case, and the number of moments required is independent of the dimension. Also two different approaches are developed to simulate multidimensional L\'evy SDEs: one as a corollary to the central limit bound, the other directly derived from the L\'evy-Khinchine formula.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiling Zhang. 2016-09-26. A Multi-Dimensional Central Limit Bound and its Application to the Euler Approximation of L\'evy SDEs. https://doi.org/10.1051/ps/2017021

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