Fast asynchronous updating algorithms for k-shell indices
arXiv:1612.07277 · doi:10.1016/j.physa.2017.04.088
Abstract
Identifying influential nodes in networks is a significant and challenging task. Among many centrality indices, the -shell index performs very well in finding out influential spreaders. However, the traditional method for calculating the -shell indices of nodes needs the global topological information, which limits its applications in large-scale dynamically growing networks. Recently, L\@ü \emph{et al.} [Nature Communications 7 (2016) 10168] proposed a novel asynchronous algorithm to calculate the -shell indices, which is suitable to deal with large-scale growing networks. In this paper, we propose two algorithms to select nodes and update their intermediate values towards the -shell indices, which can help in accelerating the convergence of the calculation of -shell indices. The former algorithm takes into account the degrees of nodes while the latter algorithm prefers to choose the node whose neighbors' values have been changed recently. We test these two methods on four real networks and three artificial networks. The results suggest that the two algorithms can respectively reduce the convergence time up to 75.4\% and 92.9\% in average, compared with the original asynchronous updating algorithm.
arXiv comment18 pages, 4 figures, 2 tables
References in corpus (34)
- Emergence of scaling in random networks
- Finding and evaluating community structure in networks
- An index to quantify an individual's scientific research output
- Community detection in graphs
- Assortative mixing in networks
- Statistical physics of social dynamics
- Epidemic processes in complex networks
- The Building Blocks of Economic Complexity
- Identification of influential spreaders in complex networks
- Link Prediction in Complex Networks: A Survey
- The Dynamics of Viral Marketing
- Higher-order organization of complex networks
- Immunization of complex networks
- Connectivity of Growing Random Networks
- Efficient Immunization Strategies for Computer Networks and Populations
- Vital nodes identification in complex networks
- Growing Scale-Free Networks with Tunable Clustering
- Recommender Systems
- Structure and dynamics of molecular networks: A novel paradigm of drug discovery. A comprehensive review
- Organization of Growing Random Networks
- New Model of Internet Topology Using k-shell Decomposition
- MEDUSA - New Model of Internet Topology Using k-shell Decomposition
- k-core organization of complex networks
- Unification of theoretical approaches for epidemic spreading on complex networks
- Searching for superspreaders of information in real-world social media
- Ranking the spreading influence in complex networks
- A measure of individual role in collective dynamics
- Combining complex networks and data mining: why and how
- Competing activation mechanisms in epidemics on networks
- Lobby index in networks
- A general model for collaboration networks
- Iterative resource allocation based on propagation feature of node for identifying the influential nodes
- Topological structure and the H-index in complex networks
- Identifying Influential Spreaders of Epidemics on Community Networks