Hunting for vital nodes in complex networks using local information

Dong, Zhihao and Tricco, Terrence S. (Terrence Stansilaus) and Li, Cheng and Hu, Ting and Chen, Yuanzhu (2021) Hunting for vital nodes in complex networks using local information. Scientific Reports, 11. ISSN 2045-2322

[img] [English] PDF - Published Version
Available under License Creative Commons Attribution Non-commercial.

Download (4MB)

Abstract

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 τ∼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.

Item Type: Article
URI: http://research.library.mun.ca/id/eprint/15378
Item ID: 15378
Additional Information: Memorial University Open Access Author's Fund
Department(s): Science, Faculty of > Computer Science
Date: 28 April 2021
Date Type: Publication
Digital Object Identifier (DOI): https://doi.org/10.1038/s41598-021-88692-9
Related URLs:

Actions (login required)

View Item View Item

Downloads

Downloads per month over the past year

View more statistics