Fully Dynamic Betweenness Centrality Maintenance on Massive Networks

Measuring the relative importance of each vertex in a network is one of the most fundamental building blocks in network analysis. Among several importance measures, betweenness centrality, in particular, plays key roles in many real applications. Considerable effort has been made for developing algorithms for static settings. However, real networks today are highly dynamic and are evolving rapidly, and scalable dynamic methods that can instantly reflect graph changes into centrality values are required. In this paper, we present the first fully dynamic method for managing betweenness centrality of all vertices in a large dynamic network. Its main data structure is the weighted hyperedge representation of shortest paths called hypergraph sketch. We carefully design dynamic update procedure with theoretical accuracy guarantee. To accelerate updates, we further propose two auxiliary data structures called two-ball index and special-purpose reachability index. Experimental results using real networks demonstrate its high scalability and efficiency. In particular, it can reflect a graph change in less than a millisecond on average for a large-scale web graph with 106M vertices and 3.7B edges, which is several orders of magnitude larger than the limits of previous dynamic methods.

[1]  David A. Bader,et al.  A Fast Algorithm for Streaming Betweenness Centrality , 2012, 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing.

[2]  Christian Staudt,et al.  Approximating Betweenness Centrality in Large Evolving Networks , 2014, ALENEX.

[3]  Evgenios M. Kornaropoulos,et al.  Fast approximation of betweenness centrality through sampling , 2014, Data Mining and Knowledge Discovery.

[4]  Ryan H. Choi,et al.  QUBE: a quick algorithm for updating betweenness centrality , 2012, WWW.

[5]  Azer Bestavros,et al.  A Divide-and-Conquer Algorithm for Betweenness Centrality , 2014, SDM.

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

[7]  Marco Rosa,et al.  Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks , 2010, WWW.

[8]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.

[9]  Yuichi Yoshida,et al.  Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches , 2014, KDD.

[10]  Miriam Baglioni,et al.  Fast Exact Computation of betweenness Centrality in Social Networks , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[11]  David A. Bader,et al.  Approximating Betweenness Centrality , 2007, WAW.

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

[13]  Kathleen M. Carley,et al.  Incremental algorithm for updating betweenness centrality in dynamically growing networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[14]  Antonio del Sol,et al.  Topology of small-world networks of protein?Cprotein complex structures , 2005, Bioinform..

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

[16]  Sibo Wang,et al.  Reachability queries on large dynamic graphs: a total order approach , 2014, SIGMOD Conference.

[17]  Francesco Bonchi,et al.  Scalable online betweenness centrality in evolving graphs , 2016, ICDE.

[18]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

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

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

[21]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[22]  Albert-László Barabási,et al.  The origin of bursts and heavy tails in human dynamics , 2005, Nature.

[23]  Ulrik Brandes,et al.  Heuristics for Speeding Up Betweenness Centrality Computation , 2012, 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing.

[24]  Valdis E. Krebs,et al.  Mapping Networks of Terrorist Cells , 2001 .

[25]  Thomas Reps,et al.  On the Computational Complexity of Incremental Algorithms , 2016 .

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

[27]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[28]  J. Anthonisse.  The rush in a directed graph , 1971 .

[29]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[30]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[31]  Sherry Marcus,et al.  Graph-based technologies for intelligence analysis , 2004, CACM.

[32]  M. Barthelemy.  Betweenness centrality in large complex networks , 2003, cond-mat/0309436.

[33]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[34]  Reza Zafarani,et al.  Social Media Mining: An Introduction , 2014 .

[35]  Mohammed J. Zaki,et al.  DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs , 2013, ArXiv.

[36]  Marlon Dumas,et al.  Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs , 2011, CIKM '11.

[37]  Takuya Akiba,et al.  Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling , 2014, WWW.

[38]  Ulrik Brandes,et al.  Centrality Estimation in Large Networks , 2007, Int. J. Bifurc. Chaos.