arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.09997physics.soc-ph
收藏

通过拓扑定向社交距离移动流行病临界点

Moving the epidemic tipping point through topologically targeted social distancing

Sara Ansari, Mehrnaz Anvari, Oskar Pfeffer, Nora Molkenthin, Frank Hellmann, Jobst Heitzig, Juergen Kurths

摘要:

一个社会系统的流行病阈值是一种疾病在其中传播成为流行病的感染率与恢复率之比。在没有药物干预(即疫苗)的情况下,控制特定疾病的唯一方法是通过非药物干预(如社交距离)来移动这一阈值,超过与疾病相对应的流行阈值,从而使系统从流行状态转变为非流行状态。将疾病建模为社交图上的传播过程,可以通过删除一些图链接来建模社交距离。它已被证明,最大的特征值的邻接矩阵的结果图对应于系统的流行阈值。在这里,我们使用马尔可夫链蒙特卡罗(MCMC)方法来研究那些在减少邻接矩阵的最大特征值方面做得很好的链接删除。MCMC方法从具有定义的期望值$λ_{max}$的相对正则网络系综生成样本。我们称之为“良好控制网络集成”(WCNE),并将其结构与具有相同链路密度的随机稀疏网络进行比较。我们观察到WCNE中的网络在度分布上倾向于更均匀,并使用这种见解来定义两个ad-hoc删除策略,这也大大减少了最大的特征值。有针对性地删除80%的链接与随机删除90%的链接一样有效,留下的联系人是原来的两倍。

英文摘要:

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. The MCMC method generates samples from the relative canonical network ensemble with a defined expectation value of $λ_{max}$. We call this the "well-controlling network ensemble" (WCNE) and compare its structure to randomly thinned networks with the same link density. We observe that networks in the WCNE tend to be more homogeneous in the degree distribution and use this insight to define two ad-hoc removal strategies, which also substantially reduce the largest eigenvalue. A targeted removal of 80\% of links can be as effective as a random removal of 90\%, leaving individuals with twice as many contacts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