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

摘要：

It is a basic issue to assess each node importance in complex networks. Many algorithms are developed to research centralities, for instance degree, betweenness, closeness, eigenvector and eccentricity, which are from different angles. However the relationships among different centrality are not paid enough attention. In this paper, we try to explore the relationships of multiple centralities with factor analysis. The BA networks with number of nodes arrange from 5000 to 10000 and a true network---Internet are excavated. Experiment 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 topology. Furthermore these analysis results can be used in the objective and accurate assessment of node importance.

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

作者: WU Xuguang ZHANG Minqing HAN Yiliang

作者单位: Key Laboratory of Network & Information Security of CAPF, Engineering University of CAPF Key Laboratory of Network & Information Security of CAPF, Engineering University of CAPF School of C

会议类型: 国际会议

会议名称: The 31st Chinese Control Conference(第三十一届中国控制会议)

会议地点: 合肥

会议语种:英文

页码: 1073-1077

在线出版日期: 2012-07-01（万方平台首次上网日期，不代表论文的发表时间）