SearcharxivSearch

arXiv · 2412.09850

Averaging principles for time-inhomogeneous multi-scale SDEs via nonautonomous Poisson equations

Abstract

The purpose of this paper is to establish asymptotic behaviors of time-inhomogeneous multi-scale stochastic differential equations (SDEs). To achieve them, we analyze the evolution system of measures for time-inhomogeneous Markov semigroups, and investigate regular properties of nonautonomous Poisson equations. The strong and the weak averaging principle for time-inhomogeneous multi-scale SDEs, as well as explicit convergence rates, are provided. Specifically, we show the slow component in the multi-scale stochastic system converges strongly or weakly to the solution of an averaged equation, whose coefficients retain the dependence of the scaling parameter. When the coefficients of the fast component exhibit additional asymptotic or time-periodic behaviors, we prove the slow component converges strongly or weakly to the solution of an averaged equation, whose coefficients are independent of the scaling parameter. Finally, two examples are given to indicate the effectiveness of all the averaged equations mentioned above.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiaobin Sun, Jian Wang, Yingchao Xie. 2024-12-13. Averaging principles for time-inhomogeneous multi-scale SDEs via nonautonomous Poisson equations. https://arxiv.org/abs/2412.09850

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