arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1011.0126cs.NIstat.AP
收藏

使用拓扑特征评估复杂网络模型可能会产生误导

Using topological characteristics to evaluate complex network models can be misleading

Zhengping Fan, Guanrong Chen, Yunong Zhang

摘要:

图形模型经常被用来表示各种复杂网络的拓扑结构。目前评估网络不同模型的标准主要依赖于模型在拓扑特征方面与网络的匹配程度。典型的拓扑度量有聚类系数、距离分布、邻接矩阵的最大特征值以及第一和第二大特征值之间的间隙,它们被广泛用于评估和比较网络的不同模型。在本文中,我们表明,评估复杂的网络模型的基础上,目前的拓扑度量可能是相当误导。以几个模型的AS级互联网为例,我们表明,虽然一个模型似乎是很好的描述互联网的上述拓扑特征,这是远远不现实的表现,如鲁棒性,在抵御故意攻击和流量负载分布代表真正的互联网。我们进一步表明,它是没有用的评估网络模型,通过检查一些拓扑特征,如聚类系数和距离分布,如果互联网对随机节点删除的鲁棒性是唯一的关注。我们的发现为如何合理评估网络的不同模型提供了新的思路,不仅是互联网,还有其他类型的复杂网络。

英文摘要:

Graphical models are frequently used to represent topological structures of various complex networks. Current criteria to assess different models of a network mainly rely on how close a model matches the network in terms of topological characteristics. Typical topological metrics are clustering coefficient, distance distribution, the largest eigenvalue of the adjacency matrix, and the gap between the first and the second largest eigenvalues, which are widely used to evaluate and compare different models of a network. In this paper, we show that evaluating complex network models based on the current topological metrics can be quite misleading. Taking several models of the AS-level Internet as examples, we show that although a model seems to be good to describe the Internet in terms of the aforementioned topological characteristics, it is far from being realistic to represent the real Internet in performances such as robustness in resisting intentional attacks and traffic load distributions. We further show that it is not useful to assess network models by examining some topological characteristics such as clustering coefficient and distance distribution, if robustness of the Internet against random node removals is the only concern. Our findings shed new lights on how to reasonably evaluate different models of a network, not only the Internet but also other types of complex networks.

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

↑