Watts & Strogatz, Nature 1998
Start with a ring lattice (N nodes, each connected to K nearest neighbors). Rewire each edge with prob p.
p=0: regular lattice — high clustering C, high path length L.
p≈0.01-0.1: small world — C stays high, L drops sharply.
p=1: random graph — C≈K/N, L≈log(N)/log(K).
Start with a ring lattice (N nodes, each connected to K nearest neighbors). Rewire each edge with prob p.
p=0: regular lattice — high clustering C, high path length L.
p≈0.01-0.1: small world — C stays high, L drops sharply.
p=1: random graph — C≈K/N, L≈log(N)/log(K).
Clustering C:-
C / C₀:-
Avg path L:-
L / L₀:-
Rewire prob p:-