Binary-state dynamics on complex networks: pair approximation and beyond
James P. Gleeson

TL;DR
This paper develops and compares pair approximation and approximate master equations for binary-state dynamics on networks, providing conditions for their equivalence, analyzing phase transitions, and simplifying models for threshold dynamics with practical code implementations.
Contribution
It establishes conditions under which pair approximation and AME solutions coincide, and simplifies AME for threshold models, advancing analytical tools for network dynamics analysis.
Findings
PA and AME solutions coincide under certain conditions.
Explicit bifurcation points for phase transitions are derived.
AME reduces to two equations for threshold models, matching simulations.
Abstract
A wide class of binary-state dynamics on networks---including, for example, the voter model, the Bass diffusion model, and threshold models---can be described in terms of transition rates (spin-flip probabilities) that depend on the number of nearest neighbors in each of the two possible states. High-accuracy approximations for the emergent dynamics of such models on uncorrelated, infinite networks are given by recently-developed compartmental models or approximate master equations (AME). Pair approximations (PA) and mean-field theories can be systematically derived from the AME. We show that PA and AME solutions can coincide under certain circumstances, and numerical simulations confirm that PA is highly accurate in these cases. For monotone dynamics (where transitions out of one nodal state are impossible, e.g., SI disease-spread or Bass diffusion), PA and AME give identical results…
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.
