Identify influential spreaders in complex networks, the role of neighborhood

Abstract

Identifying the most influential spreaders is an important issue in controlling the spreading processes in complex networks. Centrality measures are used to rank node influence in a spreading dynamics. Here we propose a node influence measure based on the centrality of a node and its neighbors' centrality, which we call the neighborhood centrality. By simulating the spreading processes in six real-world networks, we find that the neighborhood centrality greatly outperforms the basic centrality of a node such as the degree and coreness in ranking node influence and identifying the most influential spreaders. Interestingly, we discover a saturation effect in considering the neighborhood of a node, which is not the case of the larger the better. Specifically speaking, considering the 2-step neighborhood of nodes is a good choice that balances the cost and performance. If further step of neighborhood is taken into consideration, there is no obvious improvement and even decrease in the ranking performance. The saturation effect may be informative for studies that make use of the local structure of a node to determine its importance in the network.

arXiv comment17 pages, 8 figures

References in corpus (22)

• The structure of scientific collaboration networks
• Identification of influential spreaders in complex networks
• Predicting Missing Links via Local Information
• Self-similar community structure in organisations
• Self-similarity of complex networks
• Influence maximization in complex networks through optimal percolation
• Leaders in Social Networks, the Delicious Case
• Epidemic outbreaks in complex heterogeneous networks
• Thresholds for epidemic spreading in networks
• An O(m) Algorithm for Cores Decomposition of Networks
• Origins of fractality in the growth of complex networks
• Identifying influential spreaders in complex networks based on gravity formula
• Searching for superspreaders of information in real-world social media
• Graph Evolution: Densification and Shrinking Diameters
• A k-shell decomposition method for weighted networks
• Spreading dynamics in complex networks
• Identifying Influential Spreaders by Weighted LeaderRank
• Understanding the spreading power of all nodes in a network: a continuous-time perspective
• A measure of individual role in collective dynamics
• Worldwide spreading of economic crisis
• Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: a walk counting approach
• Efficient community-based control strategies in adaptive networks

Cited by in corpus (12)

• Leveraging local h-index to identify and rank influential spreaders in networks
• Fast influencers in complex networks
• Identifying influential nodes based on fuzzy local dimension in complex networks
• Identifying an influential spreader from a single seed in complex networks via a message-passing approach
• Accurate ranking of influential spreaders in networks based on dynamically asymmetric link-impact
• Fundamental difference between superblockers and superspreaders in networks
• Top influencers can be identified universally by combining classical centralities
• Combined Centrality Measures for an Improved Characterization of Influence Spread in Social Networks
• EMH: Extended Mixing H-index centrality for identification important users in social networks based on neighborhood diversity
• Finding the proper node ranking method for complex networks
• Maximizing spreading influence via measuring influence overlap for social networks
• Measuring the influence of beliefs in belief networks