Press Run to spread a rumour from the seed. Click any node to move the seed.
The graph is a Watts-Strogatz network: N people on a ring, each tied to their K nearest neighbours on each side (degree 2K), then every tie is rewired to a random person with probability p.
C = average fraction of a person's friends who are also friends of each other. For the ring lattice (p = 0): C0 = 3(K-1)/(2(2K-1)).L = mean number of steps between two people. On the ring lattice every person at circular offset m is ceil(m/K) steps away, which gives L0 exactly (used in the check). A few shortcuts make L fall steeply while C stays high - the "small-world" window.Spread: every tick each informed person tells each not-yet-informed friend with probability β. In simple contagion (threshold m = 1) one informed friend is enough. In complex contagion (m ≥ 2, e.g. adopting a risky habit) a person needs at least m informed friends before they can adopt; then shortcuts that bring a single contact do not help and clustered neighbourhoods matter - the Centola-Macy effect.
Simplifications: a static, undirected, unweighted network; identical people; β and thresholds are illustrative. Real networks have hubs and communities that Watts-Strogatz lacks. The sweep curve is averaged over only 3 random graphs per p value.