Exact and approximate moment closures for non-Markovian network epidemics
Lorenzo Pellis, Thomas House, Matt J. Keeling

TL;DR
This paper analyzes the accuracy of moment-closure techniques, including a new maximum entropy-based approach, for modeling epidemic spread on networks, considering both Markovian and non-Markovian assumptions and various network structures.
Contribution
It provides a rigorous examination of common and new moment closures, including analytical results and conditions for exactness in epidemic network models.
Findings
Pair-based closure is exact for Markovian SIR on trees with pure initial conditions.
Maximum entropy closure offers improved approximation of triplet probabilities.
Exactness conditions are extended to non-Markovian models with specific assumptions.
Abstract
Moment-closure techniques are commonly used to generate low-dimensional deterministic models to approximate the average dynamics of stochastic systems on networks. The quality of such closures is usually difficult to asses and the relationship between model assumptions and closure accuracy are often difficult, if not impossible, to quantify. Here we carefully examine some commonly used moment closures, in particular a new one based on the concept of maximum entropy, for approximating the spread of epidemics on networks by reconstructing the probability distributions over triplets based on those over pairs. We consider various models (SI, SIR, SEIR and Reed-Frost-type) under Markovian and non-Markovian assumption characterising the latent and infectious periods. We initially study two special networks, namely the open triplet and closed triangle, for which we can obtain analytical…
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.
