Modeling epidemics on d-cliqued graphs
Laura P. Schaposnik, Anlin Zhang

TL;DR
This paper introduces a new epidemic modeling framework using d-cliqued tree graphs to better represent symmetric social clusters like families or classrooms, and analyzes how infections spread and identifies safe zones.
Contribution
It generalizes existing d-ary tree models to d-cliqued trees, capturing symmetric social structures and providing insights into infection pathways and safe zones.
Findings
Infection can spread from a clique to other parts of the network.
Safe zones with negligible infection probability can be identified.
The model better reflects real-world social clusters in epidemic spread.
Abstract
Since social interactions have been shown to lead to symmetric clusters, we propose here that symmetries play a key role in epidemic modeling. Mathematical models on d-ary tree graphs were recently shown to be particularly effective for modeling epidemics in simple networks [Seibold & Callender, 2016]. To account for symmetric relations, we generalize this to a new type of networks modeled on d-cliqued tree graphs, which are obtained by adding edges to regular d-trees to form d-cliques. This setting gives a more realistic model for epidemic outbreaks originating, for example, within a family or classroom and which could reach a population by transmission via children in schools. Specifically, we quantify how an infection starting in a clique (e.g. family) can reach other cliques through the body of the graph (e.g. public places). Moreover, we propose and study the notion of a safe zone,…
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.
