SearcharxivSearch

arXiv · 2511.04019

Functional central limit theorem for Euler--Maruyama scheme with decreasing step sizes

Abstract

We consider the Euler--Maruyama (EM) scheme of a family of dissipative SDEs, whose step sizes $\eta_{1}\ge\eta_{2}\ge \cdots$ are decreasing, and prove that the EM scheme weakly converges to a subordinated Brownian motion $\{B_{a(t)}\}_{0\le t\le 1}$ rather than $\{B_{t}\}_{0\le t\le 1}$, where $a(t)$ is an increasing function depending on $\{\eta_{k}\}_{k \ge 1}$, for instance, $a(t)=t^{1+\alpha}$ if $\eta_k =k^{-\alpha}$. Compared to the EM scheme with constant step size, there are substantial differences as the following: (i) the EM time series is inhomogeneous and weakly converges to the ergodic measure in a polynomial speed; (ii) we have a special number $T_n =\frac{1}{\eta_1 }+\cdots+\frac{1}{\eta_n }$ which roughly measures the dependence of the EM time series; (iii) the normalized number in the CLT is $T_n ^{-1/2}n$ rather than $\sqrt{n}$, in particular, $T_n ^{-1/2}n \propto n^{(1-\beta)/2}$ when $\eta_{k}=1/k^{\beta}$ with $\beta\in(0,1)$; (iv) in the critical choice $\eta_{k}=1/k$, we have $T_{n}^{-1/2}n=O(1)$ and thus conjecture that the CLT and FCLT do not hold. This conjecture has been verified by simulations. A key distinction arises between the constant and decreasing step size implementations of the EM scheme. Under a constant step size, the time series is homogeneous. This allows one to use a stationary initialization, which automatically eliminates several complex terms in the subsequent proof of the CLT. Conversely, the time series generated by the EM scheme with decreasing step sizes forms an inhomogeneous Markov chain. To manage the analogous difficult terms in this case, that is, when the test function $h$ is Lipschitz, we must instead establish a bound for the Wasserstein-2 distance $W_{2}(\theta_k ,X_{t_k })$. This technique for handling the inhomogeneous case could be of independent interest beyond the current proof.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qiyang Pei, Lihu Xu. 2025-11-06. Functional central limit theorem for Euler--Maruyama scheme with decreasing step sizes. https://arxiv.org/abs/2511.04019

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