betweennesssentralitet
Betweennesscentralitet, or betweenness centrality, is a measure in network analysis that quantifies how often a node lies on the shortest paths between pairs of other nodes. It reflects a node’s role as a bridge or broker in facilitating communication or flow through the network.
For a given graph, let σ_st be the number of shortest paths from node s to node
Computation is commonly performed with Brandes’ algorithm, which computes betweenness in O(nm) time for unweighted graphs
Interpretation and limitations: a high betweenness score indicates that a node often serves as a bridge, potentially