Research on Centrality of Node Importance in Scale-free Complex Networks

作     者：WU Xuguang~1 ZHANG Minqing~(1 2) HAN Yiliang~1 1.Key Laboratory of Network & Information Security of CAPF Engineering University of CAPF 2.School of Computer Science and Engineering Northwestern Polytechnical University Xi’an Shaanxi China 

会议名称：《第三十一届中国控制会议》

会议日期：2012年

学科分类：0711[理学-系统科学] 07[理学] 08[工学] 081101[工学-控制理论与控制工程] 0811[工学-控制科学与工程] 071102[理学-系统分析与集成] 081103[工学-系统工程] 

基　　金：supported by National Natural Science Foundation(NNSF) of China under Grant 61103231 Natural Science Basic Research Plan in Shannxi Province of China under Grant 2011JM8012 

关 键 词：Scale-free complex networks node importance factor analysis 

摘      要：正It is a basic issue to assess each node importance in complex *** algorithms are developed to research centralities,for instance degree,betweenness,closeness,eigenvector and eccentricity,which are from different *** the relationships among different centrality are not paid enough *** this paper,we try to explore the relationships of multiple centralities with factor *** BA networks with number of nodes arrange from 5000 to 10000 and a true network---Internet are *** results show that the widely used five centralities in scale-free complex networks are divided to two classes:1) degree,betweenness and eigenvector that mainly reflect the node influences with others;2) closeness and eccentricity related to network *** these analysis results can be used in the objective and accurate assessment of node importance.