Loyalty improvement beyond the seeds in social networks

Huan Ma (), Yuqing Zhu (), Deying Li (), Songsong Li () and Weili Wu ()
Additional contact information
Huan Ma: Renmin University of China
Yuqing Zhu: University of Texas at Dallas
Deying Li: Renmin University of China
Songsong Li: Renmin University of China
Weili Wu: University of Texas at Dallas

Journal of Combinatorial Optimization, 2015, vol. 29, issue 4, No 1, 685-700

Abstract: Abstract The influence maximization problem in modular social networks is to find a set of seed nodes such that the total influence effect is maximized. Difference with the previous research, in this paper we propose a novel task of influence improving, which is to find strategies to increase the members’ investments. The problem is studied under two influence propagation models: independent cascade (IC) and linear threshold (LT) models. We prove that our influence improving problem is $$\mathcal{NP }$$ NP -hard, and propose new algorithms under both IC and LT models. To the best of our knowledge, our work is the first one that studies influence improving problem under bounded budget. Finally, we implement extensive experiments over a large data collection obtained from real-world social networks, and evaluate the performance of our approach.

Keywords: Approximation algorithm; Improving loyalty; Bounded budget; Modular social networks (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9616-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:29:y:2015:i:4:d:10.1007_s10878-013-9616-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9616-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().