Small-world network¶

A network combining high local clustering with short typical path lengths, often comparable to a regular lattice locally and a random graph globally.

Version: v1 · 2026-09-08 · History
Domain-specific #: 6774
Origin domain: network science
Subdomain: network topology

Core Idea¶

A small-world network is a graph whose neighbors cluster strongly while most vertex pairs remain connected by only a few steps. A largely local edge pattern creates clustered neighborhoods, while a relatively small number of long-range shortcuts sharply lowers global path lengths. 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 coexistence of lattice-like local cohesion and random-like global reachability. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that clustering and path-length statistics are jointly evaluated relative to explicit size-, density- or degree-matched reference graphs fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

Scope of Application¶

Small-world network belongs to network science and is useful where the analyst can specify a graph with vertices and edges, degree and size, local clustering coefficient, shortest-path distances, characteristic path length, comparison null model, rewiring or shortcut edges and connected components, then evaluate clustering and path-length statistics are jointly evaluated relative to explicit size-, density- or degree-matched reference graphs. The scope is broad within that domain but bounded by the need for clustering and path-length statistics are jointly evaluated relative to explicit size-, density- or degree-matched reference graphs. 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 clustering and path-length statistics are jointly evaluated relative to explicit size-, density- or degree-matched reference graphs 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 Small-world network 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 Small-world network. Small-world network 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 edges, degree and size, local clustering coefficient, shortest-path distances, characteristic path length, comparison null model, rewiring or shortcut edges and connected components. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express clustering and path-length statistics are jointly evaluated relative to explicit size-, density- or degree-matched reference graphs independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of network science because they reuse a graph with vertices and edges, degree and size, local clustering coefficient, shortest-path distances, characteristic path length, comparison null model, rewiring or shortcut edges and connected components, A largely local edge pattern creates clustered neighborhoods, while a relatively small number of long-range shortcuts sharply lowers global path lengths., and type the carrier, state every parameter and convention in the definition, test that clustering and path-length statistics are jointly evaluated relative to explicit size-, density- or degree-matched reference graphs, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Small-world network Domain-specific

Parents (1) — more general patterns this builds on

Small-world network is a kind of Systems Thinking Prime

The proposed strict upward parent is prime:systems_thinking.

Hierarchy paths (3) — routes to 3 parentless roots

Small-world network → Systems Thinking → Emergence → Micro Macro Linkage

Show alternative paths (2)

Neighborhood in Abstraction Space¶

Small-world network sits in a crowded region of the domain-specific corpus (29^th 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