Ranking Hubs in Weighted Networks with Node Centrality and Statistics
Hubs is a type of important nodes in complex networks and always play an influential or prominent roles in real networks.Node centrality of networks is an important measure and usually was used to detect hubs.Although many approaches to calculate node centrality are available,but node centrality of weighted complex networks need further investigation.In this paper,we develop a novel algorithm that works well for identifying hubs in weighted networks with node centrality.Our algorithm calculates a scores of node centrality of each candidate hub which was estimated with a statistic.We demonstrate that detected hubs by using this statistic is more reliable and interpretable than only with weighted node centrality.
Complex networks Network hubs Weighted networks Node centrality
Yan Zhu Haitao Ma
School of Information Science and Engineering Yanshan University Qinhuangdao, China 066004 College of Information Science and Engineering Northeastern University Shenyang, China 110819
国际会议
秦皇岛
英文
744-747
2015-09-18（万方平台首次上网日期，不代表论文的发表时间）