Related papers: Interacting diffusions on sparse graphs: hydrodyna…

This paper investigates properties of the class of graphs based on exchangeable point processes. We provide asymptotic expressions for the number of edges, number of nodes and degree distributions, identifying four regimes: (i) a dense…

In this paper we intend to present a unified treatment of a variety of singular interacting particle systems and their McKean-Vlasov limits. This unified approach is based on the use of the relative entropy on the path space in the spirit…

We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…

Inspired by recent work on minimizers and gradient flows of constrained interaction energies, we prove that these energies arise as the slow diffusion limit of well-known aggregation-diffusion energies. We show that minimizers of…

We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…

This study deals with continuous limits of interacting one-dimensional diffusive systems, arising from stochastic distortions of discrete curves with various kinds of coding representations. These systems are essentially of a…

We derive the hydrodynamic limit of a kinetic equation where the interactions in velocity are modelled by a linear operator (Fokker-Planck or Linear Boltzmann) and the force in the Vlasov term is a stochastic process with high amplitude and…

We consider an interacting particle system which models the sterile insect technique. It is the superposition of a generalized contact process with exchanges of particles on a finite cylinder with open boundaries (see Kuoch et al., 2017).…

We investigate stochastic reaction-diffusion equations on finite metric graphs. On each edge in the graph a multiplicative cylindrical Gaussian noise driven reaction-diffusion equation is given. The vertex conditions are the standard…

Consider a network of $n$ single-server queues where tasks arrive independently at each server at rate $\lambda_n$. The servers are connected by a graph that is resampled at rate $\mu_n$ in a way that is symmetric with respect to the…

We address the issue of the proximity of interacting diffusion models on large graphs with a uniform degree property and a corresponding mean field model, i.e. a model on the complete graph with a suitably renormalized interaction…

The notion of local weak convergence, or Benjamini--Schramm convergence, was introduced by Benjamini and Schramm. The local weak limit of sparse Erd\H os--R\'enyi graphs is the Galton--Watson measure with Poisson offspring almost surely.…

Kinetically-constrained models are lattice-gas models that are used for describing glassy systems. By construction, their equilibrium state is trivial and there are no equal-time correlations between the occupancy of different sites. We…

In this paper we obtain uniform propagation estimates for systems of interacting diffusions. We adopt a general model, satisfying various conditions which ensure that the decay resulting from the internal dynamics term dominates the…

The objective of this article is to analyse the statistical behaviour of a large number of weakly interacting diffusion processes evolving under the influence of a periodic interaction potential. We focus our attention on the combined mean…

Motivated by an application to empirical Bayes learning in high-dimensional regression, we study a class of Langevin diffusions in a system with random disorder, where the drift coefficient is driven by a parameter that continuously adapts…

In this article, we study the mean field limit of weakly interacting diffusions for confining and interaction potentials that are not necessarily convex. We explore the relationship between the large $N$ limit of the constant in the…

We consider the Kuramoto model on sparse random networks such as the Erd\H{o}s-R\'enyi graph or its combination with a regular two-dimensional lattice and study the dynamical scaling behavior of the model at the synchronization transition…

In a recent paper, Caron and Fox suggest a probabilistic model for sparse graphs which are exchangeable when associating each vertex with a time parameter in $\mathbb{R}_+$. Here we show that by generalizing the classical definition of…

We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…