SearcharxivSearch

arXiv · 2101.04099

Quantitative mean-field limit for interacting branching diffusions

Abstract

We establish an explicit rate of convergence for some systems of mean-field interacting diffusions with logistic binary branching towards the solutions of nonlinear evolution equations with non-local self-diffusion and logistic mass growth, shown to describe their large population limits in arXiv:1303.3939. The proof relies on a novel coupling argument for binary branching diffusions based on optimal transport, which allows us to sharply mimic the trajectory of the interacting binary branching population by certain system of independent particles with suitably distributed random space-time births. We are thus able to derive an optimal convergence rate, in the dual bounded-Lipschitz distance on finite measures, for the empirical measure of the population, from the convergence rate in 2-Wasserstein distance of empirical distributions of i.i.d. samples. Our approach and results extend techniques and ideas on propagation of chaos from kinetic models to stochastic systems of interacting branching populations, and appear to be new in this setting, even in the simple case of pure binary branching diffusions.

Explore related subjects

Keep this discovery

BibTeXRIS

Joaquín Fontbona, Felipe Muñoz-Hernández. 2021-01-11. Quantitative mean-field limit for interacting branching diffusions. https://arxiv.org/abs/2101.04099

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