Node Immunization on Large Graphs: Theory and Algorithms

Given a large graph, like a computer communication network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? This problem, referred to as the node immunization problem, is the core building block in many high-impact applications, ranging from public health, cybersecurity to viral marketing. A central component in node immunization is to find the best k bridges of a given graph. In this setting, we typically want to determine the relative importance of a node (or a set of nodes) within the graph, for example, how valuable (as a bridge) a person or a group of persons is in a social network. First of all, we propose a novel `bridging' score Dλ, inspired by immunology, and we show that its results agree with intuition for several realistic settings. Since the straightforward way to compute Dλ is computationally intractable, we then focus on the computational issues and propose a surprisingly efficient way (O(nk2 + m)) to estimate it. Experimental results on real graphs show that (1) the proposed `bridging' score gives mining results consistent with intuition; and (2) the proposed fast solution is up to seven orders of magnitude faster than straightforward alternatives.

[1]  Aidong Zhang,et al.  Bridging centrality: graph mining from element level to group level , 2008, KDD.

[2]  Huy Nguyen,et al.  Interactions on Complex Networks: Inference Algorithms and Applications , 2013 .

[3]  Heikki Mannila,et al.  Relational link-based ranking , 2004, VLDB.

[4]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[5]  Christos Faloutsos,et al.  Fractional Immunization in Networks , 2013, SDM.

[6]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[7]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[8]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[9]  Tanya Y. Berger-Wolf,et al.  Sampling and inference in complex networks , 2011 .

[10]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[11]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[12]  Toshihide Ibaraki,et al.  Algorithmic Aspects of Graph Connectivity , 2008, Encyclopedia of Mathematics and its Applications.

[13]  Christos Faloutsos,et al.  Interacting viruses in networks: can both survive? , 2012, KDD.

[14]  Srinivasan Parthasarathy,et al.  Discovering frequent topological structures from graph datasets , 2005, KDD '05.

[15]  Jon M. Kleinberg,et al.  Group formation in large social networks: membership, growth, and evolution , 2006, KDD '06.

[16]  V. N. Bogaevski,et al.  Matrix Perturbation Theory , 1991 .

[17]  Michalis Faloutsos,et al.  Competing Memes Propagation on Networks: A Network Science Perspective , 2013, IEEE Journal on Selected Areas in Communications.

[18]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[19]  Tanya Y. Berger-Wolf,et al.  Benefits of bias: towards better characterization of network sampling , 2011, KDD.

[20]  Tanya Y. Berger-Wolf,et al.  Critical individuals in dynamic population networks , 2013 .

