A Faster Algorithm to Update Betweenness Centrality after Node Alteration
Betweenness centrality is a centrality measure that is widely used, with applications across several disciplines. It is a measure which quantifies the importance of a vertex based on its occurrence in shortest paths between all possible pairs of vertices in a graph. This is a global measure, and in order to find the betweenness centrality of a node, one is supposed to have complete information about the graph. Most of the algorithms that are used to find betwenness centrality assume the constancy of the graph and are not efficient for dynamic networks. We propose a technique to update betweenness centrality of a graph when nodes are added or deleted. Our algorithm experimentally speeds up the calculation of betweenness centrality (after updation) from 7 to 412 times, for real graphs, in comparison to the currently best known technique to find betweenness centrality.
KeywordsBetweenness Centrality Minimum Cycle Basis Bi-connected Components
Unable to display preview. Download preview PDF.
- 1.Anthonisse, J.M.: The rush in a directed graph. Technical Report BN 9/71, Stichting Mathematisch Centrum, Amsterdam (1971)Google Scholar
- 2.Bader, D.A., Madduri, K.: Parallel algorithms for evaluating centrality indices in real-world networks. In: Proceedings of the 2006 International Conference on Parallel Processing, ICPP 2006, pp. 539–550 (2006)Google Scholar
- 8.Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 90–100. SIAM (2008)Google Scholar
- 9.Green, O., McColl, R., Bader, D.A.: A fast algorithm for streaming betweenness centrality. In: 2012 ASE/IEEE International Conference on Social Computing and 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust (2012)Google Scholar
- 11.Hanna, A.: Revolutionary Making and Self-Understanding: The Case of #Jan25 and Social Media Activism. Presented at Meeting of the International Studies Association, San Diego, CA (2012)Google Scholar
- 13.Jackson, M.O.: Social and Economic Networks. Princeton University Press (2010)Google Scholar
- 15.Lee, M.J., Lee, J., Park, J.Y., Choi, R.H., Chung, C.W.: QUBE: a Quick algorithm for Updating BEtweenness centrality. In: Proceedings of the 21st International Conference on World Wide Web, pp. 351–360 (2012)Google Scholar
- 18.Narayanan, S.: The Betweenness Centrality of Biological Networks. M. Sc. Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University (2005)Google Scholar
- 21.Reitz, J.M.: ODLIS: Online Dictionary of Library and Information Science (2002)Google Scholar
- 25.Spiliotopoulos, T., Oakley, I.: Applications of Social Network Analysis for User Modeling. In: International Workshop on User Modeling from Social Media / IUI 2012 (2012)Google Scholar
- 27.Website of National Cancer Institute, http://www.cancer.gov