Related papers: Interacting diffusions on sparse graphs: hydrodyna…
We propose a new perspective on the asymptotic regimes of fast and slow extinction in the contact process on locally converging sequences of sparse finite graphs. We characterise the phase boundary by the existence of a metastable density,…
We consider bootstrap percolation and diffusion in sparse random graphs with fixed degrees, constructed by configuration model. Every node has two states: it is either active or inactive. We assume that to each node is assigned a…
This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…
We consider the empirical neighborhood distribution of marked sparse Erd\"os-R\'enyi random graphs, obtained by decorating edges and vertices of a sparse Erd\"os-R\'enyi random graph with i.i.d.\ random elements taking values on Polish…
Population cross-diffusion systems of Shigesada-Kawasaki-Teramoto type are derived in a mean-field-type limit from stochastic, moderately interacting many-particle systems for multiple population species in the whole space. The diffusion…
Consider a graph where the sites are distributed in space according to a Poisson point process on $\mathbb R^n$. We study a population evolving on this network, with individuals jumping between sites with a rate which decreases…
Motivated by several applications, including neuronal models, we consider the McKean-Vlasov limit for mean-field systems of interacting diffusions with simultaneous jumps. We prove propagation of chaos via a coupling technique that involves…
We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…
The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…
In a previous paper(2021), the author studied the asymptotic behavior of coexistence steady-states to the Shigesada-Kawasaki-Teramoto model as both cross-diffusion coefficients tend to infinity at the same rate. As a result, he proved that…
Motivated by considerations from neuroscience (macroscopic behavior of large ensembles of interacting neurons), we consider a population of mean field interacting diffusions in $\mathbf {R}^m$ in the presence of a random environment and…
We propose new mathematical optimization models for generating sparse dynamical graphs, or networks, that can achieve synchronization. The synchronization phenomenon is studied using the Kuramoto model, defined in terms of the adjacency…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We study the limiting behaviour of the empirical measure of a system of diffusions interacting through their ranks when the number of diffusions tends to infinity. We prove that the limiting dynamics is given by a McKean-Vlasov evolution…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
In this article, we study the large-population limit of interacting particle systems posed on weighted random graphs. In that aim, we introduce a general framework for the construction of weighted random graphs, generalizing the concept of…
This is the first of two articles on the study of a particle system model that exhibits a Turing instability type effect. The model is based on two discrete lines (or toruses) with Ising spins, that evolve according to a continuous time…
Using the theory of $L^p$-graphons (Borgs et al, 2014), we derive and rigorously justify the continuum limit for systems of differential equations on sparse random graphs. Specifically, we show that the solutions of the initial value…
We propose and study a new model to describe biological invasions constrained on infinite homogeneous one dimensional metric graphs. Our model consists of an infinite PDE-ODE system where, at each vertex of the one-dimensional lattice…
We examine discrete vortex dynamics in two-dimensional flow through a network-theoretic approach. The interaction of the vortices is represented with a graph, which allows the use of network-theoretic approaches to identify key…