arXiv Analytics

Sign in

arXiv:1607.05224 [math.PR]AbstractReferencesReviewsResources

A note on dynamical models on random graphs and Fokker-Planck equations

Sylvain Delattre, Giambattista Giacomin, Eric Luçon

Published 2016-07-18Version 1

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 parameter. Examples include Erd\H{o}s-R\'enyi graphs with edge probability $p_n$, $n$ is the number of vertices, such that $\lim_{n \to \infty}p_n n= \infty$. The purpose of this note it twofold: (1) to establish this proximity on finite time horizon, by exploiting the fact that both systems are accurately described by a Fokker-Planck PDE (or, equivalently, by a nonlinear diffusion process) in the $n=\infty$ limit; (2) to remark that in reality this result is unsatisfactory when it comes to applying it to systems with $N$ large but finite, for example the values of $N$ that can be reached in simulations or that correspond to the typical number of interacting units in a biological system.

Related articles: Most relevant | Search more
arXiv:math/0505608 [math.PR] (Published 2005-05-27, updated 2007-08-16)
A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs
arXiv:1611.10167 [math.PR] (Published 2016-11-30)
Thresholds for contagious sets in random graphs
arXiv:1502.06982 [math.PR] (Published 2015-02-24)
Percolation by cumulative merging and phase transition for the contact process on random graphs