Seeds selection for spreading in a weighted cascade model

Tao Hong and Qipeng Liu

Physica A: Statistical Mechanics and its Applications, 2019, vol. 526, issue C

Abstract: In this paper, we investigate the problem of selecting seeds for spreading in complex networks. We first propose a weighted cascade model in which a node in the network is activated with a probability related to its neighbor’s degree which represents the neighbor’s persuasiveness. Furthermore, we provide several heuristic algorithms with little computational burden for selecting seeds to start the spreading. In particular, we propose a heuristic algorithm based on the expected benefit of selecting a seed. By simulations on two real networks, we find that the proposed algorithm based on expected benefit is better than the classic network centralities, including degree and PageRank.

Keywords: Complex networks; Influence maximization; Weighted cascade model; Network centrality (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437119305898
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:526:y:2019:i:c:s0378437119305898

DOI: 10.1016/j.physa.2019.04.179

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 ().