Centre for Networks and Collective Behaviour, Department of Mathematical Sciences, University of Bath, Bath, England BA2 7AY, United Kingdom.
Phys Rev Lett. 2020 Feb 14;124(6):068301. doi: 10.1103/PhysRevLett.124.068301.
Global transport and communication networks enable information, ideas, and infectious diseases to now spread at speeds far beyond what has historically been possible. To effectively monitor, design, or intervene in such epidemic-like processes, there is a need to predict the speed of a particular contagion in a particular network, and to distinguish between nodes that are more likely to become infected sooner or later during an outbreak. Here, we study these quantities using a message-passing approach to derive simple and effective predictions that are validated against epidemic simulations on a variety of real-world networks with good agreement. In addition to individualized predictions for different nodes, we find an overall sudden transition from low density to almost full network saturation as the contagion progresses in time. Our theory is developed and explained in the setting of simple contagions on treelike networks, but we are also able to show how the method extends remarkably well to complex contagions and highly clustered networks.
全球交通和通信网络使信息、思想和传染病的传播速度远远超过了历史上可能达到的速度。为了有效地监测、设计或干预这种类似流行病的过程,需要预测特定传染病在特定网络中的传播速度,并区分在疫情爆发期间迟早更容易感染的节点。在这里,我们使用消息传递方法来研究这些数量,得出了简单有效的预测结果,并与各种具有良好一致性的真实网络上的流行病模拟进行了验证。除了对不同节点的个性化预测外,我们还发现,随着传染病的发展,在时间上会从低密度突然过渡到几乎完全网络饱和。我们的理论是在树状网络上的简单传染病背景下提出和解释的,但我们也能够展示该方法如何非常好地扩展到复杂传染病和高度聚类网络。