一种基于效率矩阵的网络节点重要度评价算法

An Evaluation Method for Node Importance Based on Efficiency Matrix

为了实现对网络节点重要性的有效评价,提出一种基于网络效率矩阵的节点重要度评价算法.该方法综合考虑节点的度值(局部重要度)和网络节点之间的重要性贡献(全局重要度),利用节点的度和效率矩阵表征网络节点的重要度贡献,克服重要性贡献矩阵法中节点只依赖于邻接节点的不足.考虑实际网络的稀疏性,该算法的时间复杂度为O(n2).通过算例分析验证了该算法的可行性和有效性,结果表明:该算法能够更加直观、简单有效地区分节点的重要度差异,并且对于大型复杂网络具有较理想的计算能力.

In order to evaluate network nodes importance effectively, an evaluation method based on efficiency matrix is proposed. Based on node degree and contribution of network node importance comprehensively, the method uses node degree and efficiency matrix to characterize their importance, and to solve deficiency of node＇ s dependence on adjacent nodes only in the method of node importance contribution matrix. Taking actual network sparsity into account,the algorithm has time complexity of O（n2）. Finally, feasibility and validity of the algorithm are demonstrated with numerical example analysis. It shows that the method distinguishes node importance differences more directly, simply and effectively. It obtains ideal computing power for large scale complex networks.