摘要： 提出一种定量评估复杂网络节点重要度的算法，定义虚拟的理想“核心节点”，将灰色关联度作为测度，评价网络中每个节点和理想“核心节点”的关联度，关联度越高，节点在网络中的重要性越大。仿真结果表明，与同类算法相比，该算法运算速度更快，适用于评价大型复杂网络中节点的重要度。
关键词:
complex networks,
gray relation analysis,
relation coefficient,
node importance,
scale-free
Abstract: This paper applies the gray relation analysis theory to the ascertain of the node importance of complex network, and defines suppositional perfect “kernel node”. It takes the gray correlation degree as measure to evaluate the correlation degree of every node of the network and the perfect “kernel node”, more correlation degree more important in the network. Simulation results show the algorithm is effective, and its operation speed is fast. It can get perfect calculation capability in large-sized complex network.
Key words:
complex networks,
gray relation analysis,
relation coefficient,
node importance,
scale-free
中图分类号:
张益. 一种定量评估复杂网络节点重要度的算法[J]. 计算机工程, 2011, 37(20): 87-88.
ZHANG Yi. Quantitative Evaluation Algorithm for Node Importance of Complex Networks[J]. Computer Engineering, 2011, 37(20): 87-88.