SearcharxivSearch

arXiv · 2302.08763

Rigorous Derivation of the Degenerate Parabolic-Elliptic Keller-Segel System from a Moderately Interacting Stochastic Particle System. Part II Propagation of Chaos

Abstract

This work is a series of two articles. The main goal is to rigorously derive the degenerate parabolic-elliptic Keller-Segel system in the sub-critical regime from a moderately interacting stochastic particle system. In the first article [7], we establish the classical solution theory of the degenerate parabolic-elliptic Keller-Segel system and its non-local version. In the second article, which is the current one, we derive a propagation of chaos result, where the classical solution theory obtained in the first article is used to derive required estimates for the particle system. Due to the degeneracy of the non-linear diffusion and the singular aggregation effect in the system, we perform an approximation of the stochastic particle system by using a cut-offed interacting potential. An additional linear diffusion on the particle level is used as a parabolic regularization of the system. We present the propagation of chaos result with logarithmic scalings. Consequently, the propagation of chaos follows directly from convergence in the sense of expectation and the vanishing viscosity argument of the Keller-Segel system.

Explore related subjects

Keep this discovery

BibTeXRIS

Li Chen, Veniamin Gvozdik, Yue Li. 2023-02-17. Rigorous Derivation of the Degenerate Parabolic-Elliptic Keller-Segel System from a Moderately Interacting Stochastic Particle System. Part II Propagation of Chaos. https://arxiv.org/abs/2302.08763

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