On variants of shortest-path betweenness centrality and their generic computation

By U. Brandes. Soc. Networks, 2008

974 citations recorded by the source corpus.

Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of the algorithm commonly used for the standard case.

Subfields: Computer Networks and Communications, Geometry and Topology, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/2114078c887ebba6a81a8c5d1f0d7bb8f622f433

How researchers see this paper

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

In Computer Networks and Communications

In Geometry and Topology

In Statistical and Nonlinear Physics

Citations in the corpus

State of the aRt personality research: A tutorial on network analysis of personality data in R (2015, positive): “4 Degree centrality can be also easily extended to directed networks, by considering separately the number of incoming ties ( indegree ) and the number of outgoing ties ( outdegree ). inverse value (Brandes, 2008; Opsahl, Agneessens, & Skvoretz, 2010).”
Closeness Centrality Extended to Unconnected Graphs: the Harmonic Centrality Index (2009, background): “…gjk(i) the number of geodesic from xj to xk containing xi, the double sum being calculated on all pairs (j, k) such that j 6= i 6= k and j < k. Ulrik Brandes studied it in depth and provided an algorithm reducing computation time along with some variations (Brandes et al. , 2006; Brandes, 2008).”
Exploring the structure of the U.S. intercity passenger air transportation network: a weighted complex network approach (2008, methodology): “A global measure of the centrality of vertices or edges characterizing their betweenness has been used to characterize the role of vertices or edges in control of the communication in networks ( Brandes 2001, 2008; Freeman 1977 ;N ewman 2001 ;N ewman and Girvan2004).”
Node centrality in weighted networks: Generalizing degree and shortest paths (2010, methodology): “Both Newman (2001) and Brandes (2001) separately proposed to invert the tie weights while extending closeness and betweenness centrality, respectively.2 In so doing, the weights can be considered as costs since high values represented weak or costly ties, whereas low values represented strong or che”
Study on centrality measures in social networks: a survey (2018, methodology): “Betweenness centrality was used by Chen (2006) in the scientific literature and applied to weighted coauthorship network by Liu et al. (2007). Centrality measures were applied to impact analysis to co-authorship network analyzed by Yan and Ding (2009).”
Throughput-Optimal Topology Design for Cross-Silo Federated Learning (2020, methodology): “3 These overlays are (1) the STAR, corresponding to the usual server-client setting, where the orchestrator (located at the node with the highest load centrality [11]) averages all models at each communication round, (2) a dynamic topology built from MATCHA starting from the connectivity graph, (3) ”