Containing viral spread on sparse random graphs: Bounds, algorithms, and experiments

Internet Mathematics

Volumn 9, Issue 4, 2013, Pages 406-433

  Bradonjić, Milan ^a   Molloy, Michael ^b   Yan, Guanhua ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906319853     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2013.798600     Document Type: Article

References (26)

1. Konstantin Andreev and Harald Räcke. “Balanced Graph Partitioning.” In Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’04, pp. 120–124. ACM, 2004.
2. E. Ben-Naim and P. L. Krapivsky. “Size of Outbreaks near the Epidemic Threshold.” Phys. Rev. E, 69:050901, May 2004.
3. Patrick Billingsley. Probability and Measure, Wiley series in probability and mathematical statistics. Wiley, 1979.
4. Béla Bollobás. Random Graphs, second edition. Cambridge University Press, 2001.
5. Ceren Budak, Divyakant Agrawal, and Amr El Abbadi. “Limiting the Spread of Misinformation in Social Networks.” In Proceedings of the 20th International Conference on World Wide Web, WWW’11, pp. 665–674. ACM, 2011.
6. Reuven Cohen, Shlomo Havlin, and Daniel ben Avraham. “Efficient Immunization Strategies for Computer Networks and Populations.” Physical Review Letters 91, December 2003.
7. P. Erdős and A. Rényi. “On Random Graphs I.” “Publ. Math. Inst. Hungar. Acad. Sci.” 6 (1959), 290–297.
8. P. Erdős and A. Rényi. “On the Evolution of Random Graphs.” Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960), 17–61.
9. Christos Faloutsos, Kevin S. McCurley, and Andrew Tomkins. “Connection Subgraphs in Social Networks.” In Proceedings of Workshop on Link Analysis, Counterterrorism, and Privacy, Affiliated with SIAM International Conference on Data Mining, 2004.
10. Alan M. Frieze. “On the Value of a Random Minimum Spanning Tree Problem.” Discrete Applied Mathematics 10:1 (1985), 47–56.
11. Geoffrey Grimmett. Percolation, second edition, Grundl. Math. Wissen. 321. Springer-Verlag, 1999.
12. Svante Janson. “Susceptibility of Random Graphs with Given Vertex Degrees.” Journal of Combinatorics 1:3-4 (2010), 357–387.
13. William O. Kermack and Anderson G. McKendrick. “Contributions to the Mathematical Theory of Epidemics III: Further Studies of the Problem of Endemicity.” Proceedings of the Royal Society of London 141 (1933), 94–122.
14. Ravi Kumar, Jasmine Novak, and Andrew Tomkins. “Structure and Evolution of Online Social Networks.” In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD’06, pp. 611–617. ACM, 2006.
15. Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, and Michael W. Mahoney. “Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters.” Internet Mathematics 6:1 (2009), 29–123.
16. Tomasz _Luczak. “A Note on the Sharp Concentration of the Chromatic Number of Random Graphs.” Combinatorica 11 (1991), 295–297.
17. Michael Molloy and Bruce Reed. “A Critical Point for Random Graphs with a Given Degree Sequence.” Random Struct. Algorithms 6 (1995), 161–179.
18. David Moore, Vern Paxson, Stefan Savage, Colleen Shannon, Stuart Staniford, and Nicholas Weaver. “Inside the Slammer Worm.” IEEE Security and Privacy 1:4 (2003), 33–39.
19. M. E. J. Newman and D. J. Watts. “Scaling and Percolation in the Small-World Network Model.” Physical Review E 60:6 (1999), 7332–7342.
20. R. Pastor-Satorras and A. Vespignani. “Immunization of Complex Networks.” Physical Review E 65 (2002), 036104.
21. L. M. Sander, C. P. Warrena, I. M. Sokolovb, C. Simonc, and J. Koopmand. “Percolation on Heterogeneous Networks as a Model for Epidemics.” Mathematical Biosciences 180:1-2 (2002), 293–305.
22. B. Sun, G. Yan, Y. Xiao, and T. A. Yang. “Self-Propagating Mal-Packets in Wireless Sensor Networks: Dynamics and Defense Implications.” Ad Hoc Networks 7:8 (2009), 1489–1500.
23. Guanhua Yan, Zhen Xiao, and Stephan Eidenbenz. “Catching Instant Messaging Worms with Change-Point Detection Techniques.” In Proceedings of the 1st Usenix Workshop on Large-Scale Exploits and Emergent Threats, pp. 6:1–6:10, USENIX Association, 2008.
24. Guanhua Yan, Guanling Chen, Stephan Eidenbenz, and Nan Li. “Malware Propagation in Online Social Networks: Nature, Dynamics, and Defense Implications.” In Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, ASIACCS’11, pp. 196–206. ACM, 2011.
25. Cliff Changchun Zou, Weibo Gong, and Don Towsley. Code Red Worm Propagation Modeling and Analysis. In CCS’02: Proceedings of the 9th ACM conference on Computer and Communications Security, pp. 138–147. ACM, 2002.
26. C. C. Zou, D. F. Towsley, and W. Gong. “Email Worms Modeling and Defense.” In Proceedings of ICCCN, 2004.