Finding Top-k Shortest Path Distance Changes in an Evolutionary Network

Networks can be represented as evolutionary graphs in a variety of spatio-temporal applications. Changes in the nodes and edges over time may also result in corresponding changes in structural garph properties such as shortest path distances. In this paper, we study the problem of detecting the top-k most significant shortest-path distance changes between two snapshots of an evolving graph. While the problem is solvable with two applications of the all-pairs shortest path algorithm, such a solution would be extremely slow and impractical for very large graphs. This is because when a graph may contain millions of nodes, even the storage of distances between all node pairs can become inefficient in practice. Therefore, it is desirable to design algorithms which can directly determine the significant changes in shortest path distances, without materializing the distances in individual snapshots. We present algorithms that are up to two orders of magnitude faster than such a solution, while retaining comparable accuracy.

[1]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[2]  Norio Shiratori,et al.  A dynamic multicast routing satisfying multiple QoS constraints , 2003, Int. J. Netw. Manag..

[3]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[4]  Monika Henzinger,et al.  Maintaining Minimum Spanning Forests in Dynamic Graphs , 2001, SIAM J. Comput..

[5]  Charu C. Aggarwal,et al.  Social Network Data Analytics , 2011 .

[6]  Shan Zhu,et al.  A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks , 1998, IEEE Trans. Parallel Distributed Syst..

[7]  Christos Faloutsos,et al.  oddball: Spotting Anomalies in Weighted Graphs , 2010, PAKDD.

[8]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

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

[10]  Uri Zwick,et al.  On Dynamic Shortest Paths Problems , 2004, Algorithmica.

[11]  Andrew V. Goldberg,et al.  Buckets, heaps, lists, and monotone priority queues , 1997, SODA '97.

[12]  Jeffrey Xu Yu,et al.  Finding time-dependent shortest paths over large graphs , 2008, EDBT '08.

[13]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[14]  Susanne Albers,et al.  Algorithms – ESA 2004 , 2004, Lecture Notes in Computer Science.

[15]  Norio Shiratori,et al.  A dynamic multicast routing satisfying multiple QoS constraints , 2003 .

[17]  Lawrence B. Holder,et al.  Discovering Structural Anomalies in Graph-Based Data , 2007 .

[18]  F. Stokman.  Evolution of social networks , 1997 .

[19]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[20]  Edith Cohen,et al.  Estimating the size of the transitive closure in linear time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[21]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[23]  Ismail Chabini,et al.  Parallel Algorithms for Dynamic Shortest Path Problems , 2002 .

[24]  Divyakant Agrawal,et al.  FATES: Finding A Time dEpendent Shortest path , 2003, Mobile Data Management.

[25]  Lawrence B. Holder,et al.  Discovering Structural Anomalies in Graph-Based Data , 2007, Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007).

[26]  A. Shimbel.  Structural parameters of communication networks , 1953 .

[27]  Maria Grazia Scutellà,et al.  Dynamic shortest paths minimizing travel times and costs , 2001, Networks.

[28]  Hector Garcia-Molina,et al.  Web graph similarity for anomaly detection (poster) , 2008, WWW.

[29]  Deepayan Chakrabarti,et al.  Evolutionary clustering , 2006, KDD '06.