An individual-based model of information diffusion combining friends’ influence

Lidan Fan (), Zaixin Lu (), Weili Wu (), Yuanjun Bi (), Ailian Wang () and Bhavani Thuraisingham ()
Additional contact information
Lidan Fan: The University of Texas at Dallas
Zaixin Lu: The University of Texas at Dallas
Weili Wu: The University of Texas at Dallas
Yuanjun Bi: The University of Texas at Dallas
Ailian Wang: Taiyuan Institute of Technology
Bhavani Thuraisingham: The University of Texas at Dallas

Journal of Combinatorial Optimization, 2014, vol. 28, issue 3, No 3, 529-539

Abstract: Abstract In many real-world scenarios, an individual accepts a new piece of information based on her intrinsic interest as well as friends’ influence. However, in most of the previous works, the factor of individual’s interest does not receive great attention from researchers. Here, we propose a new model which attaches importance to individual’s interest including friends’ influence. We formulate the problem of maximizing the acceptance of information (MAI) as: launch a seed set of acceptors to trigger a cascade such that the number of final acceptors under a time constraint T in a social network is maximized. We then prove that MAI is NP-hard, and for time $$T = 1,2$$ T = 1 , 2 , the objective function for information acceptance is sub-modular when the function for friends’ influence is sub-linear in the number of friends who have accepted the information (referred to as active friends). Therefore, an approximation ratio $$(1-\frac{1}{e})$$ ( 1 - 1 e ) for MAI problem is guaranteed by the greedy algorithm. Moreover, we also prove that when the function for friends’ influence is not sub-linear in the number of active friends, the objective function is not sub-modular.

Keywords: Influence diffusion; Information acceptance; Individual’s interest; Friends’ influence; Social networks (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9677-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:28:y:2014:i:3:d:10.1007_s10878-013-9677-x

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

DOI: 10.1007/s10878-013-9677-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 ().