Ranking spreaders by decomposing complex networks |
| |
Authors: | An Zeng Cheng-Jun Zhang |
| |
Affiliation: | 1. Department of Physics, University of Fribourg, Chemin du Musée 3, CH-1700 Fribourg, Switzerland;2. Institute of Information Economy, Hangzhou Normal University, Hangzhou 310036, China |
| |
Abstract: | Ranking the nodes? ability of spreading in networks is crucial for designing efficient strategies to hinder spreading in the case of diseases or accelerate spreading in the case of information dissemination. In the well-known k-shell method, nodes are ranked only according to the links between the remaining nodes (residual links) while the links connecting to the removed nodes (exhausted links) are entirely ignored. In this Letter, we propose a mixed degree decomposition (MDD) procedure in which both the residual degree and the exhausted degree are considered. By simulating the epidemic spreading process on real networks, we show that the MDD method can outperform the k-shell and degree methods in ranking spreaders. |
| |
Keywords: | Complex networks Network decomposition Spreading |
本文献已被 ScienceDirect 等数据库收录! |
|