A graph-theoretic measure of a node's importance defined as the sum (or normalized sum) over all ordered pairs of the fraction of shortest paths between the pair that pass through the node; quantifies the node's role as a connector or bridge in shortest-path routing.

Principle

For each ordered pair of distinct vertices (s,t) count σ_st total shortest paths and σ_st(v) those that pass through v; betweenness is Σ_{s≠v≠t} σ_st(v)/σ_st, optionally normalized by the number of vertex pairs.

Demonstration

In a simple network of two dense clusters connected by a single intermediary node, that intermediary has high betweenness because most shortest paths connecting nodes in different clusters traverse it.

Misapplication

Applying betweenness unmodified to contexts where flows do not follow shortest paths (e.g., random-walk routing) or failing to account for edge weights and disconnected components when computing shortest paths.

Consequence

High-betweenness nodes identify bridges, potential bottlenecks, or control points for information or flow between regions of the network; their removal often greatly increases path lengths or disconnects components.

Reversal

Degree centrality measures local connectivity by counting immediate neighbors, contrasting with betweenness which measures global brokerage across shortest paths.

Boundary

Defined for networks where shortest-path metrics are meaningful; excludes influence measures based on diffusion dynamics, capacity-constrained flows, or contexts where multi-path routing dominates unless appropriately adapted.

Semantic Tension

Close in intent to 'bridging' notions like edge cut or modularity boundary nodes, but betweenness specifically quantifies mediation of shortest-path geodesics rather than community membership or flow volume.

Synthesis

Betweenness centrality aggregates how often a node lies on shortest routes between other nodes, providing a global measure of its brokerage role in connecting different parts of a network.