Effective identification of multiple influential spreaders by DegreePunishment

Xiaojie Wang, Yanyuan Su, Chengli Zhao and Dongyun Yi

Physica A: Statistical Mechanics and its Applications, 2016, vol. 461, issue C, 238-247

Abstract: With the rapid development of social networks, how to effectively identify a small group of nodes to maximize their spreading influence becomes a crucial topic. Traditional centrality-based methods are often very simple but not so effective compared to other complex methods. In this paper, we propose a heuristic method to select spreaders sequentially by carrying out a punishing strategy to the neighbors of those already selected spreaders. We use the Susceptible–Infected–Recovered (SIR) model to evaluate the performance by considering the number of infected nodes in the end. Experiments on four real networks show that our method outperforms traditional centrality-based methods and several heuristic ones.

Keywords: Spreading influence; SIR model; Heuristic method (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437116302059
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

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:phsmap:v:461:y:2016:i:c:p:238-247

DOI: 10.1016/j.physa.2016.05.020

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().