The relationships between message passing, pairwise, Kermack-McKendrick and stochastic SIR epidemic models
Robert R. Wilkinson, Frank G. Ball, Kieran J. Sharkey

TL;DR
This paper develops a general stochastic SIR epidemic model on networks with correlated infectious periods and contact times, proving the existence of a unique message passing solution that bounds the expected epidemic size and connecting it to classical models.
Contribution
It introduces a novel message passing framework for correlated stochastic SIR models, proving solution uniqueness and establishing bounds and connections to classical epidemic models.
Findings
Message passing system has a unique feasible solution.
Cycles in the network inhibit epidemic spread.
Message passing converges to Kermack-McKendrick equations for large networks.
Abstract
We consider a very general stochastic model for an SIR epidemic on a network which allows an individual's infectious period, and the time it takes to contact each of its neighbours after becoming infected, to be correlated. We write down the message passing system of equations for this model and prove, for the first time, that it has a unique feasible solution. We also generalise an earlier result by proving that this solution provides a rigorous upper bound for the expected epidemic size (cumulative number of infection events) at any fixed time . We specialise these results to a homogeneous special case where the graph (network) is symmetric. The message passing system here reduces to just four equations. We prove that cycles in the network inhibit the spread of infection, and derive important epidemiological results concerning the final epidemic size and threshold behaviour for…
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.
