首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于传输效率矩阵的复杂网络节点重要度排序方法
引用本文:范文礼,刘志刚.基于传输效率矩阵的复杂网络节点重要度排序方法[J].西南交通大学学报,2014,27(2):337-342.
作者姓名:范文礼  刘志刚
基金项目:国家自然科学基金资助项目(U1134205,51007074,51377136)教育部新世纪优秀人才支持计划资助项目(NECT-08-0825)中央高校基本科研业务费专项资金资助项目(SWJTU11CX141)
摘    要:为了提高网络节点重要度评估的准确性,应用复杂网络理论,通过分析非邻接节点对节点重要度评估产生的重要影响,提出了一种基于网络传输效率矩阵的节点重要度排序方法.该方法综合了节点的局部重要性和全局重要性,弥补了节点重要度贡献只依赖于邻接节点的不足.在ARPA网络上对连续移除重要节点的连锁故障进行了仿真.结果表明,相比于节点重要度评价矩阵法,采用本文方法在移除最重要的2个节点后网络的最大连通子图规模降低了23.8%,该结果进一步验证了本文方法的准确性. 

关 键 词:复杂网络    效率矩阵    重要度贡献    节点度
收稿时间:2012-12-13

Ranking Method for Node Importance Based on Efficiency Matrix
FAN Wenli,LIU Zhigang.Ranking Method for Node Importance Based on Efficiency Matrix[J].Journal of Southwest Jiaotong University,2014,27(2):337-342.
Authors:FAN Wenli  LIU Zhigang
Abstract:In order to improve the accuracy of the node importance evaluation in complex networks, a novel evaluation method based on efficiency matrix was proposed through analysis of the impact of non-adjacent nodes on the node importance evaluation by using the complex network theory. This method combined both the local and global node importance comprehensively, and overcame the limitations of depending on just the adjacent nodes in the node importance evaluation. The cascading failures by removing important nodes on the ARPA network show that when the top 2 important nodes are removed, the size of the biggest subgraph based on the proposed method falls by 23.8% compared with that based on the node importance evaluation method, which further verifies the accuracy of the proposed method. 
Keywords:
本文献已被 CNKI 等数据库收录!
点击此处可从《西南交通大学学报》浏览原始摘要信息
点击此处可从《西南交通大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号