Maximizing social influence in nearly optimal time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 946-957

  Borgs, Christian ^a   Brautbar, Michael ^b   Chayes, Jennifer ^a   Lucier, Brendan ^a  

^a MICROSOFT RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ALGORITHMIC PROBLEMS; APPROXIMATION FACTOR; BEST-KNOWN ALGORITHMS; EARLY TERMINATION; EPIDEMIC DISEASE; INFLUENCE MAXIMIZATIONS; NETWORK DIFFUSIONS; SOCIAL INFLUENCE;

APPROXIMATION ALGORITHMS;

EID: 84902108772     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.70     Document Type: Conference Paper

References (39)

1. Andersen, R., Borgs, C., Chayes, J., Hopcraft, J., Mirrokni, V. S., and Teng, S.-H. 2007. Local computation of pagerank contributions. In WAW. 150-165.
2. Andersen, R., Chung, F., and Lang, K. 2006. Local graph partitioning using pagerank vectors. In FOCS. 475-486.
3. Bakshy, E., Karrer, B., and Adamic, L. A. 2009. Social influence and the diffusion of user- created content. In ACM EC. 325-334.
4. Ben-Zwi, O., Hermelin, D., Lokshtanov, D., and Newman, I. 2011. Treewidth governs the complexity of target set selection. Discrete Opt. 8, 1, 87-96.
5. Bharathi, S., Kempe, D., and Salek, M. 2007. Competitive influence maximization in social net-works. In WINE. 306-311.
6. Borgs, C., Brautbar, M., Chayes, J. T., and Teng, S.-H. 2012. A sublinear time algorithm for pagerank computations. In WAW. 41-53.
7. Brautbar, M. and Kearns, M. 2010. Local algorithms for finding interesting individuals in large networks. In ICS. 188-199.
8. Brown, J. J. and Reingen, P. H. 1987. Social ties and word of mouth referral behavior. Journal of Consumer Research 14, 3, 350-362.
9. Centola, D. and Macy, M. 2007. Complex contagions and the weakness of long ties. American Journal of Sociology 113, 3, 702-734.
10. Cha, M., Mislove, A., and Gummadi, P. K. 2009. A measurement-driven analysis of information propagation in the flickr social network. In WWW. 721-730.
11. Chen, N. 2008. On the approximability of influence in social networks. In SODA. 1029-1037.
12. Chen, W., Wang, C., and Wang, Y. 2010a. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD. 1029-1038.
13. Chen, W., Wang, Y., and Yang, S. 2009. Efficient influence maximization in social networks. In KDD. 199-208.
14. Chen, W., Yuan, Y., and Zhang, L. 2010b. Scalable influence maximization in social networks under the linear threshold model. In ICDM. 88-97.
15. Dodds, P. and Watts, D. 2007. Universal behavior in a generalized model of contagion. Phys Rev Lett 92, 21, 218701.
16. Domingos, P. and Richardson, M. 2001. Mining the network value of customers. In KDD. 57-66.
17. Goldenberg, J., Libai, B., and Mulle, E. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Mark. Let., 221-223.
18. Goldreich, O. 2010. Introduction to testing graph properties. In Property Testing. 105-141.
19. Gomez-Rodriguez, M., Leskovec, J., and Krause, A. 2012. Inferring networks of diffusion and influence. TKDD 5, 4, 21.
20. Goyal, S. and Kearns, M. 2012. Competitive contagion in networks. In STOC. 759-774.
21. Granovetter, M. 1978. Threshold models of collective behavior. American Journal of Sociology 83, 1420-1443.
22. Jiang, Q., Song, G., Cong, G., Wang, Y., Si, W., and Xie, K. 2011. Simulated annealing based influence maximization in social networks. In AAAI.
23. Kempe, D., Kleinberg, J., and Tardos, E. 2003. Maximizing the spread of influence through a social network. In KDD. 137-146.
24. Kempe, D., Kleinberg, J. M., and Tardos, E. 2005. Influential nodes in a diffusion model for social networks. In ICALP. 1127-1138.
25. Kimura, M. and Saito, K. 2006. Tractable models for information diffusion in social networks. In PKDD. 259-271.
26. Leskovec, J., Adamic, L. A., and Huberman, B. A. 2007a. The dynamics of viral marketing. TWEB 1, 1.
27. Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J. M., and Glance, N. S. 2007b. Cost-effective outbreak detection in networks. In KDD. 420-429.
28. Leskovec, J., McGlohon, M., Faloutsos, C., Glance, N. S., and Hurst, M. 2007c. Patterns of cascading behavior in large blog graphs. In SDM.
29. Liben-Nowell, D. and Kleinberg, J. 2008. Tracing information flow on a global scale using internet chain-letter data. PNAS 105, 12, 4633-4638.
30. Mathioudakis, M., Bonchi, F., Castillo, C., Gionis, A., and Ukkonen, A. 2011. Sparsification of influence networks. In KDD. 529-537.
31. Morris, S. 2000. Contagion. Review of Economic Studies 67, 57-78.
32. Mossel, E. and Roch, S. 2007. On the sub- modularity of influence in social networks. In STOC. 128-134.
33. Peleg, D. 2002. Local majorities, coalitions and monopolies in graphs: A review. Theor. Comput. Sci. 282, 2, 231-257.
34. Richardson, M. and Domingos, P. 2002. Mining knowledge-sharing sites for viral marketing. In KDD. 61-70.
35. Rogers, E. 2003. Diffusion of Innovations 5th Ed. Free Press.
36. Rubinfeld, R. and Shapira, A. 2011. Sublinear time algorithms. SIAM Journal on Discrete Math 25, 1562-1588.
37. Spielman, D. A. and Teng, S.-H. 2004. Nearly- linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC. 81-90.
38. Wang, Y., Cong, G., Song, G., and Xie, K. 2010. Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In KDD. 1039-1048.
39. Yao, A. C.-C. 1977. Probabilistic computations: Toward a unified measure of complexity (extended abstract). In FOCS. 222-227.