MENTAL MODEL · M13135

Network Clustering

SystemsHigh supportNetwork Science

Included

Updated 2026-08-17

Loading revision record…

INTRODUCTION

English translation pending.

CORE DEFINITION

Network clustering describes how strongly a node's neighbours are connected to each other. Duncan Watts and Steven Strogatz formalised it in their 1998 paper on small-world networks, defining the clustering coefficient as the share of a node's neighbour pairs that are themselves linked, and averaged across the network. High clustering produces dense local communities even when the overall network is sparse. Mark Granovetter's earlier 1973 work on weak ties supplied the complementary insight that densely clustered groups carry redundant information, while bridges between clusters carry novel information. The measure is structural and says nothing about the content of the ties.

SCAFFOLDING EFFECT

psychology

Reduce cognitive load

- Redundancy check: Measure how many of your contacts already know each other, since overlap means duplicated information. - Bridge hunting: Find the ties that connect otherwise separate clusters. - Diffusion planning: Choose dense seeding to spread inside a cluster, or bridges to reach new ones.

anchor

Anchor fast decisions

Triadic closure explains the pattern: if two people share a contact, they are likely to meet, so ties accumulate into triangles and the neighbourhood thickens. Because clustered contacts move in the same circles, they tend to encounter the same information, which makes the cluster efficient for trust and coordination but redundant for novelty. Bridges between clusters are rarer, so they carry disproportionate amounts of new information relative to their number.

MINIMUM ACTION

In progress 0/1

Practice this model in one real situation:

Map your network and mark which of your contacts know each other. 2. Compute the clustering coefficient for your network or a relevant subgraph. 3. Identify separate clusters and the specific ties that bridge them. 4. Add one weak tie outside your cluster and track what new information arrives. 5. Decide whether this task needs dense local trust or wide reach.

Check to track your progress (stored locally)

Learning progress0%

account_treeGenealogyexpand_more

menu_bookReferencesexpand_more

Source support: Explicit

link
github.comhttps://github.com/kcchien/model-thinkingZH · Explicit
verified

RELATED MODELS