Erdős-Rényi Random Graph G(n, p)
n:
60
p:
0.017
Reseed
Sweep p
Stop
Largest component: 0 | Components: 0
G(n,p): each of the n(n-1)/2 possible edges exists independently with probability p. Phase transition at p_c = 1/n: below → many small trees; above → one giant component emerges. At p = ln(n)/n the graph becomes connected almost surely.