Ranking spreaders by decomposing complex networks
- Zeng, An Department of Physics, University of Fribourg, Switzerland - Institute of Information Economy, Hangzhou Normal University, China
- Zhang, Cheng-Jun Department of Physics, University of Fribourg, Switzerland
-
03.06.2013
Published in:
- Physics Letters A. - 2013, vol. 377, no. 14, p. 1031–1035
English
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.
- Faculty
- Faculté des sciences et de médecine
- Department
- Département de Physique
- Language
-
- English
- Classification
- Physics
- License
- License undefined
- Identifiers
-
- RERO DOC 32545
- DOI 10.1016/j.physleta.2013.02.039
- Persistent URL
- https://folia.unifr.ch/unifr/documents/303020
Statistics
Document views: 25
File downloads:
- zen_rsd.pdf: 42