Identifying influential spreaders by weight degree centrality in complex networks

Yang Liu, Bo Wei, Yuxian Du, Fuyuan Xiao and Yong Deng

Chaos, Solitons & Fractals, 2016, vol. 86, issue C, 1-7

Abstract: The problem of identifying influential spreaders in complex networks has attracted much attention because of its great theoretical significance and wide application. In this paper, we propose a successful ranking method for identifying the influential spreaders. The proposed method measures the spreading ability of nodes based on their degree and their ability of spreading out. We also use a tuning weight parameter, which is always associated with the property of the networks such as the assortativity, to regulate the weight between the degree and the ability of spreading out. To test the effectiveness of the proposed method, we conduct the experiments on several synthetic networks and real-world networks. The results show that the proposed method outperforms the existing well-known ranking methods.

Keywords: Complex networks; Weight degree centrality method; Influential spreaders; Assortativity (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077916300212
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:86:y:2016:i:c:p:1-7

DOI: 10.1016/j.chaos.2016.01.030

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().