中国物理B ›› 2020, Vol. 29 ›› Issue (4): 48902-048902.doi: 10.1088/1674-1056/ab77fe

• INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY • 上一篇    

Identifying influential spreaders in complex networks based on entropy weight method and gravity law

Xiao-Li Yan(闫小丽), Ya-Peng Cui(崔亚鹏), Shun-Jiang Ni(倪顺江)   

  1. 1 Institute of Public Safety Research, Tsinghua University, Beijing 100084, China;
    2 Department of Engineering Physics, Tsinghua University, Beijing 100084, China;
    3 Beijing Key Laboratory of City Integrated Emergency Response Science, Beijing 100084, China
  • 收稿日期:2019-11-21 修回日期:2020-01-30 出版日期:2020-04-05 发布日期:2020-04-05
  • 通讯作者: Shun-Jiang Ni E-mail:sjni@tsinghua.edu.cn
  • 基金资助:
    Project support by the National Key Research and Development Program of China (Grant No. 2018YFF0301000) and the National Natural Science Foundation of China (Grant Nos. 71673161 and 71790613).

Identifying influential spreaders in complex networks based on entropy weight method and gravity law

Xiao-Li Yan(闫小丽)1,2,3, Ya-Peng Cui(崔亚鹏)1,2,3, Shun-Jiang Ni(倪顺江)1,2,3   

  1. 1 Institute of Public Safety Research, Tsinghua University, Beijing 100084, China;
    2 Department of Engineering Physics, Tsinghua University, Beijing 100084, China;
    3 Beijing Key Laboratory of City Integrated Emergency Response Science, Beijing 100084, China
  • Received:2019-11-21 Revised:2020-01-30 Online:2020-04-05 Published:2020-04-05
  • Contact: Shun-Jiang Ni E-mail:sjni@tsinghua.edu.cn
  • Supported by:
    Project support by the National Key Research and Development Program of China (Grant No. 2018YFF0301000) and the National Natural Science Foundation of China (Grant Nos. 71673161 and 71790613).

摘要: In complex networks, identifying influential spreader is of great significance for improving the reliability of networks and ensuring the safe and effective operation of networks. Nowadays, it is widely used in power networks, aviation networks, computer networks, and social networks, and so on. Traditional centrality methods mainly include degree centrality, closeness centrality, betweenness centrality, eigenvector centrality, k-shell, etc. However, single centrality method is one-sided and inaccurate, and sometimes many nodes have the same centrality value, namely the same ranking result, which makes it difficult to distinguish between nodes. According to several classical methods of identifying influential nodes, in this paper we propose a novel method that is more full-scaled and universally applicable. Taken into account in this method are several aspects of node's properties, including local topological characteristics, central location of nodes, propagation characteristics, and properties of neighbor nodes. In view of the idea of the multi-attribute decision-making, we regard the basic centrality method as node's attribute and use the entropy weight method to weigh different attributes, and obtain node's combined centrality. Then, the combined centrality is applied to the gravity law to comprehensively identify influential nodes in networks. Finally, the classical susceptible-infected-recovered (SIR) model is used to simulate the epidemic spreading in six real-society networks. Our proposed method not only considers the four topological properties of nodes, but also emphasizes the influence of neighbor nodes from the aspect of gravity. It is proved that the new method can effectively overcome the disadvantages of single centrality method and increase the accuracy of identifying influential nodes, which is of great significance for monitoring and controlling the complex networks.

关键词: complex networks, influential nodes, entropy weight method, gravity law

Abstract: In complex networks, identifying influential spreader is of great significance for improving the reliability of networks and ensuring the safe and effective operation of networks. Nowadays, it is widely used in power networks, aviation networks, computer networks, and social networks, and so on. Traditional centrality methods mainly include degree centrality, closeness centrality, betweenness centrality, eigenvector centrality, k-shell, etc. However, single centrality method is one-sided and inaccurate, and sometimes many nodes have the same centrality value, namely the same ranking result, which makes it difficult to distinguish between nodes. According to several classical methods of identifying influential nodes, in this paper we propose a novel method that is more full-scaled and universally applicable. Taken into account in this method are several aspects of node's properties, including local topological characteristics, central location of nodes, propagation characteristics, and properties of neighbor nodes. In view of the idea of the multi-attribute decision-making, we regard the basic centrality method as node's attribute and use the entropy weight method to weigh different attributes, and obtain node's combined centrality. Then, the combined centrality is applied to the gravity law to comprehensively identify influential nodes in networks. Finally, the classical susceptible-infected-recovered (SIR) model is used to simulate the epidemic spreading in six real-society networks. Our proposed method not only considers the four topological properties of nodes, but also emphasizes the influence of neighbor nodes from the aspect of gravity. It is proved that the new method can effectively overcome the disadvantages of single centrality method and increase the accuracy of identifying influential nodes, which is of great significance for monitoring and controlling the complex networks.

Key words: complex networks, influential nodes, entropy weight method, gravity law

中图分类号:  (Networks and genealogical trees)

  • 89.75.Hc