Small-World Networks — Watts-Strogatz Model

🕸️ Network

Nodes N: 40 Neighbours k: 4 Rewire probability p: 0.00

Edges—

Clustering C—

C / C₀—

Avg path L—

L / L₀—

Regular lattice

Watts & Strogatz (1998): rewire each edge with probability p. At intermediate p, C stays high but L drops → "small world". Six degrees of separation!

Related simulations

🔗 Force-Directed Graph 🌲 Minimum Spanning Tree 🕸️ Network Resilience 🌐 Scale-Free Network — Barabási-Albert Preferential Attachment 🌐 Network Science 🎨 Graph Coloring