arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.08787cs.SI
收藏

节点失效下复杂网络聚类的脆弱性

Vulnerability of Clustering under Node Failure in Complex Networks

Alan Kuhnle, Nam P. Nguyen, Thang N. Dinh, My T. Thai

摘要:

对于现实世界的网络来说,响应于意外事件的鲁棒性总是令人期望的。为了提高任何网络系统的鲁棒性,重要的是要分析外部扰动的脆弱性,如随机故障或对抗攻击发生在网络的元素。在本文中,我们研究了一个新出现的问题,在评估复杂网络的鲁棒性:脆弱性的聚类网络元件的故障。具体来说,我们确定顶点的故障将严重损害网络,通过降低其聚类,通过平均聚类系数进行评估。这个问题很重要,因为对聚类进行的任何重大更改(由元素故障引起)都可能降低网络性能,例如信息在社交网络中传播的能力。我们制定这个脆弱性分析作为一个优化问题,证明其NP-完全性和非单调性,我们提供了两个算法来确定最重要的聚类顶点。最后,我们在由各种知名模型生成的合成社交网络以及真实社交网络的痕迹中进行综合实验。与其他竞争策略的实验结果表明了我们所提出的算法的有效性。

英文摘要:

Robustness in response to unexpected events is always desirable for real-world networks. To improve the robustness of any networked system, it is important to analyze vulnerability to external perturbation such as random failures or adversarial attacks occurring to elements of the network. In this paper, we study an emerging problem in assessing the robustness of complex networks: the vulnerability of the clustering of the network to the failure of network elements. Specifically, we identify vertices whose failures will critically damage the network by degrading its clustering, evaluated through the average clustering coefficient. This problem is important because any significant change made to the clustering, resulting from element-wise failures, could degrade network performance such as the ability for information to propagate in a social network. We formulate this vulnerability analysis as an optimization problem, prove its NP-completeness and non-monotonicity, and we offer two algorithms to identify the vertices most important to clustering. Finally, we conduct comprehensive experiments in synthesized social networks generated by various well-known models as well as traces of real social networks. The empirical results over other competitive strategies show the efficacy of our proposed algorithms.

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

↑