期刊
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
卷 391, 期 4, 页码 1777-1787出版社
ELSEVIER
DOI: 10.1016/j.physa.2011.09.017
关键词
Complex networks; Centrality measures; Influential nodes; Spreading; SIR model
资金
- National Natural Science Foundation of China [90924011, 60903073]
- International Scientific Cooperation and Communication Project of Sichuan Province in China [2010HH0002]
- Swiss National Science Foundation [200020-132253]
Identifying influential nodes that lead to faster and wider spreading in complex networks is of theoretical and practical significance. The degree centrality method is very simple but of little relevance. Global metrics such as betweenness centrality and closeness centrality can better identify influential nodes, but are incapable to be applied in large-scale networks due to the computational complexity. In order to design an effective ranking method, we proposed a semi-local centrality measure as a tradeoff between the low-relevant degree centrality and other time-consuming measures. We use the Susceptible-Infected-Recovered (SIR) model to evaluate the performance by using the spreading rate and the number of infected nodes. Simulations on four real networks show that our method can well identify influential nodes. (C) 2011 Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据