Sciweavers

267 search results - page 2 / 54
» On the approximability of influence in social networks
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 5 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 4 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
ASUNAM
2009
IEEE
13 years 11 months ago
Dynamic and Static Influence Models on Starbucks Networks
Minkyoung Kim, Byoung-Tak Zhang, June-Sup Lee
SEMWEB
2010
Springer
13 years 2 months ago
Measuring the Dynamic Bi-directional Influence between Content and Social Networks
The Social Semantic Web has begun to provide connections between users within social networks and the content they produce across the whole of the Social Web. Thus, the Social Sema...
Shenghui Wang, Paul T. Groth
WWW
2008
ACM
14 years 5 months ago
Optimal marketing strategies over social networks
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
Jason D. Hartline, Vahab S. Mirrokni, Mukund Sunda...