复杂网络上节点重要度的确定方法  

Determination method of node importance in complex networks

作　　者：张斌武[1] 邹森[2] 王勤[3] 

机构地区：[1]河海大学常州校区数理部,江苏常州213022 [2]河海大学常州校区物联网学院,江苏常州213022 [3]中国计量学院理学院,浙江杭州310018

出　　处：《兰州理工大学学报》2013年第3期85-87,共3页Journal of Lanzhou University of Technology

基　　金：国家自然科学基金(11171316);国家留学回国基金项目(BZX/11H002)

摘　　要：采用综合考虑节点的局部特性和全局特性的方法来评价复杂网络的节点重要度,给出基于邻域的节点重要度算法及基于关键域的节点重要度算法.前一种算法有效地降低了计算的复杂度;后一种算法能更有效地刻画节点的重要度且适用于加权图.然后通过实例验证两种算法的有效性.Node importance in complex networks was evaluated by taking comprehensively the local and global property of nodes into consideration. Two algorithms were given to determine the node importance： one was based on neighborhood and the other was based on key field. The former algorithm could be used to decrease the computational complexity efficiently and the latter efficiently characterize the node importance and suit to weighted graph. Finally, the validity of these two algorithms was verified by giving an example.

关 键 词：复杂网络 节点重要度 关键度 关键域 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]