复杂网络中节点重要度评估  

Evaluation of Node Importance in Complex Networks

作　　者：陈静[1] 孙林夫[1] 

机构地区：[1]西南交通大学CAD工程中心,四川成都610031

出　　处：《西南交通大学学报》2009年第3期426-429,共4页Journal of Southwest Jiaotong University

基　　金：国家863计划资助项目(2007AA04Z188);四川省科技计划项目(2008GZ0007)

摘　　要：为提高复杂网络中重要节点评估的效率和有效性,提出了一种基于节点接近度和节点在其邻域中的关键度评估复杂网络中节点重要度的方法.该方法综合了节点的全局和局部重要性,即在复杂网络中,节点的接近度越大,该节点越居于网络的中心,在网络中就越重要;节点在其邻域中的关键度越大,该节点对其邻域越重要.根据该方法设计了复杂网络中节点重要度评估算法,该算法的复杂度为O(n3).实例分析证明了该方法的有效性.To improve the efficiency and validity of node importance evaluating, a new evaluation method for node importance in complex networks was proposed based on node closeness and node key degree in its neighborhood. In this method, the global importance and the local importance of nodes are combined. The basic thought of the method is that the bigger the closeness of a node is, the closer to center of a complex network the node is and the more important it is; the bigger the key degree of a node in its neighborhood is, the more important in the neighborhood the node is. An evaluation algorithm corresponding to the method was designed. This algorithm has a time complexity of 0 （n^3）. Finally, the validity of the proposed method was verified by experiments.

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

分 类 号：O233[理学—运筹学与控制论]