Switchover phenomenon induced by epidemic seeding on geometric networks

Abstract

It is a fundamental question in disease modelling how the initial seeding of an epidemic, spreading over a network, determines its final outcome. Research in this topic has primarily concentrated on finding the seed configuration which infects the most individuals. Although these 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 new complex phenomenon. In one scenario, the seeds are concentrated on the central nodes of a network, while in the second, 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 modelled 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 case of a single seed, the first scenario is always more dangerous, and further our understanding why the sizes of consecutive waves can differ even if their epidemic characters are similar.

arXiv comment29 pages, 6 figures

References in corpus (18)

• Epidemic processes in complex networks
• Random graphs with arbitrary degree distributions and their applications
• Identification of influential spreaders in complex networks
• Reaction-diffusion processes and metapopulation models in heterogeneous networks
• New Model of Internet Topology Using k-shell Decomposition
• MEDUSA - New Model of Internet Topology Using k-shell Decomposition
• Invasion threshold in heterogeneous metapopulation networks
• Percolation Critical Exponents in Scale-Free Networks
• On the scaling of the chemical distance in long-range percolation models
• Uncovering disassortativity in large scale-free networks
• Degree-degree correlations in random graphs with heavy-tailed degrees
• Epidemic variability in complex networks
• Novel scaling limits for critical inhomogeneous random graphs
• Critical window for the configuration model: finite third moment degrees
• Arrival Time Statistics in Global Disease Spread
• Heavy-tailed configuration models at criticality
• Average Distance in a General Class of Scale-Free Networks with Underlying Geometry
• Phase transitions of extremal cuts for the configuration model

Cited by in corpus (3)

• Controlling epidemics through optimal allocation of test kits and vaccine doses across networks
• Impact of random and targeted disruptions on information diffusion during outbreaks
• A high-frequency mobility big-data reveals how COVID-19 spread across professions, locations and age groups