Hunting for vital nodes in complex networks using local information

被引:16
作者
Dong, Zhihao [1 ]
Chen, Yuanzhu [1 ]
Tricco, Terrence S. [1 ,2 ]
Li, Cheng [3 ]
Hu, Ting [4 ]
机构
[1] Mem Univ Newfoundland, Dept Comp Sci, St John, NF A1C 5S7, Canada
[2] Verafin Inc, St John, NF A1A 0L9, Canada
[3] Mem Univ Newfoundland, Dept Elect & Comp Engn, St John, NF A1C 5S7, Canada
[4] Queens Univ, Sch Comp, Kingston, ON K7L 3N6, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
IDENTIFYING INFLUENTIAL NODES; SOCIAL NETWORKS; SPREADERS; IDENTIFICATION; CENTRALITY;
D O I
10.1038/s41598-021-88692-9
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Complex networks in the real world are often with heterogeneous degree distributions. The structure and function of nodes can vary significantly, with vital nodes playing a crucial role in information spread and other spreading phenomena. Identifying and taking action on vital nodes enables change to the network's structure and function more efficiently. Previous work either redefines metrics used to measure the nodes' importance or focuses on developing algorithms to efficiently find vital nodes. These approaches typically rely on global knowledge of the network and assume that the structure of the network does not change over time, both of which are difficult to achieve in the real world. In this paper, we propose a localized strategy that can find vital nodes without global knowledge of the network. Our joint nomination (JN) strategy selects a random set of nodes along with a set of nodes connected to those nodes, and together they nominate the vital node set. Experiments are conducted on 12 network datasets that include synthetic and real-world networks, and undirected and directed networks. Results show that average degree of the identified node set is about 3-8 times higher than that of the full node set, and higher-degree nodes take larger proportions in the degree distribution of the identified vital node set. Removal of vital nodes increases the average shortest path length by 20-70% over the original network, or about 8-15% longer than the other decentralized strategies. Immunization based on JN is more efficient than other strategies, consuming around 12-40% less immunization resources to raise the epidemic threshold to tau similar to 0.1. Susceptible-infected-recovered simulations on networks with 30% vital nodes removed using JN delays the arrival time of infection peak significantly and reduce the total infection scale to 15%. The proposed strategy can effectively identify vital nodes using only local information and is feasible to implement in the real world to cope with time-critical scenarios such as the sudden outbreak of COVID-19.
引用
收藏
页数:13
相关论文
共 52 条
  • [1] [Anonymous], 2007, ACM T WEB, DOI [DOI 10.1145/1232722.1232727, 10.1145/1217299.1217301]
  • [2] Social networks and cooperation in hunter-gatherers
    Apicella, Coren L.
    Marlowe, Frank W.
    Fowler, James H.
    Christakis, Nicholas A.
    [J]. NATURE, 2012, 481 (7382) : 497 - U109
  • [3] Barabasi A.-L., 2016, Network Science
  • [4] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [5] Complex networks: Structure and dynamics
    Boccaletti, S.
    Latora, V.
    Moreno, Y.
    Chavez, M.
    Hwang, D. -U.
    [J]. PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5): : 175 - 308
  • [6] Identifying sets of key players in a social network
    Borgatti S.P.
    [J]. Computational & Mathematical Organization Theory, 2006, 12 (1) : 21 - 34
  • [7] The anatomy of a large-scale hypertextual Web search engine
    Brin, S
    Page, L
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7): : 107 - 117
  • [8] Epidemic thresholds in real networks
    Chakrabarti, Deepayan
    Wang, Yang
    Wang, Chenxi
    Leskovec, Jurij
    Faloutsos, Christos
    [J]. ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2008, 10 (04)
  • [9] Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering
    Chen, Duan-Bing
    Gao, Hui
    Lu, Linyuan
    Zhou, Tao
    [J]. PLOS ONE, 2013, 8 (10):
  • [10] Identifying influential nodes in complex networks
    Chen, Duanbing
    Lu, Linyuan
    Shang, Ming-Sheng
    Zhang, Yi-Cheng
    Zhou, Tao
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) : 1777 - 1787