Efficient algorithms for updating betweenness centrality in fully dynamic graphs

Devise an algorithm for updating betweenness centrality in fully dynamic graphs.Recalculate centrality without computing all pairs shortest paths in the entire graph.Adapt a highest centrality edge finding algorithm based on the proposed algorithm.Adapt a community detection algorithm using the proposed algorithms.Experimental results show the proposed algorithm outperforms existing algorithms. Betweenness centrality of a vertex (edge) in a graph is a measure for the relative participation of the vertex (edge) in the shortest paths in the graph. Betweenness centrality is widely used in various areas such as biology, transportation, and social networks. In this paper, we study the update problem of betweenness centrality in fully dynamic graphs. The proposed update algorithm substantially reduces the number of shortest paths which should be re-computed when a graph is changed. In addition, we adapt a community detection algorithm using the proposed algorithm to show how much benefit can be obtained from the proposed algorithm in a practical application. Experimental results on real graphs show that the proposed algorithm efficiently update betweenness centrality and detect communities in a graph.

[1]  Rami Puzis,et al.  Routing betweenness centrality , 2010, JACM.

[2]  Jimeng Sun,et al.  Centralities in Large Networks: Algorithms and Observations , 2011, SDM.

[3]  Ulrik Brandes,et al.  On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.

[4]  Matteo Pontecorvi,et al.  Betweenness Centrality - Incremental and Faster , 2013, MFCS.

[5]  Vladimir Ufimtsev,et al.  ACM SRC poster: a scalable group testing based algorithm for finding d-highest betweenness centrality vertices in large scale networks , 2011, SC '11 Companion.

[6]  L FredmanMichael,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987 .

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

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

[9]  Rishi Ranjan Singh,et al.  A Faster Algorithm to Update Betweenness Centrality after Node Alteration , 2013, WAW.

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

[11]  Dirk Helbing,et al.  Scaling laws in the spatial structure of urban road networks , 2006 .

[12]  J. Pinney,et al.  Betweenness-based decomposition methods for social and biological networks , 2006 .

[13]  Mikkel Thorup,et al.  Worst-case update times for fully-dynamic all-pairs shortest paths , 2005, STOC '05.

[14]  André Ricardo Backes,et al.  Polygonal approximation of digital planar curves through vertex betweenness , 2013, Inf. Sci..

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

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

[17]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2004, JACM.

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

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

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

[21]  Yehuda Hayuth,et al.  Spatial characteristics of transportation hubs: centrality and intermediacy , 1994 .

[22]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[23]  Loet Leydesdorff,et al.  Betweenness centrality as an indicator of the interdisciplinarity of scientific journals , 2007, J. Assoc. Inf. Sci. Technol..

[24]  David A. Bader,et al.  Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[25]  Jae-Gil Lee,et al.  Scalable community detection from networks by computing edge betweenness on MapReduce , 2014, 2014 International Conference on Big Data and Smart Computing (BIGCOMP).

[26]  Alan G. Labouseur,et al.  Efficient top-k closeness centrality search , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[27]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2003, STOC '03.

[28]  K. Norlen.  1 EVA : Extraction , Visualization and Analysis of the Telecommunications and Media Ownership Network , 2002 .

[29]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[30]  Chin-Wan Chung,et al.  Finding k-highest betweenness centrality vertices in graphs , 2014, WWW.

[31]  Adriana Iamnitchi,et al.  Identifying high betweenness centrality nodes in large social networks , 2012, Social Network Analysis and Mining.

[32]  A. Barabasi,et al.  The human disease network , 2007, Proceedings of the National Academy of Sciences.

[33]  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).

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

[35]  A. Arenas,et al.  Models of social networks based on social distance attachment. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Stefan Richter,et al.  Centrality Indices , 2004, Network Analysis.

[37]  Hai Zhuge,et al.  Communities and Emerging Semantics in Semantic Link Network: Discovery and Learning , 2009, IEEE Transactions on Knowledge and Data Engineering.

[38]  Giuseppe F. Italiano,et al.  Experimental analysis of dynamic all pairs shortest path algorithms , 2004, SODA '04.

[39]  Frank Dudbridge,et al.  The Use of Edge-Betweenness Clustering to Investigate Biological Function in Protein Interaction Networks , 2005, BMC Bioinformatics.

[40]  M. DePamphilis,et al.  HUMAN DISEASE , 1957, The Ulster Medical Journal.

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

[42]  Marc Barthelemy,et al.  Group betweenness and co-betweenness: Inter-related notions of coalition centrality , 2009, Soc. Networks.

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

[44]  Daniel J. Brass.  Being in the right place: A structural analysis of individual influence in an organization. , 1984 .

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

[46]  Pak Chung Wong,et al.  A novel application of parallel betweenness centrality to power grid contingency analysis , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[47]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

[48]  Petter Holme,et al.  Congestion and Centrality in Traffic Flow on Complex Networks , 2003, Adv. Complex Syst..