TOPICS
Search

Site Percolation


SitePercolation

Site percolation is a percolation model in discrete percolation theory on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the point lattice vertices as the relevant entities (left figure). The precise mathematical construction for site percolation as a Bernoulli percolation model is as follows.

First, designate each graph vertex of L to be independently "open" with probability p in [0,1] and closed otherwise. Next, define an open graph path to be any graph path in L all of whose vertices are open, and define at the graph vertex x in L the so-called open cluster C(x) to be the set of all vertices which may be attained following only open paths from x. Write C=C(0). The main objects of study in the site percolation model are then the percolation probability

 theta(p)=P_p(|C|=infty)
(1)

and the critical probability

 p_c=sup{p:theta(p)=0},
(2)

where here, P_p is defined to be the product measure

 P_p=product_(v in L^d)mu_v,
(3)

mu_v is the Bernoulli probability measure which assigns q=1-p whenever v is closed and assigns p when v is open, and p_c is the percolation threshold. Site models for which p>p_c have infinite connected components almost surely, whereas those for which p<p_c have none almost surely.

In general, site percolation is considered more general than bond percolation because every Bernoulli bond percolation model on a graph can be reformulated as a site model on its line graph, but a converse reduction does not hold in general. Mixed percolation is considered to be a bridge between the two. Note, too, the existence of several other variants of site percolation; for example, one could drop the assumption of independence to obtain a non-Bernoulli, dependent site model.

Bou-Rabee (2026) reported that nearest-neighbor Bernoulli site percolation on Z^d satisfies theta(p_c)=0 for every d>=3, so there is no infinite open cluster at the percolation threshold. ChatGPT supplied the mathematical argument, with Claude and GLM supporting formalization. As of Oct. 8, 2026, the Lean development had a successful public build and its statement had been compared with the lattice question, but an independent rebuild and independent mathematical review had not been reported (VibeMathed 2026).


See also

Bond Percolation, Cardy Formula, Dependent Percolation, Discrete Percolation Theory, Mixed Percolation Model, Near-Critical Percolation, Percolation, Percolation Theory, Percolation Threshold

Portions of this entry contributed by Christopher Stover

Explore with Wolfram|Alpha

References

Bou-Rabee, A. "Percolation at Criticality." Sep. 5, 2026. https://nitromannitol.github.io/site-percolation-7d3f2/.Chayes, L. and Schonmann, R. H. "Mixed Percolation as a Bridge between Site and Bond Percolation." Ann. Appl. Probab. 10, 1182-1196, 2000.Grimmett, G. Percolation, 2nd ed. Berlin, Germany: Springer-Verlag, 1999.Hammersley, J. M. "A Generalization of McDiarmid's Theorem for Mixed Bernoulli Percolation." Math. Proc. Camb. Phil. Soc. 88, 167-170, 1980.VibeMathed. "Absence of Critical Bernoulli Site Percolation on Z^d for d>=3." Oct. 7, 2026. https://vibemathed.com/problem/critical-site-percolation-z-d.

Referenced on Wolfram|Alpha

Site Percolation

Cite this as:

Weisstein, Eric W., with contributions by Christopher Stover. "Site Percolation." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SitePercolation.html

Subject classifications