SearcharxivSearch

arXiv · 1709.04480

Asymptotic error distribution for the Euler scheme with locally Lipschitz coefficients

Abstract

In traditional work on numerical schemes for solving stochastic differential equations (SDEs), it is usually assumed that the coefficients are globally Lipschitz. This assumption has been used to establish a powerful analysis of the numerical approximations of the solutions of stochastic differential equations. In practice, however, the globally Lipschitz assumption on the coefficients is on occasion too stringent a requirement to meet. Some Brownian motion driven SDEs used in applications have coefficients that are Lipschitz only on compact sets. Reflecting the importance of the locally Lipschitz case, it has been well studied in recent years, yet some simple to state, fundamental results remain unproved. We attempt to fill these gaps in this paper, establishing both a rate of convergence, but also we find the asymptotic normalized error process of the error process arising from a sequence of approximations. The result is analogous to the original result of this type, established in KT1991-2 back in 1991. This result was improved in 1998 in JJ1998, and recently(2009) it was partially extended in AN. As we indicate, the results in our paper provide the basis of a statistical analysis of the error; in this spirit we give conditions for a finite variance.

Explore related subjects

Keep this discovery

BibTeXRIS

Philip Protter, Lisha Qiu, Jaime San Martin. 2017-09-13. Asymptotic error distribution for the Euler scheme with locally Lipschitz coefficients. https://arxiv.org/abs/1709.04480

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