Modularity (networks)¶
A network-quality measure comparing the observed density of within-community edges with the density expected under a declared null model.
Core Idea¶
Modularity scores a vertex partition using observed adjacency and expected connections, often under the configuration model; optimization supports community detection but has resolution limits and degeneracy. For each vertex pair, observed connection weight minus null-model expectation is counted when both vertices share a community, then normalized by total edge weight. 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¶
Modularity (networks) belongs to network science and is useful where the analyst can specify the typed network science carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the graph and weights, partition, null model, expected-edge term, normalization, directed or signed convention, optimization method and resolution and uncertainty limits are explicit. The scope is broad within that domain but bounded by the need for the graph and weights, partition, null model, expected-edge term, normalization, directed or signed convention, optimization method and resolution and uncertainty limits 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 the graph and weights, partition, null model, expected-edge term, normalization, directed or signed convention, optimization method and resolution and uncertainty limits 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 Modularity (networks) 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 Modularity (networks). Modularity (networks) 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 science 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 and weights, partition, null model, expected-edge term, normalization, directed or signed convention, optimization method and resolution and uncertainty limits are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of network science because they reuse the typed network science carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, For each vertex pair, observed connection weight minus null-model expectation is counted when both vertices share a community, then normalized by total edge weight., and type the carrier, state every parameter and convention in the definition, test that the graph and weights, partition, null model, expected-edge term, normalization, directed or signed convention, optimization method and resolution and uncertainty limits are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Modularity (networks) Domain-specific
Parents (1) — more general patterns this builds on
-
Modularity (networks) is a kind of Modularity Prime
The proposed strict upward parent is
prime:modularity.
Hierarchy path (1) — routes to 1 parentless root
- Modularity (networks) → Modularity → Decomposition
Neighborhood in Abstraction Space¶
Modularity (networks) sits in a crowded region of the domain-specific corpus (3rd 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
- Fitness model (network theory) — 0.95
- Community structure — 0.95
- Weighted network — 0.94
- Louvain method — 0.93
- Centrality — 0.93
Computed from structural-signature embeddings · 2026-09-08