Establishing Herd Immunity is Hard Even in Simple Geometric Networks
Autoři
Rok
2023
Publikováno
Proceedings of the 18th Workshop on Algorithms and Models for the Web Graph. Cham: Springer, 2023. p. 68-82. Lecture Notes in Computer Science. vol. 13894. ISSN 0302-9743. ISBN 978-3-031-32295-2.
Typ
Stať ve sborníku
Pracoviště
Anotace
We study the following model of disease spread in a social network. In the beginning, all individuals are either ``infected'' or ``healthy''. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a healthy individual gets infected if and only if a sufficient number of its direct neighbours are already infected.
We represent the social network as a graph. Inspired by the real-world restrictions in the current epidemic, especially by social and physical distancing requirements, we restrict ourselves to networks that can be represented as geometric intersection graphs.
We show that finding a minimal vertex set of initially infected individuals to spread the disease in the whole network is computationally hard, already on unit disk graphs. Hence, to provide some algorithmic results, we focus ourselves on simpler geometric graph families, such as interval graphs and grid graphs.