[21]  Lise Getoor,et al.  Social Capital in Friendship-Event Networks , 2006, Sixth International Conference on Data Mining (ICDM'06).

[22]  B. Aditya Prakash,et al.  Propagation and immunization in large networks , 2012, XRDS.

[23]  Chris H. Q. Ding,et al.  Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[24]  Christos Faloutsos,et al.  Rise and fall patterns of information diffusion: model and implications , 2012, KDD.

[25]  Nicholas C. Valler.  Spreading Processes on Networks: Theory and Applications , 2012 .

[26]  Masahiro Kimura,et al.  Learning Diffusion Probability Based on Node Attributes in Social Networks , 2011, ISMIS.

[27]  Christos Faloutsos,et al.  Epidemic thresholds in real networks , 2008, TSEC.

[28]  Donald F. Towsley,et al.  The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[29]  Chris H. Q. Ding,et al.  Spectral Relaxation for K-means Clustering , 2001, NIPS.

[30]  Lada A. Adamic,et al.  The very small world of the well-connected , 2008, Hypertext.

[31]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[32]  Rong Zheng,et al.  On Budgeted Influence Maximization in Social Networks , 2012, IEEE Journal on Selected Areas in Communications.

[33]  Wei-Ying Ma,et al.  Manifold-Ranking-Based Keyword Propagation for Image Retrieval , 2006, EURASIP J. Adv. Signal Process..

[34]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[35]  G. Karypis,et al.  Multilevel k-way hypergraph partitioning , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

[36]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[37]  D. R. White,et al.  Social Cohesion and Embeddedness : A Hierarchical Conception of Social Groups , 2000 .

[38]  Jiawei Han,et al.  Mining Compressed Frequent-Pattern Sets , 2005, VLDB.

[39]  Patrick Lincoln,et al.  Epidemic profiles and defense of scale-free networks , 2003, WORM '03.

[40]  Yao Zhang,et al.  Scalable Vaccine Distribution in Large Graphs given Uncertain Data , 2014, CIKM.

[41]  T. Nepusz,et al.  Fuzzy communities and the concept of bridgeness in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[42]  Andreas Krause,et al.  Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.

[43]  Hanghang Tong,et al.  Information spreading in context , 2011, WWW.

[44]  Christos Faloutsos,et al.  Fractional Immunization in Hospital-transfer Graphs , 2011 .

[45]  Yaron Singer,et al.  How to win friends and influence people, truthfully: influence maximization mechanisms for social networks , 2012, WSDM '12.

[46]  Peter Sanders,et al.  Better Approximation of Betweenness Centrality , 2008, ALENEX.

[47]  Jimeng Sun,et al.  Neighborhood formation and anomaly detection in bipartite graphs , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[48]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[49]  Christos Faloutsos,et al.  Spotting Culprits in Epidemics: How Many and Which Ones? , 2012, 2012 IEEE 12th International Conference on Data Mining.

[50]  Christos Faloutsos,et al.  Efficiently spotting the starting points of an epidemic in a large graph , 2013, Knowledge and Information Systems.

[51]  Laks V. S. Lakshmanan,et al.  SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model , 2011, 2011 IEEE 11th International Conference on Data Mining.

[52]  Herbert W. Hethcote,et al.  The Mathematics of Infectious Diseases , 2000, SIAM Rev..

[53]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[54]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[55]  Aristides Gionis,et al.  Opinion Maximization in Social Networks , 2013, SDM.

[56]  Madhav V. Marathe,et al.  Blocking Complex Contagions Using Community Structure , 2013 .

[57]  Masahiro Kimura,et al.  Learning Attribute-weighted Voter Model over Social Networks , 2011, ACML.

[58]  Vipin Kumar,et al.  Multilevel k-way hypergraph partitioning , 1999, DAC '99.

[59]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[60]  Christos Faloutsos,et al.  It's who you know: graph mining using recursive structural features , 2011, KDD.

[61]  Michalis Faloutsos,et al.  Gelling, and melting, large graphs by edge manipulation , 2012, CIKM.

[62]  Tanya Y. Berger-Wolf,et al.  Working for Influence: Effect of Network Density and Modularity on Diffusion in Networks , 2011, 2011 IEEE 11th International Conference on Data Mining Workshops.

[63]  D. R. White,et al.  Structural cohesion and embeddedness: A hierarchical concept of social groups , 2003 .

[64]  Christos Faloutsos,et al.  Fast Random Walk with Restart and Its Applications , 2006, Sixth International Conference on Data Mining (ICDM'06).

[65]  Hanghang Tong,et al.  Make It or Break It: Manipulating Robustness in Large Networks , 2014, SDM.

[66]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[67]  Reuven Cohen,et al.  Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.

[68]  Christos Faloutsos,et al.  Epidemic spreading in real networks: an eigenvalue viewpoint , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[69]  Tanya Y. Berger-Wolf,et al.  Graph Theoretic Measures for Identifying Effective Blockers of Spreading Processes in Dynamic Networks , 2008 .

[70]  Michalis Faloutsos,et al.  Threshold conditions for arbitrary cascade models on arbitrary networks , 2011, 2011 IEEE 11th International Conference on Data Mining.