Robustness envelopes of networks
Robustness envelopes of networks
复制标题
DOI：
10.1093/comnet/cnt004
复制
发表时间：
2013-06-01
影响因子：
2.1
通讯作者：
Van Mieghem, Piet
中科院分区：
文献类型：
--
作者：
Trajanovski, Stojan;Martin-Hernandez, Javier;Van Mieghem, Piet
我们研究了节点删除下的网络鲁棒性，考虑随机节点故障，以及有针对性的节点攻击网络中心性措施的基础上。虽然这两种方法都在文献中进行了研究，但现有的方法倾向于研究平均情况下的行为的随机故障，没有考虑到网络性能纯粹是偶然下降的严重程度。而不是考虑随机故障下的平均网络性能，我们计算近似的网络性能的概率密度函数删除的节点的分数的函数。我们发现，有针对性的攻击的中心性措施的基础上给出了一个很好的指示网络的最坏情况下的行为。我们发现，许多中心性措施产生类似的有针对性的攻击，度中心性和特征向量中心性的组合可能足以评估网络的最坏情况下的行为。最后，我们研究了网络的鲁棒性包络和有针对性的攻击响应，重新布线具有高和低程度的非线性，发现适度的非线性增加赋予更多的鲁棒性对有针对性的攻击，而适度的降低赋予更多的鲁棒性对随机均匀攻击。
We study the robustness of networks under node removal, considering random node failure, as well as targeted node attacks based on network centrality measures. Whilst both of these have been studied in the literature, existing approaches tend to study random failure in terms of average-case behavior, giving no idea of how badly network performance can degrade purely by chance. Instead of considering average network performance under random failure, we compute approximate network performance probability density functions as functions of the fraction of nodes removed. We find that targeted attacks based on centrality measures give a good indication of the worst-case behavior of a network. We show that many centrality measures produce similar targeted attacks and that a combination of degree centrality and eigenvector centrality may be enough to evaluate worst-case behavior of networks. Finally, we study the robustness envelope and targeted attack responses of networks that are rewired to have high-and low-degree assortativities, discovering that moderate assortativity increases confer more robustness against targeted attacks whilst moderate decreases confer more robustness against random uniform attacks.