Centrality Measures Based on Current Flow

Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths only, it is assumed that information spreads efficiently like an electrical current. We prove that the current-flow variant of closeness centrality is identical with another known measure, information centrality, and give improved algorithms for computing both measures exactly. Since running times and space requirements are prohibitive for large networks, we also present a randomized approximation scheme for current-flow betweenness.

• Type: Conference
• Year: 2005
• Where: STACS
• Authors: Ulrik Brandes, Daniel Fleischer
• Keywords: Closeness Centrality, Information Spreads, STACS 2005, Theoretical Computer Science, Well-known Centrality Measures