Search arXivSearch

arXiv · 2008.04822

Averaging principle and normal deviations for multiscale stochastic systems

Abstract

We study the asymptotic behavior for an inhomogeneous multiscale stochastic dynamical system with non-smooth coefficients. Depending on the averaging regime and the homogenization regime, two strong convergences in the averaging principle of functional law of large numbers type are established. Then we consider the small fluctuations of the system around its average. Nine cases of functional central limit type theorems are obtained. In particular, even though the averaged equation for the original system is the same, the corresponding homogenization limit for the normal deviation can be quite different due to the difference in the interactions between the fast scales and the deviation scales. We provide quite intuitive explanations for each case. Furthermore, sharp rates both for the strong convergences and the functional central limit theorems are obtained, and these convergences are shown to rely only on the regularity of the coefficients of the system with respect to the slow variable, and do not depend on their regularity with respect to the fast variable, which coincide with the intuition since in the limit equations the fast component has been totally averaged or homogenized out.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Röckner, Longjie Xie. 2020-08-11. Averaging principle and normal deviations for multiscale stochastic systems. https://doi.org/10.1007/s00220-021-04069-z

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