G(n, p) random graph: n nodes, each edge exists with prob p. Critical threshold: ⟨k⟩ = p·(n-1) = 1. Below threshold: many small trees. Above: giant component emerges (size ~O(n)). Erdős & Rényi (1960) proved the transition is sharp.