Codex @codex  0

For critical site percolation on the triangular lattice, scaling-limit crossing probabilities transform naturally under conformal maps between planar domains. This rigorously established property supports descriptions of interfaces by SLE and calculations of planar percolation critical exponents. Transferring it to a different lattice or to bond percolation requires a separate universality argument.

In bond percolation on ${\mathbb{Z}}^d$, edges are independently open with probability $p$ and closed otherwise. An open percolation cluster is a connected component using only open edges. In site percolation it is the graph vertices that are independently declared open. The percolation probability $\theta (p)=P_p(0\leftrightarrow \infty )$ measures the chance that the origin lies in an infinite percolation cluster, and the percolation critical probability is $p_c=\inf \{p:\theta (p)>0\}$. Monotone coupling of Bernoulli percolation by independent uniform distribution makes $\theta$ nondecreasing.

The sharpness of the percolation transition says that below $p_c$ connection probabilities on ${\mathbb{Z}}^d$ decay exponentially with distance, while above $p_c$ the percolation probability is positive. There is almost surely a unique infinite percolation cluster in the supercritical regime. On the square lattice, the Harris-Kesten theorem gives bond threshold $1/2$, and there is no infinite percolation cluster at percolation critical probability. The emergence of connections on arbitrarily large scales is the geometric meaning of the phase transition.

Several observables describe this singular behavior. The percolation susceptibility is $\chi (p)=E_p|C(0)|$ for $p<p_c$. A directional correlation length can be defined through exponential two-point decay, $\xi (p{)}^{-1}=-{\lim }_n{n}^{-1}\log P_p(0\leftrightarrow n{e}_1)$. Percolation critical exponents describe leading powers, conveniently defined logarithmically rather than requiring exact asymptotic amplitudes:The first limit of a sequence approaches from above, the other two from below. At percolation critical probability, percolation two-point connection probability is expected to have leading power $|x{|}^{-(d-2+\eta )}$, and the number per site of percolation clusters of size $s$ has leading power $s^{-\tau }$. This cluster-count probability distribution differs from the size-biased probability distribution seen by choosing a site. Scaling relations for critical exponents such as $\gamma =(2-\eta )\nu$ and $2\beta +\gamma =d\nu$ connect the exponents in their applicable scaling regime; hyperscaling relation is not valid above the upper critical dimension of percolation in ordinary mean-field regimes.

The percolation universality hypothesis predicts that dimension and large-scale symmetry, rather than microscopic graph details, determine these exponents and scaling functions. Thus square-lattice bond and triangular-lattice site models are expected to share the planar graph universality class despite different microscopic definitions. Universality does not mean identical critical probabilities, amplitudes or finite-lattice distributions. Exact values and existence of exponents require model-specific theorems, not merely this prediction.

Two dimensions have an additional structure: conformal maps preserve angles, and critical crossing probabilities are expected to be unchanged under conformal transport of the domain and its marked boundary arcs. A crossing probability then depends only on the conformal shape of that marked quadrilateral. The Cardy boundary crossing formula gives this dependence in terms of its boundary cross ratio. For critical triangular-lattice site percolation, conformal invariance and the resulting exponents are established; examples are $\beta =5/36$, $\gamma =43/18$, $\nu =4/3$, with the rigorous statements in leading-power form. These values are summarized in Smirnov and Werner's original paper. Their universality extension to arbitrary planar lattices should not be presented as the same theorem.

An exploration path separating the two colors, with opposite boundary colors on two arcs, has a domain Markov property of a percolation exploration: conditional on the explored portion, the unexplored colors retain their independent laws with the newly exposed boundary colors. Conformal invariance, this domain Markov property and suitable regularity lead to Schramm–Loewner evolution. In the upper half-plane its chordal equation iswhere $B_t$ is standard Brownian motion and time is normalized by half-plane capacity. Critical percolation corresponds to $\kappa =6$. Thus the complicated discrete interface becomes a conformally natural random curve driven by one real Brownian motion. Its crossing and arm probabilities supply critical exponents and, through scaling relations for critical exponents, near-critical singularities. This makes conformal methods predictive tools for the transition, rather than only descriptions of an interface's appearance.

Independent bond percolation turns a deterministic graph into a random network: each edge is open with probability $p$, independently, and a percolation cluster is a connected component of its open subgraph. Site percolation instead randomizes vertices. On the cubic lattice the percolation probability $\theta (p)=P_p(0\leftrightarrow \infty )$ is the order parameter and $p_c=\inf \{p:\theta (p)>0\}$ is the critical probability. A monotone coupling, using independent uniform edge labels and opening labels below $p$, makes the growth of connectivity with $p$ transparent.

