A ranking approach based on k-shell decomposition method by filtering out redundant link in weighted networks
Authors: Luo Shi-Long  , Gong Kai  , Tang Chao-Sheng  , Zhou Jing  ,   School of Economic Information Engineering, Southwestern University of Finance and Economics, Chengdu 611130, China;,   School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454000, China
Published: December 2020

The k-shell decomposition method of identifying the influential nodes which accelerate spread or hinder propagation, plays an important role in analyzing the spreading performance of complex network, but it is too coarse in terms of ranking granularity. Recent study shows that the accuracy of the k-shell decomposition method in determining node coreness is significantly affected by the mutually densely connected local structures. Existing approach tries to filter out the confusion of the classical k-shell decomposition method, caused by such densely local structures, through redefining a diffusion importance value which is the number of out-leaving links at/from the nodes connected by a link. This value is used to quantify the potential influence of a link in spreading process. However, the existing approach is not suitable for ubiquitously weighted networks. In this paper, we develop a new ranking approach (filter-core) to identify the node spreading influence in weighted network. Here, we concern that the redundant links, although they are less important in the spreading process, form mutually densely connected local structures, which lead to the classical k-shell decomposition method unable to accurately determine the coreness of node in network. By redefining a new diffusion importance value for each link based on the weights of its connected nodes and the weight distribution, we filter out the redundant links which have a relatively low diffusion importance in the spreading process. After filtering out all redundant links and applying the classical k-shell decomposition method to the residual network, we obtain a new coreness for each node, which is more accurate to indicate spreading influence of node in the original network. Our approach is applied to three real weighted networks, i.e., the international trading network, the neural network of C. elegans, and the coauthorship network of scientists. And the susceptible-infected-recovered epidemic spreading model is used to make a comparison of performance between our approach and other three k-shell methods (including the weighted degree decomposition method, the s-core decomposition method, and the weighted k-shell method) in terms of four quantitative indices, i.e., the imprecision function, the standard deviation of infected fraction of max coreness node, the spreading time, and the number of recovered nodes at the end of spreading process. The experimental results show that our proposed approach is more accurate to identify the influential spreaders than the weighted degree decomposition method, the s-core decomposition method, and the weighted k-shell method, and also helps to more accurately decompose the network core structure for an optimal analysis in weighted network.