On the eigen‐functions of dynamic graphs: Fast tracking and attribution algorithms

Eigen-functions are of key importance in graph mining since they can be used to approximate many graph parameters, such as node centrality, epidemic threshold, graph robustness, with high accuracy. As real-world graphs are changing over time, those parameters may get sharp changes correspondingly. Taking virus propagation network for example, new connections between infected and susceptible people appear all the time, and some of the crucial infections may lead to large decreasing on the epidemic threshold of the network. As a consequence, the virus would spread around the network quickly. However, if we can keep track of the epidemic threshold as the graph structure changes, those crucial infections would be identified timely so that counter measures can be taken proactively to contain the spread process. In our paper, we propose two online eigen-functions tracking algorithms which can effectively monitor those key parameters with linear complexity. Furthermore, we propose a general attribution analysis framework which can be used to identify important structural changes in the evolving process. In addition, we introduce an error estimation method for the proposed eigen-functions tracking algorithms to estimate the tracking error at each time stamp. Finally, extensive evaluations are conducted to validate the effectiveness and efficiency of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Statistical Analysis and Data Mining: The ASA Data Science Journal, 2016

[1]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[2]  I. Frisch,et al.  Analysis and Design of Survivable Networks , 1970 .

[3]  Jingrui He,et al.  On the Connectivity of Multi-layered Networks: Models, Measures and Optimal Control , 2015, 2015 IEEE International Conference on Data Mining.

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

[5]  Wu Jun,et al.  Natural Connectivity of Complex Networks , 2010 .

[6]  M. Newman.  Mathematics of networks , 2018, Oxford Scholarship Online.

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

[8]  Ernesto Estrada,et al.  Network robustness to targeted attacks. The interplay of expansibility and degree distribution , 2006 .

[9]  G. Stewart,et al.  Matrix Perturbation Theory , 1990 .

[10]  Charu C. Aggarwal,et al.  Evolutionary Network Analysis , 2014, ACM Comput. Surv..

[11]  H. Stanley,et al.  Networks formed from interdependent networks , 2011, Nature Physics.

[12]  Alessandro Vespignani,et al.  Complex networks: The fragility of interdependency , 2010, Nature.

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

[14]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[15]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .

[16]  Charalampos E. Tsourakakis.  Counting triangles in real-world networks using projections , 2011, Knowledge and Information Systems.

[17]  Harry Eugene Stanley,et al.  Cascade of failures in coupled network systems with multiple support-dependent relations , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

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

[20]  Petros Drineas,et al.  On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning , 2005, J. Mach. Learn. Res..

[21]  Hanghang Tong,et al.  MET: A Fast Algorithm for Minimizing Propagation in Large Graphs with Small Eigen-Gaps , 2015, SDM.

[22]  Christos Faloutsos,et al.  Monitoring Network Evolution using MDL , 2008, 2008 IEEE 24th International Conference on Data Engineering.

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

[24]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[25]  Christos Faloutsos,et al.  Fast Robustness Estimation in Large Social Graphs: Communities and Anomaly Detection , 2012, SDM.

[26]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[27]  Harry Eugene Stanley,et al.  Robustness of a Network of Networks , 2010, Physical review letters.

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

[29]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[30]  Philip S. Yu,et al.  Fast Monitoring Proximity and Centrality on Time‐evolving Bipartite Graphs , 2008, Stat. Anal. Data Min..

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

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

[33]  Jorma Rissanen,et al.  The Minimum Description Length Principle in Coding and Modeling , 1998, IEEE Trans. Inf. Theory.

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

[35]  F. Harary,et al.  The spectral approach to determining the number of walks in a graph , 1979 .

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

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

[38]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[39]  Yihong Gong,et al.  Incremental spectral clustering by efficiently updating the eigen-system , 2010, Pattern Recognit..

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

[41]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[42]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[43]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[44]  S. Havlin,et al.  Interdependent networks: reducing the coupling strength leads to a change from a first to second order percolation transition. , 2010, Physical review letters.

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

[46]  Christos Faloutsos,et al.  EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs , 2009, 2009 IEEE International Conference on Data Mining Workshops.

[47]  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..

[48]  Hanghang Tong,et al.  Cheetah: Fast Graph Kernel Tracking on Dynamic Graphs , 2015, SDM.

[49]  Christos Faloutsos,et al.  Estimating robustness in large social graphs , 2014, Knowledge and Information Systems.

[50]  Christos Faloutsos,et al.  On the Vulnerability of Large Graphs , 2010, 2010 IEEE International Conference on Data Mining.

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

[52]  Philip S. Yu,et al.  Fast Monitoring Proximity and Centrality on Time-evolving Bipartite Graphs , 2008 .

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

[54]  Leman Akoglu,et al.  Where Graph Topology Matters: The Robust Subgraph Problem , 2015, SDM.

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

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

[57]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[58]  Hisashi Kashima,et al.  Eigenspace-based anomaly detection in computer systems , 2004, KDD.

[59]  Charalampos E. Tsourakakis.  Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws , 2008, 2008 Eighth IEEE International Conference on Data Mining.

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

[61]  Arunabha Sen,et al.  Identification of K most vulnerable nodes in multi-layered network using a new model of interdependency , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).