Random Networks — Erdős-Rényi G(n,p)

In G(n,p) each pair of n nodes is connected independently with probability p. A giant connected component suddenly emerges at the phase transition p* = 1/n. Below threshold: small clusters. Above: one giant component dominates.

40
0.040
Edges: 0 Giant component: 0 Components: 0 Threshold p* = 1/n: 0