Centrality Measures Based on Current Flow

By U. Brandes, Daniel Fleischer. Symposium on Theoretical Aspects of Computer Science, 2005

425 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

DrugComboRanker: drug combination discovery based on target network analysis (2014, background): “…CS tkið Þ is the centrality score of target tki in the reconstructed disease signaling network, and it is an additive of betweenness ðBnÞ, closeness Cnð Þ (Brandes and Fleischer, 2005) and PageRank (Pr) score (Page et al., 1999) of protein tki, that is CS tkið Þ=Bn tkið Þ+Cn tkið…”
Centrality Estimation in Large Networks (2007, background): “Natural variants of closeness and betweenness are also obtained by replacing spread along shortest paths with current flow [Newman 2005, Brandes and Fleischer 2005].”
Centrality measure in graphs (2010, background): “[1,2,6,13,21,29,31,38,42,43] different efficient means have been sought [8,42,43, 47,48] for the computation of different centrality measures, further mathematical results have been enunciated [ 43 ,45,46,49,50] and comparisons of different definitions have been made [51–55].”
State of the aRt personality research: A tutorial on network analysis of personality data in R (2015, neutral): “Generalizations of betweenness centrality that account for paths other than the shortest ones have been also proposed (Brandes & Fleischer, 2005; Freeman, Borgatti, & White, 1991; Newman, 2005).”