SearcharxivSearch

arXiv · 2511.09220

Weak conditional propagation of chaos for systems of interacting particles with nearly stable jumps

Abstract

We consider a system of $N$ interacting particles, described by SDEs driven by Poisson random measures, where the coefficients depend on the empirical measure of the system. Every particle jumps with a jump rate depending on its position. When this happens, all the other particles of the system receive a small random kick which is distributed according to a heavy-tailed random variable belonging to the domain of attraction of an $\alpha$-stable law and scaled by $N^{-1/\alpha},$ where $0<\alpha<2$. We call these jumps collateral jumps. Moreover, in case $0<\alpha<1$, the jumping particle itself undergoes a macroscopic, main jump. Such systems appear in the modeling of large neural networks, such as the human brain. Using a representation of the collateral jump sum as a time-changed random walk, we prove the convergence in law, in Skorokhod space, of this system to a limit infinite-exchangeable system of SDEs driven by a common stable process. This stable process arises due to the stable central limit theorem, and the particles in the limit system are independent and identically distributed, conditionally on that. That is, the $N$-particle system exhibits the conditional propagation of chaos property.

Explore related subjects

Keep this discovery

BibTeXRIS

Eva Löcherbach, Dasha Loukianova, Elisa Marini. 2025-11-12. Weak conditional propagation of chaos for systems of interacting particles with nearly stable jumps. https://arxiv.org/abs/2511.09220

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