arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1305.0513cs.SIphysics.soc-ph
收藏

限制邻里:去小世界网络预防疫情

Limiting the Neighborhood: De-Small-World Network for Outbreak Prevention

Ruoming Jin, Yelong Shen, Lin Liu, Xue-wen Chen

摘要:

在这项工作中,我们研究了一个基本的和实际上重要的战略,以帮助预防和/或延迟在网络的背景下爆发:限制个人之间的接触。在本文中,我们引入了平均邻域大小作为衡量小世界程度的一个新的度量,并利用它来形式化地定义小世界网络问题。我们还证明了一般的可达对切割问题的NP-困难,并提出了一个贪婪的边缘介数为基础的方法作为基准,在选择候选边缘解决我们的问题。此外,我们将去小世界网络问题转化为一个或与布尔函数最大化问题,这也是一个NP难问题。此外,我们开发了一个数值松弛方法来解决布尔函数最大化和去小世界问题。此外,我们还引入了短介数,它测量距离不大于一定阈值的所有短路径的边缘重要性,并利用它来加快我们的数值松弛方法。实验结果表明了该方法的有效性和效率。

英文摘要:

In this work, we study a basic and practically important strategy to help prevent and/or delay an outbreak in the context of network: limiting the contact between individuals. In this paper, we introduce the average neighborhood size as a new measure for the degree of being small-world and utilize it to formally define the desmall- world network problem. We also prove the NP-hardness of the general reachable pair cut problem and propose a greedy edge betweenness based approach as the benchmark in selecting the candidate edges for solving our problem. Furthermore, we transform the de-small-world network problem as an OR-AND Boolean function maximization problem, which is also an NP-hardness problem. In addition, we develop a numerical relaxation approach to solve the Boolean function maximization and the de-small-world problem. Also, we introduce the short-betweenness, which measures the edge importance in terms of all short paths with distance no greater than a certain threshold, and utilize it to speed up our numerical relaxation approach. The experimental evaluation demonstrates the effectiveness and efficiency of our approaches.

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

↑