期刊文献+

利用重要度评价矩阵确定复杂网络关键节点 被引量:128

Finding vital node by node importance evaluation matrix in complex networks
原文传递
导出
摘要 为了对复杂网络节点重要度进行评估,针对节点删除法、节点收缩法和介数法的不足,通过定义节点效率和节点重要度评价矩阵,提出了一种利用重要度评价矩阵来确定复杂网络关键节点的方法.该方法综合考虑了节点效率、节点度值和相邻节点的重要度贡献,用节点度值和效率值来表征其对相邻节点的重要度贡献,其优化算法的时间复杂度为O(Rn^2).实验分析表明该方法可行有效,对于大型复杂网络可以获得理想的计算能力. In order to evaluate the node importance in complex network, considering the disadvantages of node deletion method, node contraction method and betweenness method, through defining the node efficiency and the node importance evaluation matrix, a method to find the vital node in complex networks is proposed by using the node importance evaluation matrix. Considered in this method are the node efficiency, node degree and adjacent node importance contributions, and used adjacent node degree and efficiency value to characterize the contribution of their importance. Finally, an optimized algorithm whose time complexity was O(Rn2) is provided. Experiments show that this method is effective and feasible, and it is applicable to large scale complex networks.
出处 《物理学报》 SCIE EI CAS CSCD 北大核心 2012年第5期1-7,共7页 Acta Physica Sinica
关键词 复杂网络 关键节点 节点效率 重要度贡献 complex network, vital node, node efficiency, importance contribution
  • 相关文献

参考文献3

二级参考文献30

  • 1陈勇,胡爱群,胡啸.通信网中节点重要性的评价方法[J].通信学报,2004,25(8):129-134. 被引量:89
  • 2PAGE L, PERRY J. Reliability polynomials and links importance in networks[J]. IEEE Transactions on Reliability, 1994,43(1):51-58.
  • 3TRALDI L. Commentary on: reliability polynomials and links importance in networks[J]. IEEE Transactions on Reliability, 2000,49(3):322.
  • 4RAO V. Most-vital edge of a graph with respect to spanning trees[J]. IEEE Transactions on Reliability, 1998, 47(1):6-7.
  • 5NARDELLI E, PROIETTI G. WIDMAYER P. A faster computation of the most vital edge of a shortest path[J]. Information Processing Letters, 2001, 79(2):81-85.
  • 6CORLEY H, SHAD. Most vital links and nodes in weighted networks[J]. Operations Research Letters, 1982, 1(4): 157-160.
  • 7NARDELLI E, PROIETTI G. WIDMAYER P. Finding the most vital node of a shortest path[A]. COCOON 2001, LNCS 2108[C].Springer-Verlag, 2001.278-287.
  • 8SWAMY M, THULASIRAMAN K. Graphs, Networks, and Algorithms[M]. New York: John Wiley & Sons Inc,1981.
  • 9Corlcy H W, Sha D Y. Most vital links and nodes in weighted networks [J]. Oper Res Letters,1982(1):157-160.
  • 10Wu Jun, Tan Yuejin. Finding the most vital node by node contraction in communication networks[ C ]//Communications, Circuits and Systerms, Proceedings of IEEE International Conference. 2005,2 : 1282 - 1286.

共引文献321

同被引文献930

引证文献128

二级引证文献794

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部