Centrality¶
A family of graph measures that ranks vertices or edges by a declared notion of structural importance.
Core Idea¶
A centrality index maps graph positions to numerical scores using a criterion such as incident connections, shortest-path mediation, proximity, recursive prestige, diffusion, or controllability. The selected graph relation and walk model turn local or global position into a scalar, after which normalization permits comparison within the stated graph and task. 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.
Scope of Application¶
Centrality belongs to network analysis and is useful where the analyst can specify the typed network analysis carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the graph, scored entities, path or flow semantics, centrality formula, direction, weighting, and normalization are explicit and importance claims remain tied to that definition. The scope is broad within that domain but bounded by the need for the graph, scored entities, path or flow semantics, centrality formula, direction, weighting, and normalization are explicit and importance claims remain tied to that definition. 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 the graph, scored entities, path or flow semantics, centrality formula, direction, weighting, and normalization are explicit and importance claims remain tied to that definition 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 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 Centrality. 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: the typed network analysis carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the graph, scored entities, path or flow semantics, centrality formula, direction, weighting, and normalization are explicit and importance claims remain tied to that definition independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of network analysis because they reuse the typed network analysis carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, The selected graph relation and walk model turn local or global position into a scalar, after which normalization permits comparison within the stated graph and task., and type the carrier, state every parameter and convention in the definition, test that the graph, scored entities, path or flow semantics, centrality formula, direction, weighting, and normalization are explicit and importance claims remain tied to that definition, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Centrality Domain-specific
Parents (1) — more general patterns this builds on
-
Centrality is a kind of Measurement Prime
The proposed strict upward parent is
prime:measurement.
Hierarchy path (1) — routes to 1 parentless root
- Centrality → Measurement
Neighborhood in Abstraction Space¶
Centrality sits in a crowded region of the domain-specific corpus (19th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Network Evolution & Community Structure (19 abstractions)
Nearest neighbors
- Betweenness centrality — 0.93
- Modularity (networks) — 0.93
- Katz centrality — 0.92
- Homophily — 0.91
- Weighted network — 0.90
Computed from structural-signature embeddings · 2026-09-08