Skip to content

Katz centrality

A network score summing all walks ending at a node with geometrically decreasing weight plus an exogenous baseline.

Version
v1 · 2026-09-08 · History
Domain-specific #
5181
Origin domain
network analysis
Subdomain
network analysis

Core Idea

For adjacency matrix A, Katz centrality solves x equals alpha A x plus beta, equivalently an inverse linear system, with attenuation alpha below the reciprocal spectral radius. Walk contributions propagate influence recursively; attenuation makes long walks progressively smaller and the baseline gives nonzero score even to nodes without incoming prestige. 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

Katz 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 edge direction, adjacency orientation, attenuation, baseline vector, spectral convergence condition, and normalization are explicit. The scope is broad within that domain but bounded by the need for edge direction, adjacency orientation, attenuation, baseline vector, spectral convergence condition, and normalization are explicit. 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 edge direction, adjacency orientation, attenuation, baseline vector, spectral convergence condition, and normalization are explicit 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 Katz 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 Katz centrality. Katz 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

  1. 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 edge direction, adjacency orientation, attenuation, baseline vector, spectral convergence condition, and normalization are explicit 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, Walk contributions propagate influence recursively; attenuation makes long walks progressively smaller and the baseline gives nonzero score even to nodes without incoming prestige., and type the carrier, state every parameter and convention in the definition, test that edge direction, adjacency orientation, attenuation, baseline vector, spectral convergence condition, and normalization are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Local relationship map for Katz centralityParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Katz centralityDOMAINPrime abstraction: Propagation — is a kind ofPropagationPRIME

Current abstraction Katz centrality Domain-specific

Parents (1) — more general patterns this builds on

  • Katz centrality is a kind of Propagation Prime

    The proposed strict upward parent is prime:propagation.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Katz centrality sits in a crowded region of the domain-specific corpus (34th 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

Computed from structural-signature embeddings · 2026-09-08