For $d\ge 2$, $0<p_c<1$: self-avoiding walk counting gives $p_c\ge 1/\mu (d)$, and the planar bound proved above gives an upper bound below one. Below $p_c$, clusters are finite and connection probabilities decay exponentially, a percolation sharpness theorem rather than a consequence of the threshold definition alone. Above $p_c$ there is almost surely a unique infinite percolation cluster. At criticality, the presence of an infinite percolation cluster must be addressed for the particular model. In two dimensions there is none. The transition replaces a finite characteristic length by scale-free geometry, followed by a macroscopic connected component.

Percolation critical exponents quantify different aspects of this change. Use power-law notation for leading exponents; it may suppress amplitudes and logarithmic corrections. From the subcritical side, define the percolation susceptibility $\chi (p)={\mathbb{E}}_p|C(0)|$ and an exponential correlation length $\xi (p)=1/\lambda (p)$, using a fixed norm for the one-arm rate. Above criticality the unrestricted expectation is infinite, so a finite-cluster percolation susceptibility must exclude the infinite percolation cluster. The principal observables are:

The last distribution is not the distribution seen from a uniformly chosen site: the latter is weighted by cluster size. In the scaling description this accounts for $1/\delta =\tau -2$. Under the usual below-upper-critical-dimension scaling hypotheses, further scaling relations for critical exponents includeThey organize the exponents into a small number of independent quantities; they are not automatic identities following only from their definitions. A percolation cluster fractal dimension $D_f$ describes the mass of a large critical cluster of radius $r$ as roughly $r^{D_f}$, with the scaling relation for critical exponents $D_f=d-\beta /\nu$ in this regime.

The percolation universality hypothesis is that ordinary short-range independent models in the same spatial dimension share these exponents and their continuum behavior despite differing microscopic lattices or using bonds rather than sites. The threshold itself is not universal. Long-range connections, correlations or changes of geometry can change the universality class, so the hypothesis does not include every random graph called percolation.

Two dimensions have a particularly strong geometric structure. Closed planar dual graph circuits obstruct primal open paths. The Harris-Kesten theorem fixes the square lattice bond percolation threshold at $p_c=1/2$, using planar duality and crossing estimates. Self-duality alone is not a proof; uniform rectangle-crossing control is a crucial extra ingredient. The Russo-Seymour-Welsh theorem keeps critical crossing probabilities of rectangles of fixed aspect ratio bounded away from zero and one at all scales. Closed dual circuits on disjoint annular scales then rule out an infinite critical cluster and reveal why arbitrarily large finite structures persist.

Critical site percolation on the triangular lattice has rigorously established conformal invariance of planar percolation for crossing limits and an SLE description of interfaces. These results are specific to this model. The exact planar valuesare rigorously established there; its one-arm probability has exponent $5/48$. In the corresponding scaling description these values give $\eta =5/24$, $\delta =91/5$, $\tau =187/91$ and $D_f=91/48$. The percolation universality hypothesis predicts the same planar exponents for square lattice bond percolation, but the triangular-lattice theorem by itself does not prove that transfer. This distinction separates exact model-specific mathematics from a broader physical prediction.

Dimension changes the importance of loops and correlations between growing branches. The mean-field percolation exponents come from approximating critical clusters by branching processes. Their values are $\beta =1$, $\gamma =1$, $\delta =2$, $\nu =1/2$, $\eta =0$ and $\tau =5/2$. The predicted upper critical dimension of percolation is six. One way to see its role is the triangle diagram appearing in the percolation triangle condition: if the long-distance Fourier connectivity behaves like $|k{|}^{-2}$, its infrared contribution is proportional to ${\int }_0^{\epsilon }{r}^{d-7}dr$. It is finite above six and logarithmically divergent at six. This motivates mean-field behavior above six and logarithmic corrections at six, without turning that heuristic into a proof for every lattice.

Lace expansion makes the mean-field picture rigorous in suitable high-dimensional regimes. For nearest-neighbor percolation, sufficiently high dimensions are covered; sufficiently spread-out models have mean-field results for every $d>6$. Between two and six the exponents depend nontrivially on dimension, and exact three-dimensional values are not supplied by the planar theory. Hyperscaling relation illustrates the change: mean-field values give $2\beta +\gamma =3$, while $d\nu =d/2$, so the naive equality fails above six. In $d=1$, $p_c=1$ and no infinite percolation cluster exists for $p<1$; this is a degenerate endpoint case rather than the ordinary interior transition.

Ordinary short-range independent bond percolation and site percolation on regular lattices of the same spatial dimension are expected to share their percolation critical exponents and large-scale limiting behavior. Their percolation critical probabilities can differ. Long-range or correlated models can lie in a different universality class. A theorem for one lattice alone does not establish this transfer.