Percolation Theory: When Does a Giant Cluster Emerge?

simulator intermediate ~7 min
Loading simulation...
Percolation: p_c = 0.5927 for 2D square lattice

Site percolation on a 2D square lattice has a critical threshold at p_c approximately 0.5927. Below this, only small disconnected clusters exist. Above it, a giant connected cluster spans the entire system.

Formula

p_c approx 0.5927 (2D square lattice, site percolation)
P_inf ~ (p - p_c)^(beta), beta = 5/36

The Birth of a Giant

Imagine a grid of squares where each square is randomly filled with probability p. At low p, you see scattered isolated dots and tiny clusters. As p increases, clusters grow and merge. Then, at a precise critical value p_c = 0.5927, something dramatic happens: a single giant cluster suddenly connects one side of the grid to the other. This is percolation — one of the most fundamental phase transitions in physics.

Site Percolation on a Square Lattice

In site percolation, each lattice site is independently occupied with probability p and empty with probability 1-p. Two occupied sites are connected if they are nearest neighbors (up, down, left, right). A cluster is a maximal set of connected occupied sites. The central question is: at what p does a cluster first span the entire system from top to bottom?

Critical Phenomena

Near the percolation threshold, the system exhibits remarkable critical phenomena. The cluster size distribution follows a power law. The correlation length (typical cluster diameter) diverges. The probability of belonging to the giant cluster scales as P ~ (p - p_c)^(5/36). These are universal properties — they depend only on the dimensionality of the lattice, not its specific geometry.

Try It Yourself

Slowly sweep the occupation probability from 0 to 1. Watch how isolated sites merge into clusters. At p near 0.59, the largest cluster (shown in red) suddenly spans the grid. The chart below shows the order parameter curve with the critical threshold marked. Notice how the transition becomes sharper as you increase the grid size.

FAQ

What is percolation theory?

Percolation theory studies how connected clusters form in random systems. On a lattice, each site is occupied with probability p. Below a critical threshold p_c, only small disconnected clusters exist. Above p_c, a giant cluster suddenly spans the entire system — a phase transition.

What is the percolation threshold?

The percolation threshold p_c is the critical occupation probability at which a giant connected component first appears. For site percolation on a 2D square lattice, p_c is approximately 0.5927. This value depends on the lattice geometry and whether sites or bonds are considered.

What are real-world applications of percolation?

Percolation theory applies to fluid flow through porous rock (oil extraction), forest fire spread, disease propagation, conductor-insulator transitions in composite materials, and network resilience. The critical threshold determines when a system transitions from disconnected to connected behavior.

Why is percolation a phase transition?

Like water freezing at 0 degrees C, percolation exhibits a sharp transition at p_c. The order parameter (largest cluster fraction) jumps from near-zero to a macroscopic value. Near p_c, the system exhibits power-law scaling and universal critical exponents, similar to thermodynamic phase transitions.

Sources

Embed

<iframe src="https://homo-deus.com/lab/network-science/percolation-threshold/embed" width="100%" height="400" frameborder="0"></iframe>
View source on GitHub