SearcharxivSearch

arXiv · 2412.13430

Asymptotic limit of fully coupled multi-scale non-linear stochastic system: the non-autonomous approximation method

Abstract

In this paper, we develop a novel argument, the non-autonomous approximation method, to seek the asymptotic limits of the fully coupled multi-scale McKean-Vlasov stochastic systems with irregular coefficients, which, as summarized in [3,Section 7], remains an open problem in the field. We provide an explicit characterization for the averaged limit of the non-linear stochastic system, where both the choice of the frozen equation and the definition of the averaged coefficients are more or less unexpected since new integral terms with respect to the measure variable appear. More importantly, in contrast with the classical theory of multi-scale systems which focuses on the averaged limit of the slow process, we propose a new perspective that the asymptotic behavior of the entire system is actually governed by the limit of the fast motion. By studying the long-time estimates of the solution of the Kolmogorov equation in Wasserstein space, we identify the limiting distribution of the fast motion of the non-linear system, which, to the best of our knowledge, is new even for the classical multi-scale It\^o SDEs. Furthermore, rates of convergence are also obtained, which are rather sharp and depend only on the regularity of the coefficients with respect to the slow variable. The innovation of our argument is to transform the non-linear system into a sequence of linear but non-autonomous systems, which is rather simple insofar as it avoids to involve the mean-field type PDEs associated with non-linear stochastic system, and at the same time, it turns out to be quite effective as it enables us to show that the strong convergence in the averaging principle of the non-linear stochastic system follows directly from the weak convergence, which significantly simplified the proof.

Explore related subjects

Keep this discovery

BibTeXRIS

Yuewen Hou, Yun Li, Longjie Xie. 2024-12-18. Asymptotic limit of fully coupled multi-scale non-linear stochastic system: the non-autonomous approximation method. https://arxiv.org/abs/2412.13430

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