Related papers: A note on dynamical models on random graphs and Fo…
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 a general interacting particle system with interactions on a random graph, and study the large population limit of this system. When the sequence of underlying graphs converges to a graphon, we show convergence of the…
We consider a system of $N$ interacting particles, governed by transport and diffusion, that converges in a mean-field limit to the solution of a McKean-Vlasov equation. From the observation of a trajectory of the system over a fixed time…
We are interested in modeling networks in which the connectivity among the nodes and node attributes are random variables and interact with each other. We propose a probabilistic model that allows one to formulate jointly a probability…
A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large…
The problem of diffusion in a time-dependent (and generally inhomogeneous) external field is considered on the basis of a generalized master equation with two times, introduced in [1,2]. We consider the case of the quasi Fokker-Planck…
For a class of interacting particle systems in continuous space, we show that finite-volume approximations of the bulk diffusion matrix converge at an algebraic rate. The models we consider are reversible with respect to the Poisson…
We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the…
We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…
We show that hydrodynamic collision processes of graphene at the neutrality point can be described in terms of a Fokker-Planck equation with fractional derivative, corresponding to a L\'evy flight in momentum space. Thus, electron-electron…
Graph models are widely used to analyse diffusion processes embedded in social contacts and to develop applications. A range of graph models are available to replicate the underlying social structures and dynamics realistically. However,…
We study the Fokker-Planck equation derived in the large system limit of the Markovian process describing the dynamics of quantitative traits. The Fokker-Planck equation is posed on a bounded domain and its transport and diffusion…
The usual Langevin approach to describe systems driven by noise fails to describe the long time behavior of systems with multiple attractors. The solution of the associated linear Fokker-Planck equation is always unique, even though it…
Models of meme propagation on social networks, in which memes compete for limited user attention, can successfully reproduce the heavy-tailed popularity distributions observed in online settings. While system-wide popularity distributions…
In the spirit of the macroscopic crowd motion models with hard congestion (i.e. a strong density constraint $\rho\leq 1$) introduced by Maury {\it et al.} some years ago, we analyze a variant of the same models where diffusion of the agents…
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…
We consider an evolving network of a fixed number of nodes. The allocation of edges is a dynamical stochastic process inspired by biological reproduction dynamics, namely by deleting and duplicating existing nodes and their edges. The…
In this work we study the dynamics of systems composed of numerous interacting elements interconnected through a random weighted directed graph, such as models of random neural networks. We develop an original theoretical approach based on…
We study in this paper the longtime behavior of some large but finite populations of interacting stochastic differential equations whose (infinite population) limit Fokker-Planck PDE admits a stable periodic solution. We show that the…
We discuss two cases that can be connected to the dynamics of interacting populations: (I.) density waves for the case or negligible random fluctuations of the populations densities, and (II.) probability distributions connected to the…