SearcharxivSearch

arXiv · 2412.19377

Geometric ergodicity of modified Euler schemes for SDEs with super-linearity

Abstract

As a well-known fact, the classical Euler scheme works merely for SDEs with coefficients of linear growth. In this paper, we study a general framework of modified Euler schemes, which is applicable to SDEs with super-linear drifts and encompasses numerical methods such as the tamed Euler scheme and the truncated Euler scheme. On the one hand, by exploiting an approach based on the refined basic coupling, we show that all Euler recursions within our proposed framework are geometrically ergodic under a mixed probability distance (i.e., the total variation distance plus the $L^1$-Wasserstein distance) and the weighted total variation distance. On the other hand, by utilizing the coupling by reflection, we demonstrate that the tamed Euler scheme is geometrically ergodic under the $L^1$-Wasserstein distance. In addition, as an important application, we provide a quantitative $L^1$-Wasserstein error bound between the exact invariant probability measure of an SDE with super-linearity, and the invariant probability measure of the tamed Euler scheme which is its numerical counterpart.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianhai Bao, Mateusz B. Majka, Jian Wang. 2024-12-26. Geometric ergodicity of modified Euler schemes for SDEs with super-linearity. https://arxiv.org/abs/2412.19377

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