The Small-World Problem: How Six Degrees of Separation Actually Works
Every person on Earth is supposedly reachable through just six handshakes. Graph theory explains why this isn't magic — it's structure.
In 1967, psychologist Stanley Milgram sent 160 letters to strangers in Omaha, Nebraska, asking them to forward each letter to a stockbroker in Boston — but only through personal acquaintances. The median number of hops? Six.
That experiment gave us the phrase "six degrees of separation." But the real explanation lives in graph theory.
What makes a network "small-world"?
A graph is considered small-world if two conditions hold: most nodes are not directly connected to each other (low density), yet any node can be reached from any other in a small number of steps (low diameter).
The key ingredient is a handful of high-degree nodes — hubs. In a social network these are the hyperconnected people: the conference organiser who knows everyone, the journalist with 10,000 contacts. Remove them and the diameter of the network explodes.
The Watts-Strogatz model
In 1998, Duncan Watts and Steven Strogatz formalised this. Start with a ring of nodes where each connects only to its nearest neighbours. Rewire a small fraction of edges at random. Almost immediately, the average path length drops dramatically while local clustering stays high. The network becomes small-world with surprisingly few random bridges.
Why it matters
Small-world structure explains how diseases spread faster than intuition suggests, how information cascades on Twitter, and why power grids are both efficient and fragile. The same topology that makes gossip travel fast also makes a virus hard to contain.
Understanding the structure of your network — not just its size — is what determines how information, influence, or infection moves through it.