Improving the accuracy of the k-shell method by removing redundant links-from a perspective of spreading dynamics
arXiv:1505.07354
Abstract
Recent study shows that the accuracy of the k-shell method in determining node coreness in a spreading process is largely impacted due to the existence of core-like group, which has a large k-shell index but a low spreading efficiency. Based on analysis of the structure of core-like groups in real-world networks, we discover that nodes in the core-like group are mutually densely connected with very few out-leaving links from the group. By defining a measure of diffusion importance for each edge based on the number of out-leaving links of its both ends, we are able to identify redundant links in the spreading process, which have a relatively low diffusion importance but lead to form the locally densely connected core-like group. After filtering out the redundant links and applying the k-shell method to the residual network, we obtain a renewed coreness for each node which is a more accurate index to indicate its location importance and spreading influence in the original network. Moreover, we find that the performance of the ranking algorithms based on the renewed coreness are also greatly enhanced. Our findings help to more accurately decompose the network core structure and identify influential nodes in spreading processes.
arXiv comment18 pages, 14 figures
References in corpus (31)
- Statistical mechanics of complex networks
- Community detection in graphs
- The structure of scientific collaboration networks
- The architecture of complex weighted networks
- Epidemic processes in complex networks
- Identification of influential spreaders in complex networks
- Critical phenomena in complex networks
- Attack vulnerability of complex networks
- Self-similar community structure in organisations
- New Model of Internet Topology Using k-shell Decomposition
- MEDUSA - New Model of Internet Topology Using k-shell Decomposition
- Thresholds for epidemic spreading in networks
- k-core organization of complex networks
- An O(m) Algorithm for Cores Decomposition of Networks
- Ranking the spreading influence in complex networks
- Core-periphery organization of complex networks
- Spreading dynamics in complex networks
- Absence of influential spreaders in rumor dynamics
- k-core decomposition: a tool for the visualization of large scale networks
- Resilience and rewiring of the passenger airline networks in the United States
- k-Core percolation on multiplex networks
- Heterogeneous-k-core versus Bootstrap Percolation on Complex Networks
- Evolution of robust network topologies: Emergence of central backbones
- Inducing Effect on the Percolation Transition in Complex Networks
- Efficient routing strategies in scale-free networks with limited bandwidth
- Accelerating Community Detection by Using K-core Subgraphs
- Rhythmogenic neuronal networks, pacemakers, and k-cores
- Critical phenomena in heterogeneous k-core percolation
- Analytical results for bond percolation and k-core sizes on clustered networks
- Percolation on random networks with arbitrary k-core structure
- Core-Periphery in Networks: An Axiomatic Approach