Network Percolation Threshold

Erdős-Rényi random graph on a grid. Each bond included with probability p. Below the threshold p_c ≈ 1/(N−1), the network consists of small clusters. Above it, a giant connected component (blue) suddenly spans the network — the percolation phase transition.

Giant component: 0% | Clusters: 0
Giant component size vs p