Skip to main content
x

Switchover phenomenon induced by epidemic seeding on geometric networks

Authors Gergely Ódor, Domonkos Czifra, Júlia Komjáthy, László Lovász, Márton Karsai
Publication date 2021-10-12

It is a fundamental question in disease modeling how the initial seeding of an epidemic, spreading over a network, determines its final outcome. One important goal has been to find the seed configuration, which infects the most individuals. Although the identified optimal configurations give insight into how the initial state affects the outcome of an epidemic, they are unlikely to occur in real life. In this paper we identify two important seeding scenarios, both motivated by historical data, that reveal a complex phenomenon. In one scenario, the seeds are concentrated on the central nodes of a network, while in the second one, they are spread uniformly in the population. Comparing the final size of the epidemic started from these two initial conditions through data-driven and synthetic simulations on real and modeled geometric metapopulation networks, we find evidence for a switchover phenomenon: When the basic reproduction number  \(R_{0}\) is close to its critical value, more individuals become infected in the first seeding scenario, but for larger values of  \(R_{0}\), the second scenario is more dangerous. We find that the switchover phenomenon is amplified by the geometric nature of the underlying network and confirm our results via mathematically rigorous proofs, by mapping the network epidemic processes to bond percolation. Our results expand on the previous finding that, in the case of a single seed, the first scenario is always more dangerous and further our understanding of why the sizes of consecutive waves of a pandemic can differ even if their epidemic characters are similar.

Ódor et al. PNAS 12, 118 (41) e2112607118 (2021)
Authors
Gergely Ódor (Information and Network Dynamics Lab, École Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland)
Domonkos Czifra (Department of Combinatorics and its Applications, Alfréd Rényi Institute of Mathematics, H-1053 Budapest, Hungary)
Júlia Komjáthy (Department of Mathematics and Computer Science, Eindhoven University of Technology, NL-5612AZ Eindhoven, The Netherlands)
László Lovász (Department of Combinatorics and its Applications, Alfréd Rényi Institute of Mathematics, H-1053 Budapest, Hungary)
Márton Karsai (Department of Combinatorics and its Applications, Alfréd Rényi Institute of Mathematics, H-1053 Budapest, Hungary; Department of Network and Data Science, Central European University, A-1100 Vienna, Austria)