arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.08421physics.soc-phcond-mat.dis-nn
收藏

高度适应集体影响渗流的临界行为

Critical behaviors of high-degree adaptive and collective-influence percolation

Jung-Ho Kim, Soo-Jeong Kim, K. -I. Goh

摘要:

网络中的巨型组件如何在攻击节点或链路下消失,这是网络鲁棒性的一个关键方面,可以将其定义为渗流问题。在文献中已经研究了选择要停用的节点的各种策略;例如,简单的随机故障或高度自适应(HDA)渗流。最近,一种新的攻击策略的基础上的数量称为集体影响(CI)已被提出的最佳渗流的角度。通过连续停用具有最大CI中心性值的节点,它被证明能够比许多现有方法更快速和突然地拆除网络。本文主要研究了随机网络上基于度攻击和基于CI攻击的渗流过程的临界行为。通过广泛的蒙特卡罗模拟辅助数值解,我们估计了HDA渗流和CI方程的各种临界指数。我们的研究结果表明,这些攻击型逾渗过程,尽管显示明显更突然的崩溃,但表现出标准的平均场临界行为的逾渗过渡点。我们进一步发现在两个过程中的顶中心节点都存在广泛的简并性,这可能为理解观察到的结果提供线索

英文摘要:

How the giant component of a network disappears under attacking nodes or links addresses a key aspect of network robustness, which can be framed into percolation problems. Various strategies to select the node to be deactivated have been studied in the literature; for instance, a simple random failure or high-degree adaptive (HDA) percolation. Recently a new attack strategy based on a quantity called collective-influence (CI) has been proposed from the perspective of optimal percolation. By successively deactivating the node having the largest CI-centrality value, it was shown to be able to dismantle a network more quickly and abruptly than many of the existing methods. In this paper, we focus on the critical behaviors of the percolation processes following degree-based attack and CI-based attack on random networks. Through extensive Monte Carlo simulations assisted by numerical solutions, we estimate various critical exponents of the HDA percolation and those of the CI percolations. Our results show that these attack-type percolation processes, despite displaying apparently more abrupt collapse, nevertheless exhibit standard mean-field critical behaviors at the percolation transition point. We further discover an extensive degeneracy in top-centrality nodes in both processes, which may provide a hint for understanding the observed results

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

↑