Connection decay rate in a percolation strip Created 2026-10-06 Updated 2026-11-05
For nearest-neighbour bond percolation with on the strip , put . The Harris-FKG inequality and translation invariance imply . Thus is a subadditive sequence, and the Fekete lemma gives
The direct horizontal graph path gives . Enlarging the strip increases every percolation two-point connection probability, so is nonincreasing in and has a nonnegative limit of a sequence.
In bond percolation on , edges are independently open with probability 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 measures the chance that the origin lies in an infinite percolation cluster, and the percolation critical probability is . Monotone coupling of Bernoulli percolation by independent uniform distribution makes nondecreasing.
The sharpness of the percolation transition says that below connection probabilities on decay exponentially with distance, while above 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 , 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 for . A directional correlation length can be defined through exponential two-point decay, . 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 , and the number per site of percolation clusters of size has leading power . This cluster-count probability distribution differs from the size-biased probability distribution seen by choosing a site. Scaling relations for critical exponents such as and 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 , , , 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 is
where is standard Brownian motion and time is normalized by half-plane capacity. Critical percolation corresponds to . 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.
The union bound gives . Hence some boundary graph vertex has percolation two-point connection probability at least . The rotations and reflections of the square lattice let us choose such a graph vertex as , . Reflection in the vertical line through sends to and fixes . Therefore
The Harris-FKG inequality applied to these two increasing events proves the reflection lower bound for two-point percolation:
Every graph path from to reaches , so . Taking roots gives
Both outside expressions have limit of a sequence , proving the even case. For , the Harris-FKG inequality with the last horizontal edge gives , and also . The lower bound has root
The upper bound has the same limit of a sequence. At all positive-distance connection probabilities vanish. Thus for every .
The strips are nested. Every connection permitted inside is also permitted inside , so for every fixed separation. Consequently
The preceding nonnegative bound makes this a decreasing sequence bounded below. By monotone convergence of real sequences,
There is no assertion that this limit of a sequence is strictly positive: positivity at each fixed width need not survive an increasing-width limit of a sequence.
One can also identify the limit of a sequence. Let be the percolation two-point connection probability in the whole square lattice. Every finite connecting graph path has a bounded vertical extent, so . Commuting infima gives the strip approximation to the planar connection decay rate:
The same positive-association argument identifies the final infimum with the whole-plane normalized logarithmic limit of a sequence. This is an interchange of infima justified by monotonicity at fixed . For example, when , the threshold proved in question 2 and uniqueness give an infinite percolation cluster with root probability . The Harris-FKG inequality makes the probability that both endpoints belong to it at least , so . The whole-plane rate, and hence , is then zero, despite the strict positivity of every finite-strip rate.
For bond percolation on the square lattice, the one-arm probability has a root limit of a sequence . The BK boundary-splitting estimate implies that is submultiplicative for positive integers. Applying the Fekete lemma to its logarithm proves existence when ; at the rate is zero. The same rate is the root limit of the percolation two-point connection probability along a coordinate axis, by the reflection lower bound for two-point percolation.
Percolation triangle condition Created 2026-10-07 Updated 2026-11-05
For independent bond percolation on , let be the critical percolation two-point connection probability. The percolation triangle condition is
translation invariance makes this a threefold discrete convolution evaluated at zero. The factors describe connections between three positions; their product is a diagrammatic weight, rather than the probability of three independent events in a single configuration.
The condition controls the intersection corrections that separate percolation clusters from a simple branching approximation. In the homogeneous setting, it implies the mean-field percolation exponents value for the divergence of percolation susceptibility. It must be established for the particular model; lace expansion provides one method in suitable high-dimensional models. The condition is therefore a useful bridge between spatial connectivity estimates and critical behaviour, rather than an assumption automatically satisfied at criticality.[ref]
Percolation two-point connection probability Created 2026-10-06 Updated 2026-10-07
The two-point percolation two-point connection probability is the probability that two fixed graph vertices belong to the same percolation cluster. On a translation-invariant lattice it depends on their displacement. Restricting the permitted connecting graph paths to a subgraph gives the corresponding confined percolation two-point connection probability. The Harris-FKG inequality implies .
Let be the unrestricted planar two-point percolation two-point connection probability. Every finite connecting graph path is contained in some strip, so for each fixed . Therefore
The equality uses commuting infima and monotonicity, not an unjustified interchange of two general limits. The right-hand side is the whole-plane connection decay rate by the Fekete lemma.