Edge-based mean-field approximation of dynamics on networks via approximate lumping of Markov chains

Mean-field approximations for dynamical processes on networks are widely used, but existing derivations often rely either on moment closures or on idealised assumptions about network structure, leaving the nature of the underlying averaging unclear.

Here we present a mathematically principled framework for deriving edge-based mean-field approximations for a broad class of Markov processes on networks using approximate lumping.

We consider models in which each vertex is in one of a finite number of vertex states and transitions depend on the number of neighbours in each state.

Our approach partitions the full Markov chain state space according to the number of vertices and edges in each possible state, and averages transition rates between partitions.

This yields density-dependent population processes that, in the limit of large system size, reduce to a low-dimensional system of ordinary differential equations.

We demonstrate the method on single graphs and graph ensembles, such as Erdős-Rényi random networks, and show that well-known edge-based mean-field approximations arise as special cases of our approach.

Our approximate lumping framework clarifies the nature of the averaging underlying mean-field approximations, providing a basis for future work on assessing their accuracy.