Efficient Closeness Centrality Computation for Dynamic Graphs

As a classic metric, closeness centrality can measure the importance of a node in a graph by its proximity to the other nodes. However, exactly calculating closeness centrality of all nodes is significantly time-consuming. Besides, graphs usually evolve with inserted and/or deleted edges, which exacerbates the performance issue if we recompute results from scratch. The paper proposes a preliminary algorithm for calculating exact closeness centrality by using biconnected components and articulation points. Firstly, a large graph is divided into a series of biconnected components which are connected by articulation points. Then distance between arbitrary nodes on the whole graph can be converted into multiple distances between different biconnected components. We further propose an incremental update technique to dynamically maintain the computation results when graphs are changing, like inserting and/or deleting edges, by efficiently detecting all the affected shortest paths to update the closeness centrality based on articulation points. We finally conduct extensive experiments over real graphs to validate the efficiency and effectiveness of our techniques.

[1]  Sebastiano Vigna,et al.  Axioms for Centrality , 2013, Internet Math..

[2]  Akrati Saxena,et al.  Estimating the degree centrality ranking , 2016, 2016 8th International Conference on Communication Systems and Networks (COMSNETS).

[3]  Takuya Akiba,et al.  Random-Radius Ball Method for Estimating Closeness Centrality , 2017, AAAI.

[4]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[5]  Panos Kalnis,et al.  Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs , 2018, IEEE Transactions on Parallel and Distributed Systems.

[6]  Andrea Marino,et al.  Computing top-k Closeness Centrality Faster in Unweighted Graphs , 2019, TKDD.

[7]  Ming-Syan Chen,et al.  An Efficient Approach to Updating Closeness Centrality and Average Path Length in Dynamic Networks , 2013, 2013 IEEE 13th International Conference on Data Mining.

[8]  Edith Cohen,et al.  Computing classic closeness centrality, at scale , 2014, COSN '14.

[9]  Chenxu Wang,et al.  An Efficient Approximation of Betweenness Centrality for Uncertain Graphs , 2019, IEEE Access.

[10]  Eunice E. Santos,et al.  Efficient Anytime Anywhere Algorithms for Closeness Centrality in Large and Dynamic Graphs , 2016, 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW).

[11]  A. Carbaugh,et al.  Retracted: Extracting information based on partial or complete network data , 2018 .

[12]  O. Sporns,et al.  Identification and Classification of Hubs in Brain Networks , 2007, PloS one.

[13]  Francisco Pedroche,et al.  An Eigenvector Centrality for Multiplex Networks with Data , 2019, Symmetry.

[14]  Kathleen M. Carley,et al.  Incremental closeness centrality for dynamically changing social networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[15]  Vecdi Aytaç,et al.  Closeness centrality in some splitting networks , 2018, Comput. Sci. J. Moldova.

[16]  Junhao Wen,et al.  Fundus Image Classification Using VGG-19 Architecture with PCA and SVD , 2018, Symmetry.

[17]  Kwanghoon Pio Kim,et al.  An Estimated Closeness Centrality Ranking Algorithm and Its Performance Analysis in Large-Scale Workflow-supported Social Networks , 2016, KSII Trans. Internet Inf. Syst..

[18]  Henning Meyerhenke,et al.  Computing Top-k Closeness Centrality in Fully-dynamic Graphs , 2017, ALENEX.

[19]  C. E. Veni Madhavan,et al.  Understanding Human Navigation Using Network Analysis , 2012, Top. Cogn. Sci..

[20]  Ümit V. Çatalyürek,et al.  Incremental algorithms for closeness centrality , 2013, 2013 IEEE International Conference on Big Data.

[21]  Kun Zhang,et al.  Eigenvector Centrality Measure Based on Node Similarity for Multilayer and Temporal Networks , 2019, IEEE Access.

[22]  Ümit V. Çatalyürek,et al.  Incremental closeness centrality in distributed memory , 2015, Parallel Comput..

[23]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Tao Guo,et al.  Distributed Algorithms on Exact Personalized PageRank , 2017, SIGMOD Conference.

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