SearcharxivSearch

arXiv · 2011.00537

Quantitative particle approximation of nonlinear Fokker-Planck equations with singular kernel

Abstract

In this work, we study the convergence of the empirical measure of moderately interacting particle systems with singular interaction kernels. First, we prove quantitative convergence of the time marginals of the empirical measure of particle positions towards the solution of the limiting nonlinear Fokker-Planck equation. Second, we prove the well-posedness for the McKean-Vlasov SDE involving such singular kernels and the convergence of the empirical measure towards it (propagation of chaos). Our results only require very weak regularity on the interaction kernel, including the Biot-Savart kernel, and attractive kernels such as Riesz and Keller-Segel kernels in arbitrary dimension. For some of these important examples, this is the first time that a quantitative approximation of the PDE is obtained by means of a stochastic particle system. In particular, this convergence still holds (locally in time) for PDEs exhibiting a blow-up in finite time. The proofs are based on a semigroup approach combined with a fine analysis of the regularity of infinite-dimensional stochastic convolution integrals.

Explore related subjects

Keep this discovery

BibTeXRIS

Christian Olivera, Alexandre Richard, Milica Tomasevic. 2020-11-01. Quantitative particle approximation of nonlinear Fokker-Planck equations with singular kernel. https://arxiv.org/abs/2011.00537

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