Blockmodel¶
A reduced network representation that groups nodes into positions and summarizes ties within and between those groups as blocks.
Core Idea¶
A blockmodel is the position-level object produced when a network is compressed by relational pattern. First the vertices are assigned to positions according to a declared equivalence or fitting criterion. Then ties within and between positions are represented as blocks, commonly visible as submatrices of a reordered adjacency matrix. The reduced image records how positions relate, making a large network's role structure easier to inspect.
The output should not be confused with blockmodeling, the family of procedures that constructs or fits it. Nor is every community partition already a blockmodel; relational blocks must be represented. Choice of structural versus regular equivalence, deterministic versus stochastic fit, and treatment of missing or noisy ties can change the image. An employee knowledge-flow study supplies an actual use, but its position labels remain interpretations of observed relations, not an identity assigned to every person independent of the network.
How would you explain it like I'm…
The Tiny Who-Talks Map
Groups by How People Connect
Position-Level Network Image
Scope of Application¶
These uses concern a reduced relational network object, not its fitting algorithm.
- Social-network analysis. Represent positions and their between-group ties.
- Organizational knowledge flow. Compare cohesive and core–periphery structures in observed networks.
- Method comparison. Inspect how equivalence criteria change the same network's model.
- Model criticism. Trace what actor-level ties a blockimage omits.
Clarity¶
Specify the source network, position grouping rule, within- and between-group tie blocks, and reduced image. A list of communities is the closest miss: it groups nodes without representing their relational blocks. A raw adjacency matrix has ties but not position-level reduction. Structural and regular equivalence can yield different images; role names depend on the chosen fit and observed ties rather than inhering permanently in people.
Manages Complexity¶
A blockmodel turns many individual ties into a smaller matrix of position relations, revealing broad patterns without scanning every edge. This can make comparisons possible while hiding exceptions, sampling errors, and criterion sensitivity; the compact image must remain linked to the source network and fit assumptions.
Abstract Reasoning¶
- Identify the vertices and measured relation type.
- State whether positions use structural, regular, stochastic, or another criterion.
- Group vertices and identify the resulting within/between submatrices.
- Build the reduced position-level tie image.
- Check residual ties and sensitivity before naming social roles or consequences.
Knowledge Transfer¶
The node-position-block-image relation transfers among friendship, collaboration, and knowledge-flow networks if each supplies its own relation and fit criterion. A specific employee core–periphery interpretation cannot be imposed on another network; clustering without block ties is not enough.
Relationships to Other Abstractions¶
Current abstraction Blockmodel Domain-specific
Parents (1) — more general patterns this builds on
-
Blockmodel is a kind of Representation Prime
A blockmodel maps a detailed network into a position-and-block medium, preserving selected tie patterns for interpretation while omitting actor-level detail.
Hierarchy path (1) — routes to 1 parentless root
- Blockmodel → Representation → Abstraction
Neighborhood in Abstraction Space¶
Blockmodel sits in a crowded region of the domain-specific corpus (37th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Graph Structures & Algorithms (24 abstractions)
Nearest neighbors
- Social network (sociolinguistics) — 0.89
- Network mapping — 0.89
- Organigraph — 0.87
- HITS Algorithm — 0.87
- Sierpiński Graph — 0.87
Computed from structural-signature embeddings · 2026-10-08