SearcharxivSearch

arXiv · 2310.05390

Approximation of the invariant measure for stable SDE by the Euler-Maruyama scheme with decreasing step-sizes

Abstract

Let $(X_t)_{t \ge 0}$ be the solution of the stochastic differential equation $$dX_t = b(X_t) dt+A dZ_t, \quad X_{0}=x,$$ where $b: \mathbb{R}^d \rightarrow \mathbb R^d$ is a Lipschitz function, $A \in \mathbb R^{d \times d}$ is a positive definite matrix, $(Z_t)_{t\geq 0}$ is a $d$-dimensional rotationally invariant $\alpha$-stable L\'evy process with $\alpha \in (1,2)$ and $x\in\mathbb{R}^{d}$. We use two Euler-Maruyama schemes with decreasing step sizes $\Gamma = (\gamma_n)_{n\in \mathbb{N}}$ to approximate the invariant measure of $(X_t)_{t \ge 0}$: one with i.i.d. $\alpha$-stable distributed random variables as its innovations and the other with i.i.d. Pareto distributed random variables as its innovations. We study the convergence rate of these two approximation schemes in the Wasserstein-1 distance. For the first scheme, when the function $b$ is Lipschitz and satisfies a certain dissipation condition, we show that the convergence rate is $\gamma^{1/\alpha}_n$. Under an additional assumption on the second order directional derivatives of $b$, this convergence rate can be improved to $\gamma^{1+\frac 1 {\alpha}-\frac{1}{\kappa}}_n$ for any $\kappa \in [1,\alpha)$. For the second scheme, when the function $b$ is twice continuously differentiable, we obtain a convergence rate of $\gamma^{\frac{2-\alpha}{\alpha}}_n$. We show that the rate $\gamma^{\frac{2-\alpha}{\alpha}}_n$ is optimal for the one dimensional stable Ornstein-Uhlenbeck process. Our theorems indicate that the recent remarkable result about the unadjusted Langevin algorithm with additive innovations can be extended to the SDEs driven by an $\alpha$-stable L\'evy process and the corresponding convergence rate has a similar behaviour. Compared with the previous result, we have relaxed the second order differentiability condition to the Lipschitz condition for the first scheme.

Explore related subjects

Keep this discovery

BibTeXRIS

Peng Chen, Xinghu Jin, Yimin Xiao, Lihu Xu. 2023-10-09. Approximation of the invariant measure for stable SDE by the Euler-Maruyama scheme with decreasing step-sizes. https://arxiv.org/abs/2310.05390

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