SearcharxivSearch

arXiv · 2409.03459

Emergence of regularity for limit points of McKean-Vlasov particle systems

Abstract

The empirical measure of an interacting particle system is a purely atomic random probability measure. In the limit as the number of particles grows to infinity, we show for McKean-Vlasov systems with common noise that this measure becomes absolutely continuous with respect to Lebesgue measure for almost all times, almost surely. The density possesses good regularity properties, and we obtain a moment bound for its (random) fractional Sobolev norm. This result is obtained for dynamics with a bounded drift, bounded and H\"older-continuous diffusion coefficients and when the diffusion coefficient for the idiosyncratic noise is uniformly elliptic. We directly study the sequence of particle systems via approximating their exchangeable dynamics by conditionally independent dynamics at the expense of an error. By using probabilistic means, the approximation and the error are controlled for each particle system, and the results are then passed to the large-system limit. The estimates thus obtained are combined via an analytic interpolation technique to derive a norm bound for the limiting random density. In this way, we obtain a regularity estimate for all cluster points, without requiring any knowledge of the dynamics of the limiting measure-valued flow.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert Alexander Crowell. 2024-09-05. Emergence of regularity for limit points of McKean-Vlasov particle systems. https://arxiv.org/abs/2409.03459

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