Related papers: Interacting particle systems on sparse $W$-random …
In this paper, we study well-posedness of random periodic solutions of stochastic differential equations (SDEs) of McKean-Vlasov type driven by a two-sided Brownian motion, where the random periodic behaviour is characterised by the…
We study a model for flocking given by a $n$-particle system under which each particle jumps forward by a random amount, independently sampled from a given distribution $\theta$, with rate given by a non-increasing function $w$ of its…
Graphons have traditionally served as limit objects for dense graph sequences, with the cut distance serving as the metric for convergence. However, sparse graph sequences converge to the trivial graphon under the conventional definition of…
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…
We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphons. We then show that the degree of a uniform random vertex…
We consider the problem of parameter estimation for a stochastic McKean-Vlasov equation, and the associated system of weakly interacting particles. We study two cases: one in which we observe multiple independent trajectories of the…
The decomposition of the energy of a compressible fluid parcel into slow (deterministic) and fast (stochastic) components is interpreted as a stochastic Hamiltonian interacting particle system (HIPS). It is shown that the McKean-Vlasov…
We analyse the stability of linear dynamical systems defined on sparse, random graphs with predator-prey, competitive, and mutualistic interactions. These systems are aimed at modelling the stability of fixed points in large systems defined…
The stochastic Kuramoto model defined on a sequence of graphs is analyzed: the emphasis is posed on the relationship between the mean field limit, the connectivity of the underlying graph and the long time behavior. We give an explicit…
This note is a companion article to the recent paper L\"ocherbach, Loukianova, Marini (2024). We consider mean field systems of interacting particles. Each particle jumps with a jump rate depending on its position. When jumping, a…
We consider a system consisting of $n$ particles, moving forward in jumps on the real line. System state is the empirical distribution of particle locations. Each particle ``jumps forward'' at some time points, with the instantaneous rate…
In this paper we continue the study of the derivation of different types of kinetic equations which arise from scaling limits of interacting particle systems. We began this study in \cite{NVW}. More precisely, we consider the derivation of…
Using the weak convergence approach to large deviations, we formulate and prove the large deviation principle (LDP) for W-random graphs in the cut-norm topology. This generalizes the LDP for Erd\H{o}s-R{\' e}nyi random graphs by Chatterjee…
We consider a collection of weakly interacting diffusion processes moving in a two-scale locally periodic environment. We study the large deviations principle of the empirical distribution of the particles' positions in the combined limit…
In this paper we consider an interacting particle system in $\mathbb{R}^d$ modelled as a system of $N$ stochastic differential equations driven by L\'evy processes. The limiting behaviour as the size $N$ grows to infinity is achieved as a…
We consider a population of $N$ interacting neurons, represented by a multivariate Hawkes process: the firing rate of each neuron depends on the history of the connected neurons. Contrary to the mean-field framework where the interaction…
We establish a general perturbative method to prove entropic Ricci curvature bounds for interacting stochastic particle systems. We apply this method to obtain curvature bounds in several examples, namely: Glauber dynamics for a class of…
Focusing on stochastic systems arising in mean-field models, the systems under consideration belong to the class of switching diffusions, in which continuous dynamics and discrete events coexist and interact. The discrete events are modeled…
A graph reaction--diffusion (RD) equation is a system of differential equations that is defined on the nodes of a graph. Consider a sequence of growing graphs that converges in cut norm to a limiting graphon. We show that the solutions of…
We prove a Large Deviations Principle (LDP) for systems of diffusions (particles) interacting through their ranks, when the number of particles tends to infinity. We show that the limiting particle density is given by the unique solution of…