Complete hierarchies of SIR models on arbitrary networks with exact and approximate moment closure
Kieran J Sharkey, Robert R Wilkinson

TL;DR
This paper develops a systematic framework for deriving exact and approximate moment closure models for SIR epidemic dynamics on arbitrary networks, extending previous work with new theorems, concepts, and hierarchies.
Contribution
It introduces a general theorem for exact closures, defines transmission blocks, and constructs hierarchies of approximate models for epidemic processes on networks.
Findings
Exact closure conditions depend on the largest transmission block size.
Hierarchies of approximate models include well-known models as special cases.
New explicit definitions for higher-order epidemic models on networks.
Abstract
We first generalise ideas discussed by Kiss et al. (2015) to prove a theorem for generating exact closures (here expressing joint probabilities in terms of their constituent marginal probabilities) for susceptible-infectious-removed (SIR) dynamics on arbitrary graphs (networks). For Poisson transmission and removal processes, this enables us to obtain a systematic reduction in the number of differential equations needed for an exact `moment closure' representation of the underlying stochastic model. We define `transmission blocks' as a possible extension of the block concept in graph theory and show that the order at which the exact moment closure representation is curtailed is the size of the largest transmission block. More generally, approximate closures of the hierarchy of moment equations for these dynamics are typically defined for the first and second order yielding mean-field…
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.
