Limiting the spread of misinformation in social networks

Proceedings of the 20th International Conference on World Wide Web, WWW 2011

Volumn , Issue , 2011, Pages 665-674

  Budak, Ceren ^a   Agrawal, Divyakant ^a   Abbadi, Amr El ^a  

^a University of California   (United States)

Author keywords

Competing campaigns; Information cascades; Misinformation; Social networks; Submodular functions; Supermodular functions

Indexed keywords

COMPETING CAMPAIGNS; MISINFORMATION; SOCIAL NETWORKS; SUBMODULAR FUNCTIONS; SUPERMODULAR FUNCTIONS;

ALGORITHMS; EXPERIMENTS; SOCIAL NETWORKING (ONLINE);

WORLD WIDE WEB;

EID: 80052722917     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1963405.1963499     Document Type: Conference Paper

References (45)

1. D. J. Aldous. The random walk construction of uniform spanning trees and uniform labelled trees. SIAM J. Discret. Math., 3(4):450-465, 1990.
2. R. M. Anderson and R. M. May. Infectious Diseases of Humans: Dynamics and Control. Oxford University Press, USA, September 1992.
3. N. T. J. Bailey. The mathematical theory of infectious diseases and its applications. 1975.
4. S. Bharathi, D. Kempe, and M. Salek. Competitive influence maximization in social networks. In WINE, pages 306-311, 2007.
5. A. Broder. Generating random spanning trees. In SFCS '89, pages 442-447, 1989.
6. R. L. Brooks, C. Smith, A. Stone, and W. Tutte. The dissections of rectangles into squares. Duke. Math. J., 7:312-340, 1940.
7. T. Carnes, C. Nagarajan, S. M. Wild, and A. van Zuylen. Maximizing influence in a competitive social network: a follower's perspective. In ICEC '07, pages 351-360, New York, NY, USA, 2007. ACM.
8. W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD, 2009.
9. W. Chen, Y. Yuan, and L. Zhang. Scalable influence maximization in social networks under the linear threshold model. In ICDM, pages 88-97, 2010.
10. G. Cornuejols, M. L. Fisher, and G. L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science, 23(8:789-810, 1977.
11. O. Diekmann and J. A. P. Heesterbeek. Mathematical Epidemiology of Infectious Diseases: Model Building, Analysis and Interpretation. Wiley, 1 edition, May 2000.
12. P. Domingos and M. Richardson. Mining the network value of customers. In KDD, pages 57-66, 2001.
13. P. Dubey, R. Garg, and B. D. Meyer. Competing for customers in a social network: The quasi-linear case. In WINE, pages 162-173, 2006.
14. R. Durrett. Lecture notes on particle systems and percolation. Wadsworth Publishing, 1988.
15. G. Gallo and B. Simeone. On the supermodular knapsack problem. Mathematical Programming, 45:295-309, 1989.
16. J. Garrison and C. Knoll. Prop. 8 opponents rally across california to protest gay-marriage ban. Los Angeles Times, November 2008.
17. J. Goldenberg, B. Libai, and E. Muller. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters, 2001.
18. M. Gomez-Rodriguez, J. Leskovec, and A. Krause. Inferring networks of diffusion and influence. In KDD, pages 1019-1028, 2010.
19. M. Granovetter. Threshold models of collective behavior. American Journal of Sociology, 1978.
20. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2):169-197, 1981.
21. H. W. Hethcote. The mathematics of infectious diseases. SIAM Rev., 42(4):599-653, 2000.
22. K. M. Heussner. Ft. hood soldier causes stir on twitter. ABS News (online), November 2009.
23. D. Kempe. Structure and Dynamics of Information in Networks. 2010.
24. D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003.
25. J. O. Kephart and S. R. White. Measuring and modeling computer virus prevalence. In SP '93, page 2, Washington, DC, USA, 1993. IEEE Computer Society.
26. M. Kimura, K. Saito, and R. Nakano. Extracting influential nodes for information diffusion on a social network. In AAAI, pages 1371-1376, 2007.
27. G. Kirchhoff. Über die auflösung der gleichungen auf welche man sei der untersuchung der linearen vertheilung galvanischer strome gefuhrt wind. Ann. Phys. Chem, 72:497-508, 1847.
28. M. Kitsak, L. K. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H. E. Stanley, and H. A. Makse. Identifying influential spreaders in complex networks. Jan 2010.
29. J. Kostka, Y. A. Oswald, and R. Wattenhofer. Word of mouth: Rumor dissemination in social networks. In SIROCCO, pages 185-196, 2008.
30. V. G. Kulkarni. Generating random combinatorial objects. Journal of Algorithms, 11(2):185 - 207, 1990.
31. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. M. VanBriesen, and N. S. Glance. Cost-effective outbreak detection in networks. In KDD, pages 420-429, 2007.
32. T. M. Liggett. Interacting particle systems, 1985.
33. D. Meier, Y. A. Oswald, S. Schmid, and R. Wattenhofer. On the windfall of friendship: inoculation strategies on social networks. In EC '08, pages 294-301, 2008.
34. Michael jackson on tmz, iran on twitter. http://www.blogher.com/ spreading-news.
35. E. Morozov. Swine flu: Twitter's power to misinform. Foreign Policy, April 2009.
36. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions. Mathematical Programming, 14(1):265-294, 1978.
37. M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing. In KDD, pages 61-70, 2002.
38. Z. Svitkina and L. Fleischer. Submodular approximation: Sampling-based algorithms and lower bounds. In FOCS, pages 697-706, 2008.
39. D. M. Topkis. Supermodularity and Complementarity. Princeton University Press, first edition edition, April 1998.
40. Twitter. http:://www.twitter.com.
41. C. Wang, J. C. Knight, and M. C. Elder. On computer viral infection and the effect of immunization. In ACSAC '00, page 246, Washington, DC, USA, 2000. IEEE Computer Society.
42. S. Wasserman and K. Faust. Social Network Analysis. Cambridge University Press, 1994.
43. C. Wilson, B. Boe, A. Sala, K. P. Puttaswamy, and B. Y. Zhao. User interactions in social networks and their implications. In EuroSys, pages 205-218, 2009.
44. D. B. Wilson. Generating random spanning trees more quickly than the cover time. In STOC '96, pages 296-303, New York, NY, USA, 1996. ACM.
45. D. B. Wilson and J. G. Propp. How to get an exact sample from a generic markov chain and sample a random spanning tree from a directed graph, both within the cover time. In SODA '96, pages 448-457, Philadelphia, PA, USA, 1996. Society for Industrial and Applied Mathematics.