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

基于谱分析的网络鲁棒性关键节点分布式定位算法

Distributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis

Klaus Wehmuth, Artur Ziviani

摘要:

我们提出了一个算法来定位网络的鲁棒性最关键的节点。这些关键节点可以被认为是与网络中心性概念最相关的节点。我们的建议只依赖于一个有限的子网集中在网络中的每个节点的局部谱分析。我们还提出了一个程序,允许从任何节点的导航到一个关键节点以下的本地信息计算所提出的算法。实验结果证实了我们的建议的有效性,考虑不同规模和拓扑特征的网络。

英文摘要:

We propose an algorithm to locate the most critical nodes to network robustness. Such critical nodes may be thought of as those most related to the notion of network centrality. Our proposal relies only on a localized spectral analysis of a limited subnetwork centered at each node in the network. We also present a procedure allowing the navigation from any node towards a critical node following only local information computed by the proposed algorithm. Experimental results confirm the effectiveness of our proposal considering networks of different scales and topological characteristics.

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

↑