A K-shell Improved Method for the Importance of Complex Network Nodes

In this paper, a weighted k-shell method is proposed to further improve the distinction of node importance by taking advantage of the number of iterations and edge weights when the node is deleted. The weighted k-shell decomposition method is applied to simple networks and complex networks respectively. The simulation results show that the improved method has low computational complexity, high result resolution and high accuracy.