Mean-field models of dynamics on networks via moment closure: an automated procedure

Abstract

In the study of dynamics on networks, moment closure is a commonly used method to obtain low-dimensional evolution equations amenable to analysis. The variables in the evolution equations are mean counts of subgraph states and are referred to as moments. Due to interaction between neighbours, each moment equation is a function of higher-order moments, such that an infinite hierarchy of equations arises. Hence, the derivation requires truncation at a given order, and, an approximation of the highest-order moments in terms of lower-order ones,known as a closure formula. Recent systematic approximations have either restricted focus to closed moment equations for SIR epidemic spreading or to unclosed moment equations for arbitrary dynamics. In this paper, we develop a general procedure that automates both derivation and closure of arbitrary order moment equations for dynamics with nearest-neighbour interactions on undirected networks. Automation of the closure step was made possible by our generalised closure scheme,which systematically decomposes the largest subgraphs into their smaller components.We show that this decomposition is exact if these components form a tree, there is independence at distances beyond their graph diameter, and there is spatial homogeneity. Testing our method for SIS epidemic spreading on lattices and random networks confirms that biases are larger for networks with many short cycles in regimes with long-range dependence. A Mathematica package that automates the moment closure is available for download.

References in corpus (19)

• Networks beyond pairwise interactions: structure and dynamics
• Epidemic dynamics on an adaptive network
• Phase transitions and volunteering in spatial public goods games
• A message passing approach for general epidemic models
• Adaptive networks: coevolution of disease and topology
• Binary-state dynamics on complex networks: pair approximation and beyond
• Controlling unstable chaos: Stabilizing chimera states by feedback
• Moment Closure - A Brief Review
• Experimental continuation of periodic orbits through a fold
• Robust oscillations in SIS epidemics on adaptive networks: Coarse-graining by automated moment closure
• Analytical calculation of fragmentation transitions in adaptive networks
• Systematic experimental exploration of bifurcations with non-invasive control
• Control-based continuation: bifurcation and stability analysis for physical experiments
• Master equation analysis of mesoscopic localization in contagion dynamics on higher-order networks
• Exact equations for SIR epidemics on tree graphs
• Maximum-entropy moment-closure for stochastic systems on networks
• Contact-based model for epidemic spreading on temporal networks
• Message passing and moment closure for susceptible-infected-recovered epidemics on finite networks
• Complete hierarchies of SIR models on arbitrary networks with exact and approximate moment closure

Cited by in corpus (3)

• Polyadic Opinion Formation: The Adaptive Voter Model on a Hypergraph
• Preserving Bifurcations through Moment Closures
• Phase transitions for polyadic epidemic and voter models with multiscale groups