Moving the epidemic tipping point through topologically targeted social distancing
Sara Ansari, Mehrnaz Anvari, Oskar Pfeffer, Nora Molkenthin, Frank, Hellmann, Jobst Heitzig, Juergen Kurths

TL;DR
This paper explores how targeted social distancing strategies, based on network eigenvalues, can effectively prevent epidemics by reducing the largest eigenvalue of social contact networks.
Contribution
It introduces a Markov chain Monte Carlo method to identify link removals that effectively lower the epidemic threshold in social networks.
Findings
Targeted link removal can be more efficient than random removal.
Networks in the well-controlling ensemble are more homogeneous.
80% targeted link removal matches 90% random removal effectiveness.
Abstract
The epidemic threshold of a social system is the ratio of infection and recovery rate above which a disease spreading in it becomes an epidemic. In the absence of pharmaceutical interventions (i.e. vaccines), the only way to control a given disease is to move this threshold by non-pharmaceutical interventions like social distancing, past the epidemic threshold corresponding to the disease, thereby tipping the system from epidemic into a non-epidemic regime. Modeling the disease as a spreading process on a social graph, social distancing can be modeled by removing some of the graphs links. It has been conjectured that the largest eigenvalue of the adjacency matrix of the resulting graph corresponds to the systems epidemic threshold. Here we use a Markov chain Monte Carlo (MCMC) method to study those link removals that do well at reducing the largest eigenvalue of the adjacency matrix.…
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.
