$k$-core percolation on complex networks: Comparing random, localized and targeted attacks
$k$-core percolation on complex networks: Comparing random, localized and targeted attacks
复制标题
DOI：
10.1103/physreve.93.062302
复制
发表时间：
2016-05
期刊：
影响因子：
--
通讯作者：
Xin Yuan;Yang Dai;H. Stanley;S. Havlin
中科院分区：
文献类型：
--
作者：
Xin Yuan;Yang Dai;H. Stanley;S. Havlin
恶意攻击的类型对网络的稳定性有很大的影响，在普通渗流中，当一个节点从巨分支断开时，它就会失效。在这里，我们研究它的推广，k-核心渗透，其中一个节点失败时，它失去了连接到阈值k个邻居。我们研究和比较分析，并通过数值模拟的k-核心渗流网络的稳定性下的随机攻击（RA），本地化攻击（LA）和有针对性的攻击（TA），分别。通过将LA或TA下的网络映射到RA下的等价网络，我们发现，在单个网络和相互依赖的网络中，TA对网络的核心结构的破坏最大。我们还发现，对于Erdens-Rényi（ER）网络，LA和RA对核心结构的破坏是相等的，而对于无标度（SF）网络，LA对核心结构的破坏要比RA大得多。
The type of malicious attack inflicting on networks greatly influences their stability under ordinary percolation in which a node fails when it becomes disconnected from the giant component. Here we study its generalization, k-core percolation, in which a node fails when it loses connection to a threshold k number of neighbors. We study and compare analytically and by numerical simulations of k-core percolation the stability of networks under random attacks (RA), localized attacks (LA) and targeted attacks (TA), respectively. By mapping a network under LA or TA into an equivalent network under RA, we find that in both single and interdependent networks, TA exerts the greatest damage to the core structure of a network. We also find that for Erdős-Rényi (ER) networks, LA and RA exert equal damage to the core structure, whereas for scale-free (SF) networks, LA exerts much more damage than RA does to the core structure.