计算物理 ›› 2013, Vol. 30 ›› Issue (5): 714-719.

• 论文 • 上一篇    下一篇

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

范文礼, 刘志刚   

  1. 西南交通大学电气工程学院, 四川 成都 610031
  • 收稿日期:2012-10-31 修回日期:2013-01-27 出版日期:2013-09-25 发布日期:2013-09-25
  • 作者简介:范文礼(1980-),男,博士生,主要研究方向为复杂网络理论在电力系统中的应用,E-mail:fanwenlihp@163.com
  • 基金资助:
    国家自然科学基金(U1134205,51007074);教育部新世纪优秀人才支持计划(NECT-08-0825);中央高校基本科研业务费专项资金(SWJTU11CX141)资助项目

An Evaluation Method for Node Importance Based on Efficiency Matrix

FAN Wenli, LIU Zhigang   

  1. School of Electrical Engineering, Southwest Jiaotong University, Chengdu 610031, China
  • Received:2012-10-31 Revised:2013-01-27 Online:2013-09-25 Published:2013-09-25

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

关键词: 复杂网络, 效率矩阵, 重要度贡献, 节点度

Abstract: 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.

Key words: complex networks, efficiency matrix, importance contribution, degree

中图分类号: