Cost-effective viral marketing for time-critical campaigns in large-scale social networks

IEEE/ACM Transactions on Networking

Volumn 22, Issue 6, 2014, Pages 2001-2011

  Dinh, Thang N ^a,b   Zhang, Huiyuan ^a   Nguyen, Dzung T ^a   Thai, My T ^a  

^a University of Florida   (United States)

^b Virginia Commonwealth University   (United States)

Author keywords

Approximation algorithm; hardness proof; influence propagation; power law networks; social media

Indexed keywords

APPROXIMATION ALGORITHMS; COMMERCE; COST EFFECTIVENESS; COSTS; MARKETING; MATHEMATICAL PROGRAMMING;

ANALYTICAL ANALYSIS; DEGREE CENTRALITY; GREEDY HEURISTICS; LARGE-SCALE NETWORK; ONLINE SOCIAL NETWORKS (OSNS); POWER-LAW NETWORKS; RELATIVE ERROR BOUNDS; SOCIAL MEDIA;

SOCIAL NETWORKING (ONLINE);

EID: 84919646919     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2013.2290714     Document Type: Article

References (32)

1. Facebook, Menlo Park, CA, USA, "Facebook statistics 2012," 2012 [online]. Available: http://newsroom.fb.com/Key-Facts
2. Alexa, "Alexa 2012," [online]. Available: http://www.alexa. com/topsites
3. C. Shirky, "The political power of social media: Technology, the public sphere, and political change," 2011 [online]. Available: http://www. gpia.info/files/u1392/Shirky-Political-Poewr-of-Social-Media.pdf
4. L. Rao, "Toyota turns to Twitter to repair its image," 2010 [online]. Available: http://techcrunch.com/2010/03/02/toyota-turns-totwitter-to-repair-its-image/
5. D. Kempe, J. Kleinberg, and É. Tardos, "Maximizing the spread of influence through a social network," in Proc. KDD, New York, NY, USA, 2003, pp. 137-146.
6. D. Kempe, J. Kleinberg, and E. Tardos, "Influential nodes in a diffusion model for social networks," in Proc. ICALP, 2005, pp. 1127-1138.
7. W. Chen, Y. Wang, and S. Yang, "Efficient influence maximization in social networks," in Proc. KDD, New York, NY, USA, 2009, pp. 199-208.
8. N. Chen, "On the approximability of influence in social networks," SIAM J. Discrete Math., vol. 23, no. 3, pp. 1400-1415, 2009.
9. Y. Li, B. Q. Zhao, and J. C. S. Lui, "On modeling product advertisement in large-scale online social networks," IEEE/ACM Trans. Netw., vol. 20, no. 5, pp. 1412-1425, Oct. 2012.
10. M. Cha, A. Mislove, and K. P. Gummadi, "A measurement-driven analysis of information propagation in the Flickr social network," in Proc. WWW, New York, NY, USA, 2009, pp. 721-730.
11. J. Leskovec, L. A. Adamic, and B. A. Huberman, "The dynamics of viral marketing," Trans. Web, vol. 1, no. 1, 2007, Art. no. 5.
12. W. Aiello, F. Chung, and L. Lu, "A random graph model for power law graphs," Exper. Math, vol. 10, pp. 53-66, 2000.
13. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance, "Cost-effective outbreak detection in networks," in Proc. ACM KDD, New York, NY, USA, 2007, pp. 420-429.
14. M. Minoux, "Accelerated greedy algorithms for maximizing submodular set functions," Optim. Tech., vol. 7, Lecture Notes in Control and Information Sciences, pp. 234-243, 1978.
15. W. Chen, C. Wang, and Y. Wang, "Scalable influence maximization for prevalent viral marketing in large-scale social networks," in Proc. ACM KDD, New York, NY, USA, 2010, pp. 1029-1038.
16. A. Goyal, F. Bonchi, L. Lakshmanan, and S. Venkatasubramanian, "On minimizing budget and time in influence propagation over social networks," Social Netw. Anal. Mining, vol. 3, no. 2, pp. 1-14, 2012.
17. C. Wei, L. Wei, and Z. Ning, "Time-critical influence maximization in social networks with time-delayed diffusion process," in Proc. AAAI, 2012, pp. 592-598.
18. F. Wang, E. Camacho, and K. Xu, "Positive influence dominating set in online social networks," in Proc. COCOA, Berlin, Heidelberg, 2009, pp. 313-321.
19. F. Zou, Z. Zhang, and W. Wu, B. Liu, A. Bestavros, D.-Z. Du, and J. Wang, Eds., "Latency-bounded minimum influential node selection in social networks," in Proc. WASA, 2009, LNCS, pp. 519-526.
20. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan, "Learning influence probabilities in social networks," in Proc. WSDM, 2010, pp. 241-250.
21. D. Peleg, "Local majority voting, small coalitions and controlling monopolies in graphs: A review," in Proc. SIROCCO, 1996, pp. 152-169.
22. A. Barabasi, R. Albert, and H. Jeong, "Scale-free characteristics of random networks: the topology of the world-wide Web," Physica A, vol. 281, no. 1-4, pp. 69-77, 2000.
23. A. Barabasi, H. Jeong, Z. Neda, E. Ravasz, A. Schubert, and T. Vicsek, "Evolution of the social network of scientific collaborations," Physica A, Stat, Mech, Appl., vol. 311, no. 3-4, pp. 590-614, 2002.
24. A. Clauset, C. R. Shalizi, and M. E. J. Newman, "Power-law distributions in empirical data," SIAM Rev., vol. 51, pp. 661-703, 2009.
25. W. Aiello, F. Chung, and L. Lu, "A random graph model for massive graphs," in Proc. STOC, New York, NY, USA, 2000, pp. 171-180.
26. W. Aiello, F. Chung, and L. Lu, "Random evolution in massive graphs," in Proc. IEEE FOCS, 2001, p. 510.
27. A. Ferrante, "Hardness and approximation algorithms of some graph problems," 2006.
28. T.N.Dinh, D. T. Nguyen, andM.T.Thai, "Cheap, easy, andmassively effective viral marketing in social networks: truth or fiction?," in Proc. 23rd ACM Conf. Hypertext Social Media, New York, NY, USA, 2012, pp. 165-174.
29. U. Feige, "A threshold of ln n for approximating set cover," J. ACM, vol. 45, no. 4, pp. 634-652, 1998.
30. T. N. Dinh, Y. Shen, D. T. Nguyen, and M. T. Thai, "On the approximability of positive influence dominating set in social networks," J. Combin. Optim. pp. 1-17, 2012, DOI: 10.1007/s10878-012-9530-7.
31. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, "On the evolution of user interaction in Facebook," in Proc.WOSN, Aug. 2009, pp. 37-42.
32. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and analysis of online social networks," in Proc. IMC, San Diego, CA, USA, Oct. 2007, pp. 29-42.