Node Immunization on Large Graphs: Theory and Algorithms

IEEE Transactions on Knowledge and Data Engineering

Volumn 28, Issue 1, 2016, Pages 113-126

  Chen, Chen ^a   Tong, Hanghang ^a   Prakash, B Aditya ^b   Tsourakakis, Charalampos E ^c   Eliassi Rad, Tina ^d   Faloutsos, Christos ^e   Chau, Duen Horng ^f  

^a Arizona State University   (United States)

^b VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^c HARVARD UNIVERSITY   (United States)

^d RUTGERS UNIVERSITY   (United States)

^e Carnegie Mellon University   (United States)

^f Georgia Institute of Technology   (United States)

Author keywords

graph mining; Immunization; scalability

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER VIRUSES; IMMUNIZATION; SCALABILITY;

BUILDING BLOCKES; CENTRAL COMPONENT; COMPUTATIONAL ISSUES; COMPUTER COMMUNICATION NETWORKS; CYBER SECURITY; GRAPH MINING; ORDERS OF MAGNITUDE; VIRAL MARKETING;

GRAPH THEORY;

EID: 84961625682     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2015.2465378     Document Type: Conference Paper

References (67)

1. R. Albert, H. Jeong, and A.-L. Barabasi, "Diameter of the world wide web," Nature, vol. 401, pp. 130-131, 1999.
2. L. Backstrom, D. P. Huttenlocher, J. M. Kleinberg, and X. Lan, "Group formation in large social networks: Membership, growth, and evolution," in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2006, pp. 44-54.
3. T. Berger-Wolf and H. Habiba, "Working for influence: Effect of network density and modularity on diffusion in networks," in Proc. IEEE 11th Int. Conf. Data Mining Workshops, 2011, pp. 933-940.
4. A. Beutel, B. A. Prakash, R. Rosenfeld, and C. Faloutsos, "Interacting viruses in networks: Can both survive?" in Proc. 18th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2012, pp. 426-434.
5. L. Briesemeister, P. Lincoln, and P. Porras, "Epidemic profiles and defense of scale-free networks," in Proc. ACM Workshop Rapid Malcode, Oct. 27, 2003, pp. 67-75.
6. A. Broder, R. Kumar, F. Maghoul1, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, "Graph structure in the web: Experiments and models," in Proc. World Wide Web Conf. Comput. Netw., 2000, pp. 309-320.
7. D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, and C. Faloutsos, "Epidemic thresholds in real networks," ACM Trans. Inf. Syst. Security, vol. 10, no. 4, p. 1, 2007.
8. H. Chan, L. Akoglu, and H. Tong, "Make it or break it: Manipulating robustness in large networks," in Proc. SIAM Int. Conf. Data Mining, 2014, pp. 325-333.
9. W. Chen, Y. Wang, and S. Yang, "Efficient influence maximization in social networks," in Proc. 15th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2009, pp. 199-208.
10. W. Chen, Y. Yuan, and L. Zhang, "Scalable influence maximization in social networks under the linear threshold model," in Proc. 10th Int. Conf. Data Mining, 2010, pp. 88-97.
11. R. Cohen, S. Havlin, and D. ben Avraham, "Efficient immunization strategies for computer networks and populations," Phys. Rev. Lett., vol. 91, no. 24, p. 247901, Dec. 2003.
12. C. H. Q. Ding, T. Li, and M. I. Jordan, "Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding," in Proc. 11th Int. Conf. Data Mining, 2008, pp. 183-192.
13. P. Domingos and M. Richardson, "Mining the network value of customers," in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2001, pp. 57-66.
14. M. Fiedler, "Algebraic connectivity of graphs," Czechoslovak Math. J., vol. 23, no. 2, pp. 298-305, 1973.
15. L. C. Freeman, "A set of measures of centrality based on betweenness," in Proc. Sociometry, 1977, pp. 35-41.
16. A. Ganesh, E. Massouli, and D. Towsley, "The effect of network topology on the spread of epidemics," in Proc. IEEE INFOCOM, 2005, pp. 1455-1466.
17. F. Geerts, H. Mannila, and E. Terzi, "Relational link-based ranking," in Proc. Int. Conf. Very Large Databases, 2004, pp. 552-563.
18. A. Gionis, E. Terzi, and P. Tsaparas, "Opinion maximization in social networks," in Proc. SIAM Data Mining Conf., 2013, pp. 387-395.
19. A. Goyal, W. Lu, and L. V. Lakshmanan, "Simpath: An efficient algorithm for influence maximization under the linear threshold model," in Proc. IEEE 11th Int. Conf. Data Mining, 2011, pp. 211-220.
20. H. Nagamochi and T. Ibaraki, Algorithmic Aspects of Graph Connectivity. Cambridge, U.K: Cambridge Univ. Press, 2008.
21. H. Habiba and T. Y. Berger-Wolf, "Graph theoretic measures for identifying effective blockers of spreading processes in dynamic networks," in Proc. MLG-ICML Workshop Mach. Learn. Graphs, 2008.
22. H. Habiba, "Critical individuals in dynamic population networks," PhD dissertation, Northwestern Univ., Evanston, IL, USA, 2013.
23. K. Henderson, B. Gallagher, L. Li, L. Akoglu, T. Eliassi-Rad, H. Tong, and C. Faloutsos, "It's who you know: Graph mining using recursive structural features," in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2011, pp. 663-671.
24. H. W. Hethcote, "The mathematics of infectious diseases," SIAM Rev., vol. 42, pp. 599-653, 2000.
25. W. Hwang, T. Kim, M. Ramanathan, and A. Zhang, "Bridging centrality: Graph mining from element level to group level," in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2008, pp. 336-344.
26. R. Jin, C. Wang, D. Polshakov, S. Parthasarathy, and G. Agrawal, "Discovering frequent topological structures from graph datasets," in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2005, pp. 606-611.
27. G. Karypis and V. Kumar, "Multilevel K-way hypergraph partitioning," in Proc. 36th Annu. ACM/IEEE Design Automation Conf., 1999, pp. 343-348.
28. D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in Proc. 9th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2003, pp. 137-146.
29. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," in Proc. ACM-SIAM Symp. Discrete Algorithms, 1998, pp. 668-677.
30. A. Krause and C. Guestrin, "Near-optimal observation selection using submodular functions," in Proc. 22nd Nat. Conf. Artif. Intell., 2007, pp. 1650-1654.
31. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. S. Glance, "Cost-effective outbreak detection in networks," in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2007, pp. 420-429.
32. L. Licamele and L. Getoor, "Social capital in friendship-event networks," in Proc. Int. Conf. Data Mining, 2006, pp. 959-964.
33. A. S. Maiya, "Sampling and inference in complex networks," PhD dissertation, Stanford Univ., Stanford, CA, USA, 2011.
34. A. S. Maiya and T. Y. Berger-Wolf, "Benefits of bias: Towards better characterization of network sampling," in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2011, pp. 105-113.
35. Y. Matsubara, Y. Sakurai, B. A. Prakash, L. Li, and C. Faloutsos, "Rise and fall patterns of information diffusion: Model and implications," in Proc. 18th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2012, pp. 6-14.
36. J. Moody and D. R. White, "Social cohesion and embeddedness: A hierarchical conception of social groups," in Proc. Amer. Sociol. Rev., 2003, pp. 1-25.
37. J. I. Munro and D. Wagner, "Better approximation of betweenness centrality," in Proc. 10th Workshop Algorithm Eng. Experiments, 2008.
38. T. Nepusz, A. Petraczi, L. Negyessy, and F. Bazso, "Fuzzy communities and the concept of bridgeness in complex networks," in Proc. Phys. Soc., 2007.
39. M. Newman, "A measure of betweenness centrality based on random walks," Soc. Netw., vol. 27, pp. 39-54, 2005.
40. A. Y. Ng, M. I. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," in Proc. Adv. Neural Inf. Process. Syst., 2001, pp. 849-856.
41. H. Nguyen, "Interactions on complex networks: Inference algorithms and applications," PhD dissertation, Univ. of Houston, Houston, TX, USA, 2013.
42. H. Nguyen and R. Zheng, "On budgeted influence maximization in social networks," IEEE J. Sel. Areas Commun., vol. 31, no. 6, pp. 1084-1094, Jun. 2013.
43. L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageRank citation ranking: Bringing order to the web," Stanford Digital Lib. Technol. Project, Stanford, CA, USA, Tech. Rep. SIDL-WP-1999-0120 (version of 11/11/1999), 1998.
44. B. A. Prakash, "Propagation and immunization in large networks," XRDS: Crossroads, The ACM Mag. Students, vol. 19, no. 1, pp. 56-59, 2012.
45. B. A. Prakash, L. Adamic, T. Iwashyna, H. Tong, and C. Faloutsos, "Fractional immunization in hospital-transfer graphs,".
46. B. A. Prakash, D. Chakrabarti, N. C. Valler, M. Faloutsos, and C. Faloutsos, "Threshold conditions for arbitrary cascade models on arbitrary networks," Knowl. Inf. Syst., vol. 33, no. 3, pp. 549-575, 2012.
47. B. A. Prakash, J. Vreeken, and C. Faloutsos, "Spotting culprits in epidemics: How many and which ones?" in Proc. 12th IEEE/ACM Int. Conf. Data Mining, 2012, pp. 11-20.
48. B. A. Prakash, J. Vreeken, and C. Faloutsos, "Efficiently spotting the starting points of an epidemic in a large graph," Knowl. Inf. Syst., vol. 38, pp. 35-59, 2014.
49. K. Saito, K. Ohara, Y. Yamagishi, M. Kimura, and H. Motoda, "Learning diffusion probability based on node attributes in social networks," in Proc. Found. Intell. Syst., 2011, pp. 153-162.
50. J. Shi and J. Malik, "Normalized cuts and image segmentation," in Proc. IEEE Conf. Comput. Vis. Pattern Recog., 1997, pp. 731-737.
51. X. Shi, M. Bonner, L. A. Adamic, and A. C. Gilbert, "The very small world of the well-connected," in Proc. 19th ACM Conf. Hypertext Hypermedia, 2008, pp. 61-70.
52. Y. Singer, "How to win friends and influence people, truthfully: Influence maximization mechanisms for social networks," in Proc. 5th ACM Int. Conf. Web Search Data Mining, 2012, pp. 733-742.
53. G. W. Stewart and J.-G. Sun, Matrix Perturbation Theory. New York, NY, USA: Academic, 1990.
54. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos, "Neighborhood formation and anomaly detection in bipartite graphs," in Proc. Int. Conf. Data Mining, 2005, pp. 418-425.
55. H. Tong, C. Faloutsos, and J.-Y. Pan, "Fast random walk with restart and its applications," in Proc. Int. Conf. Data Mining, 2006, pp. 613-622.
56. H. Tong, J. He, M. Li, W.-Y. Ma, H.-J. Zhang, and C. Zhang, "Manifold-ranking-based keyword propagation for image retrieval," EURASIP J. Appl. Signal Process., vol. 2006, p. 190, 2006.
57. H. Tong, B. A. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos, "Gelling, and melting, large graphs by edge manipulation," in Proc. 21st ACM Int. Conf. Inf. Knowl. Manage., 2012, pp. 245-254.
58. G. Tuli, C. J. Kuhlman, M. V. Marathe, S. Ravi, and D. J. Rosenkrantz, "Blocking complex contagions using community structure," in Proc. Workshop Multiagent Interaction Netw., 2012.
59. N. C. Valler, "Spreading processes on networks theory and applications," PhD dissertation, Univ. of California, Oakland, CA, USA, 2012.
60. D. Wang, Z. Wen, H. Tong, C.-Y. Lin, C. Song, and A.-L. Barabási, "Information spreading in context," in Proc. 20th Int. Conf. World Wide Web, 2011, pp. 735-744.
61. Y. Wang, D. Chakrabarti, C. Wang, and C. Faloutsos, "Epidemic spreading in real networks: An eigenvalue viewpoint," in Proc. 22nd Int. Symp. Rel. Distrib. Syst., 2003, pp. 25-34.
62. X. Wei, N. C. Valler, B. A. Prakash, I. Neamtiu, M. Faloutsos, and C. Faloutsos, "Competing memes propagation on networks: A network science perspective," IEEE J. Sel. Areas Commun., vol. 31, no. 6, pp. 1049-1060, Jun. 2013.
63. D. Xin, J. Han, X. Yan, and H. Cheng, "Mining compressed frequent-pattern sets," in Proc. Int. Conf. Very Large Databases, 2005, pp. 709-720.
64. Y. Yamagishi, K. Saito, K. Ohara, M. Kimura, and H. Motoda, "Learning attribute-weighted voter model over social networks," J. Mach. Learn. Res.-Proc. Track, vol. 20, pp. 263-280, 2011.
65. W. W. Zachary, "An information flow model for conflict and fission in small groups," J. Anthropol. Res., vol. 33, pp. 452-473, 1977.
66. H. Zha, X. He, C. H. Q. Ding, M. Gu, and H. D. Simon, "Spectral relaxation for k-means clustering," in Proc. Adv. Neural Inf. Process. Syst., 2001, pp. 1057-1064.
67. Y. Zhang and B. A. Prakash, "Scalable vaccine distribution in large graphs given uncertain data," in Proc. 23rd ACM Int. Conf. Inf. Knowl. Manage., 2014, pp. 1719-1728.