Maximizing spreading in complex networks with risk in node activation
arXiv:2104.06986
Abstract
It is widely acknowledged that the initial spreaders play an important role for the wide spreading of information in complex networks. Thus, a variety of centrality-based methods have been proposed to identify the most influential spreaders. However, most of the existing studies have overlooked the fact that in real social networks it is more costly and difficult to convince influential individuals to act as initial spreaders, resulting in a high risk in maximizing the spreading. In this paper, we address this problem on the basis of the assumption that large-degree nodes are activated with a higher risk than small-degree nodes. We aim to identify the effective initial spreaders to maximize spreading when considering both the activation risk and the outbreak size of initial spreaders. On random networks, the analytical analysis reveals that the degree of optimal initial spreaders does not correspond to the largest degree of nodes in the network but rather be determined by infection probability and difference of activation risk among nodes with different degree. Here, we propose a risk-aware metric to identify the effective spreaders on real networks. The numerical simulation shows that the risk-aware metric outperforms the existing benchmark centralities in maximizing the effective spreading.
arXiv comment26 pages,9 figures
References in corpus (16)
- Lethality and centrality in protein networks
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- Epidemic processes in complex networks
- Random graphs with arbitrary degree distributions and their applications
- The spread of epidemic disease on networks
- Identification of influential spreaders in complex networks
- Immunization of complex networks
- Subgraph Centrality in Complex Networks
- Influence maximization in complex networks through optimal percolation
- Spectral redemption: clustering sparse networks
- Ranking spreaders by decomposing complex networks
- Localization and centrality in networks
- Leveraging percolation theory to single out influential spreaders in networks
- Fast influencers in complex networks
- Systematic comparison between methods for the detection of influential spreaders in complex networks