Influence maximization in undirected networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 1482-1496

  Khanna, Sanjeev ^a   Lucier, Brendan ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGRATED CIRCUITS; PERCOLATION (SOLID STATE); SOLVENTS;

APPROXIMATION FACTOR; BOND PERCOLATION; DIRECTED NETWORK; GREEDY ALGORITHMS; INFLUENCE MAXIMIZATIONS; MODEL OF INFLUENCES; PROBABILISTIC ANALYSIS; UNDIRECTED NETWORK;

APPROXIMATION ALGORITHMS;

EID: 84902094564     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.109     Document Type: Conference Paper

References (21)

1. Paola Alimonti and Viggo Kann. Some apx-completeness results for cubic graphs, pages 123-134, 2000.
2. Shishir Bharathi, David Kempe, and Mahyar Salek. Competitive influence maximization in social networks. In WINE, pages 306-311, 2007.
3. Duncan S Callaway, Mark EJ Newman, Steven H Strogatz, and Duncan J Watts. Network robustness and fragility: Percolation on random graphs. Physical review letters, 85(25):5468, 2000.
4. Wei Chen, Chi Wang, and Yajun Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD, pages 1029-1038, 2010.
5. Charles J Colbourn. The combinatorics of network reliability. Oxford University Press, Inc., 1987.
6. Peter S. Dodds and D.J.Watts. A generalized model of social and biological contagion. Journal of Theoretical Biology, 232(4):587-694, 2005.
7. Pedro Domingos and Matthew Richardson. Mining the network value of customers. In KDD, pages 57-66, 2001.
8. J. Goldenberg, B. Libai, and E. Mulle. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Mark. Let., pages 221-223, 2001.
9. Manuel Gomez-Rodriguez, Jure Leskovec, and Andreas Krause. Inferring networks of diffusion and influence. TKDD, 5(4):21, 2012.
10. Sanjeev Goyal and Michael Kearns. Competitive contagion in networks. In STOC, pages 759-774, 2012.
11. M. Granovetter. Threshold models of collective behavior. American Journal of Sociology, (83): 1420-1443, 1978.
12. David Kempe, Jon Kleinberg, and Eva Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137-146, 2003.
13. David Kempe, Jon M. Kleinberg, and Eva Tardos. Influential nodes in a diffusion model for social networks. In ICALP, pages 1127-1138, 2005.
14. Harry Kesten. The critical probability of bond percolation on the square lattice equals 1/2. Communications in mathematical physics, 74(1):41-59, 1980.
15. Jure Leskovec, Mary McGlohon, Christos Faloutsos, Natalie S. Glance, and Matthew Hurst. Patterns of cascading behavior in large blog graphs. In SDM, 2007.
16. D. Liben-Nowell and J. Kleinberg. Tracing information flow on a global scale using internet chain-letter data. PNAS, 105(12):4633-4638, 2008.
17. Christian D Lorenz and Robert M Ziff. Precise determination of the bond percolation thresholds and finite- size scaling corrections for the sc, fee, and bcc lattices. Physical Review E, 57(1):230, 1998.
18. Elchanan Mossel and Sebastien Roch. On the submod- ularity of influence in social networks. In STOC, pages 128-134, 2007.
19. Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemic spreading in scale-free networks. Physical review letters, 86(14):3200, 2001.
20. Matthew Richardson and Pedro Domingos. Mining knowledge-sharing sites for viral marketing. In KDD, pages 61-70, 2002.
21. E. Rogers. Diffusion of Innovations. Free Press, 5th edition, 2003.