SearcharxivSearch

arXiv · 2312.00339

Propagation of chaos in path spaces via information theory

Abstract

Propagation of chaos for interacting particle systems has been an active research topic over decades. We propose an alternative approach to study the mean-field limit of the stochastic interacting particle systems via tools from information theory. In our framework, the propagation of chaos is reduced to the space for driving processes with possible lower dimension. Indeed, after applying the data processing inequality, one only needs to estimate the difference between the drifts of the particle system and the mean-field Mckean stochastic differential equation. This point is particularly useful in situations where the discrepancy in the driving processes is more apparent than the investigated processes. We will take the second order system as well as other examples for the illustration of how our framework could be used. This approach allows us to focus on probability measures in path spaces for the driving processes, avoiding using the usual hypocoercivity technique or taking the pseudo-inverse of the diffusion matrix, which might be more stable for numerical computation. Our framework is different from current approaches in literature and could provide new insight into the study of interacting particle systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Lei Li, Yuelin Wang, Yuliang Wang. 2023-12-01. Propagation of chaos in path spaces via information theory. https://arxiv.org/abs/2312.00339

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