Beyond clustering: Mean-field dynamics on networks with arbitrary subgraph composition
Martin Ritchie, Luc Berthouze, Istvan Z. Kiss

TL;DR
This paper introduces a novel, automated mean-field modeling approach for networks with arbitrary subgraph compositions, enabling accurate epidemic dynamic predictions while controlling for traditional network metrics.
Contribution
It provides a general method to derive mean-field models for networks with non-fully connected subgraphs, expanding modeling capabilities beyond existing triangle-based approaches.
Findings
Higher-order structures significantly affect epidemic dynamics.
Networks with different subgraph compositions show distinct epidemic behaviors.
The method allows control over network metrics while varying subgraph structures.
Abstract
Clustering is the propensity of nodes that share a common neighbour to be connected. It is ubiquitous in many networks but poses many modelling challenges. Clustering typically manifests itself by a higher than expected frequency of triangles, and this has led to the principle of constructing networks from such building blocks. This approach has been generalised to networks being constructed from a set of more exotic subgraphs. As long as these are fully connected, it is then possible to derive mean-field models that approximate epidemic dynamics well. However, there are virtually no results for non-fully connected subgraphs. In this paper, we provide a general and automated approach to deriving a set of ordinary differential equations, or mean-field model, that describes, to a high degree of accuracy, the expected values of system-level quantities, such as the prevalence of infection.…
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.
