arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.4702cond-mat.stat-mechcs.SIphysics.soc-ph
收藏

谱扰动与复杂网络的重构

Spectral Perturbation and Reconstructability of Complex Networks

D. Liu, H. Wang, P. Van Mieghem

摘要:

近年来,许多网络扰动技术,如拓扑扰动和服务扰动,被用来研究和提高复杂网络的鲁棒性。然而,没有一种通用的方法来评估网络的鲁棒性。本文提出了一种新的网络全局性测度--重构系数θ,定义为在邻接矩阵能被精确重构的条件下,网络中能被去除的特征值的最大个数。我们的主要发现是,线性标度律E[θ]=aN似乎是普适的,因为它适用于我们研究过的所有网络。

英文摘要:

In recent years, many network perturbation techniques, such as topological perturbations and service perturbations, were employed to study and improve the robustness of complex networks. However, there is no general way to evaluate the network robustness. In this paper, we propose a new global measure for a network, the reconstructability coefficient θ, defined as the maximum number of eigenvalues that can be removed, subject to the condition that the adjacency matrix can be reconstructed exactly. Our main finding is that a linear scaling law, E[θ]=aN, seems universal, in that it holds for all networks that we have studied.

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

↑