首页 | 本学科首页   官方微博 | 高级检索  
     检索      

An Average Edge Distance Contribution Method for Identifying Influential Nodes in Complex Networks
作者姓名:谭哲伦  喻祖国
摘    要:How to accurately and effectively identify the influential nodes in networks has always been a core issue. In order to evaluate the importance of the nodes, some famous centrality measures have been proposed and widely used. However, the existing methods still exist some shortcomings. In this work, a novel method named average edge distance contribution (AEDC) is proposed to effectively find the influential nodes, which measures the average contribution of each edge to the sum of distances of all node pairs in the network. For each node, we utilize the relative change of AEDC by removing it from the network to determine its influence. For verifying the effectiveness and feasibility of the AEDC method, we simulate the process of disease spreading in four real complex networks with the Susceptible Infected Recovered (SIR) model. The experimental results show that our proposed method is more accurate than several benchmark centrality measures in terms of identifying the influential nodes.

关 键 词:complex  networks    influential  nodes    average  edge  distance  contribution    Kendall’s  tau  coefficient
点击此处可从《湘潭大学自然科学学报》浏览原始摘要信息
点击此处可从《湘潭大学自然科学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号