Mean-Field Approximation of Dynamics on Networks
Jonathan A. Ward, G\'abor Tim\'ar, P\'eter L. Simon

TL;DR
This paper introduces a rigorous method for deriving mean-field approximations of network dynamics from exact Markov chain descriptions, reducing complex models to manageable differential equations with quantifiable errors.
Contribution
It presents a unified, mathematically rigorous framework for deriving mean-field approximations using approximate lumping, applicable to a broad class of network-based Markov processes.
Findings
Provides a systematic derivation of mean-field equations from Markov chain models.
Unifies various existing approaches under a common rigorous framework.
Highlights sources of approximation error in mean-field models.
Abstract
Many real-world phenomena can be modelled as dynamical processes on networks, a prominent example being the spread of infectious diseases such as COVID-19. Mean-field approximations are a widely used tool to analyse such dynamical processes on networks, but these are typically derived using plausible probabilistic reasoning, introducing uncontrolled errors that may lead to invalid mathematical conclusions. In this paper we present a rigorous approach to derive mean-field approximations from the exact description of Markov chain dynamics on networks through a process of averaging called approximate lumping. We consider a general class of Markov chain dynamics on networks in which each vertex can adopt a finite number of ``vertex-states'' (e.g. susceptible, infected, recovered etc.), and transition rates depend on the number of neighbours of each type. Our approximate lumping is based on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
