Related papers: Mean-Field Limits for Stochastic Interacting Parti…
The convergence of stochastic interacting particle systems in the mean-field limit to solutions of conservative stochastic partial differential equations is established, with optimal rate of convergence. As a second main result, a…
Fokker-Planck equations represent a suitable description of the finite-time behavior for a large class of particle systems as the size of the population tends to infinity. Recently, the theory of graph limits has been introduced in the…
The Random Batch Method proposed in our previous work [Jin et al., J. Comput. Phys., 400(1), 2020] is not only a numerical method for interacting particle systems and its mean-field limit, but also can be viewed as a model of particle…
We consider a system of $N$ particles whose interactions are characterized by a (weighted) graph $G^N$. Each particle is a node of the graph with an internal state. The state changes according to Markovian dynamics that depend on the states…
For algorithms based on interacting particle systems that admit a mean-field description, convergence analysis is often more accessible at the mean-field level. In order to transfer convergence results obtained at the mean-field level to…
In this brief note, we report a formal mathematical observation: we are about to breach a major century-old barrier in the analysis of interacting particle systems. More precisely, it is well-known that in…
Interacting particle systems are in frequent use to model collective behaviour in various situations and applications. For many systems, the interaction between the agents is restricted to an underlying network structure and often, the…
We consider a class of particle systems described by differential equations (both stochastic and deterministic), in which the interaction network is determined by the realization of an Erd\H{o}s-R\'enyi graph with parameter $p_n\in (0, 1]$,…
We consider an interacting system of one-dimensional structures modelling fibers with fiber-fiber interaction in a fiber lay-down process. The resulting microscopic system is investigated by looking at different asymptotic limits of the…
We study the large-population limit of interacting particle systems evolving on adaptive dynamical networks, motivated in particular by models of opinion dynamics. In such systems, agents interact through weighted graphs whose structure…
We propose a particle system of diffusion processes coupled through a chain-like network structure described by an infinite-dimensional, nonlinear stochastic differential equation of McKean-Vlasov type. It has both (i) a local chain…
In this article, we study an interacting particle system in the context of epidemiology where the individuals (particles) are characterized by their position and infection state. We begin with a description at the microscopic level where…
We consider particle-based stochastic reaction-drift-diffusion models where particles move via diffusion and drift induced by one- and two-body potential interactions. The dynamics of the particles are formulated as measure-valued…
We consider Mckean-Vlasov type stochastic differential equations with multiplicative noise arising from the random vortex method. Such an equation can be viewed as the mean-field limit of interacting particle systems with singular…
This paper studies a general class of stochastic population processes in which agents interact with one another over a network. Agents update their behaviors in a random and decentralized manner according to a policy that depends only on…
Stochastic partial differential equations (SPDE) on graphs were introduced by Cerrai and Freidlin [Ann. Inst. Henri Poincar\'e Probab. Stat. 53 (2017) 865-899]. This class of stochastic equations in infinite dimensions provides a minimal…
The dynamics of spatially-structured networks of $N$ interacting stochastic neurons can be described by deterministic population equations in the mean-field limit. While this is known, a general question has remained unanswered: does…
This paper deals with the derivation of the mean-field limit for multi-agent systems on a large class of sparse graphs. More specifically, the case of non-exchangeable multi-agent systems consisting of non-identical agents is addressed. The…
We consider systems of mean-field interacting diffusions, where the pairwise interaction structure is described by a sparse (and potentially inhomogeneous) random graph. Examples include the stochastic Kuramoto model with pairwise…
Stochastic interacting particle systems are widely used to model collective phenomena across diverse fields, including statistical physics, biology, and social dynamics. The McKean-Vlasov equation arises as the mean-field limit of such…