A note on dynamical models on random graphs and Fokker-Planck equations
Abstract
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 , is the number of vertices, such that . 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 limit; (2) to remark that in reality this result is unsatisfactory when it comes to applying it to systems with large but finite, for example the values of that can be reached in simulations or that correspond to the typical number of interacting units in a biological system.
Cite
@article{arxiv.1607.05224,
title = {A note on dynamical models on random graphs and Fokker-Planck equations},
author = {Sylvain Delattre and Giambattista Giacomin and Eric Luçon},
journal= {arXiv preprint arXiv:1607.05224},
year = {2016}
}
Comments
14 pages, 1 figure. A few corrections, streamlined some explanations and improved Corollary 1.2