Betweenness centrality¶

A network centrality measure equal to the fraction or count of shortest paths between other vertices that pass through a given vertex or edge.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3445
Domain group: Interdisciplinary & Synthetic
Origin domain: Systems Thinking & Cybernetics
Subdomains: Network Science, Centrality Measures → Systems Thinking & Cybernetics

Core Idea¶

Betweenness centrality measures how often an element lies on geodesic paths connecting other elements. For each source-target pair, the share of their shortest paths containing the focal element is accumulated and optionally normalized. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of network science. It is geodesic-brokerage measure of structural mediation in networks. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that shortest-path metric, directedness, weights, endpoint treatment and normalization are declared fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

How would you explain it like I'm…

The Middle-of-the-Path Score

Think of kids passing notes in a classroom, always using the quickest route. Some kids sit in the middle, so lots of notes have to go through them. Betweenness centrality is a score for how often someone sits on those quickest paths between other people.

The Go-Between Score

A network is a bunch of things (like people or cities) connected by links (like friendships or roads). Betweenness centrality measures how often one point sits on the shortest routes between other pairs of points. You look at every pair, find their shortest routes, and give the point credit for the share of those routes that pass through it. A point with high betweenness is like a bridge or a go-between: if it disappeared, lots of trips would get longer. It is different from just having many friends, since a person can have few friends but still connect two separate groups.

Shortest-Path Broker Measure

Betweenness centrality measures how much a node acts as a broker in a network by lying on shortest paths (geodesics) between other nodes. For every source–target pair, you compute what fraction of their shortest paths pass through the focal node, and then sum those fractions; the total can be normalized to compare networks of different sizes. It differs from degree centrality, which only counts direct connections. The number depends on several choices you must state: how path length is measured, whether links have direction, whether they have weights, whether the endpoints themselves count, and how you normalize. Changing any of these can change which node looks most central.

Betweenness centrality quantifies structural mediation: for a focal element v, it sums over source–target pairs (s, t) the share of s–t geodesics that pass through v, i.e., C_B(v) = Σ_{s≠v≠t} σ_st(v)/σ_st, optionally normalized. It is thus a geodesic-brokerage measure, capturing how much flow along shortest paths would depend on v. The measure is fully specified only when the shortest-path metric, directedness, edge weights (and how they convert to lengths), endpoint treatment and normalization are declared. It is distinct from degree centrality (local connectivity) and closeness centrality (average distance), and it assumes that the relevant traffic follows shortest paths, which may not hold for diffusion processes. Interpreting a high score as 'importance' is valid only under those shortest-path and specification assumptions.

Scope of Application¶

Betweenness centrality belongs to network science and is useful where the analyst can specify a graph with vertices and weighted or unweighted edges, all-pairs shortest paths, path multiplicities, focal vertex or edge, endpoint convention and normalization, then evaluate shortest-path metric, directedness, weights, endpoint treatment and normalization are declared. The scope is broad within that domain but bounded by the need for shortest-path metric, directedness, weights, endpoint treatment and normalization are declared. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making shortest-path metric, directedness, weights, endpoint treatment and normalization are declared the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Betweenness centrality can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Betweenness centrality. Betweenness centrality compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: a graph with vertices and weighted or unweighted edges, all-pairs shortest paths, path multiplicities, focal vertex or edge, endpoint convention and normalization. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express shortest-path metric, directedness, weights, endpoint treatment and normalization are declared independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of network science because they reuse a graph with vertices and weighted or unweighted edges, all-pairs shortest paths, path multiplicities, focal vertex or edge, endpoint convention and normalization, For each source-target pair, the share of their shortest paths containing the focal element is accumulated and optionally normalized., and type the carrier, state every parameter and convention in the definition, test that shortest-path metric, directedness, weights, endpoint treatment and normalization are declared, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Betweenness centrality Domain-specific

Parents (1) — outgoing typed relations

Betweenness centrality is a kind of Measurement Prime

The statistic measures network mediation by path counts.

Hierarchy path (1) — routes to 1 parentless root

Betweenness centrality → is a kind of Measurement

Neighborhood in Abstraction Space¶

Betweenness centrality sits in a crowded region of the domain-specific corpus (9^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Network Structure & Centrality (12 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25