Skip to Main content Skip to Navigation
New interface
Conference papers

Alpha current flow betweenness centrality

Abstract : A class of centrality measures called betweenness centralities reflects degree of participation of edges or nodes in communication between different parts of the network. The original shortest-path betweenness centrality is based on counting shortest paths which go through a node or an edge. One of shortcomings of the shortest-path betweenness centrality is that it ignores the paths that might be one or two hops longer than the shortest paths, while the edges on such paths can be important for communication processes in the network. To rectify this shortcoming a current flow betweenness centrality has been proposed. Similarly to the shortest-path betweenness, it has prohibitive complexity for large size networks. In the present work we propose two regularizations of the current flow betweenness centrality, $\alpha$-current flow betweenness and truncated $\alpha$-current flow betweenness, which can be computed fast and correlate well with the original current flow betweenness.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Konstantin Avrachenkov Connect in order to contact the contributor
Submitted on : Thursday, January 9, 2014 - 3:37:35 PM
Last modification on : Thursday, January 20, 2022 - 4:12:22 PM
Long-term archiving on: : Thursday, April 10, 2014 - 11:00:29 AM


Files produced by the author(s)




Konstantin Avrachenkov, Nelly Litvak, Vasily Medyanikov, Marina Sokol. Alpha current flow betweenness centrality. WAW - 10th International Workshop on Algorithms and Models for the Web Graph, Dec 2013, Cambridge, Massachusetts, United States. pp.106-117, ⟨10.1007/978-3-319-03536-9_9⟩. ⟨hal-00926438⟩



Record views


Files downloads