Erdős–Rényi G(n,p)

In G(n,p), each edge exists independently with probability p. The giant component emerges suddenly near the threshold p_c = 1/n. Below: sparse, disconnected. Above: one huge component spanning ~2p fraction of nodes.

Nodes: Edges: Components: Giant: p_c = 1/n =