SearcharxivSearch

arXiv · 2310.10742

Mean-field limit of particle systems with absorption

Abstract

In this work, we consider one-dimensional particles interacting in mean-field type through a bounded kernel. In addition, when particles hit some barrier (say zero), they are removed from the system. This absorption of particles is instantaneously felt by the others, as, contrary to the usual mean-field setting, particles interact only with other non-absorbed particles. This makes the interaction singular as it happens through hitting times of the given barrier. In addition, the diffusion coefficient of each particle is non uniformly elliptic. We show that the particle system admits a weak solution. Through Partial Girsanov transforms we are able to relate our particles with independent stopped Brownian motions, and prove tightness and convergence to a mean-fied limit stochastic differential equation when the number of particles tends to infinity. Further, we study the limit and establish the existence and uniqueness of the classical solution to the corresponding nonlinear Fokker-Planck equation under some continuity assumption on the interacting kernel. This yields the strong well-posedness of the mean-field limit SDE and confirms that our convergence result is indeed a propagation of chaos result.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gaoyue Guo, Maxime Latypov, Milica Tomasevic. 2023-10-16. Mean-field limit of particle systems with absorption. https://arxiv.org/abs/2310.10742

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