For the rooted infinite model defining percolation probability, the percolation critical probability is
Below , the root has probability zero of belonging to an infinite percolation cluster. Above , that probability is positive, by the definition and the monotone coupling of Bernoulli percolation. The definition alone does not determine behavior at , or the numerical value of : these require results specific to the graph and the model.
A finite graph with edges has open/closed configurations. The probability of any connectivity event is a finite sum of terms , hence a polynomial in . The square's is an example. These finite probabilities vary smoothly, although an infinite-system limit can distinguish a whole interval with from one with . A steep finite connection curve and a mathematically proved percolation critical probability are different kinds of information.
Independent bond percolation on the cubic lattice has exponential connection decay at every and positive percolation probability at every . The finite-set criterion for percolation sharpness gives decay below its auxiliary threshold. The Margulis–Russo formula and exploration from a finite box boundary give , with the infimum over interior finite sets. Above the auxiliary threshold the infimum is at least one; integrating gives positive percolation probability and identifies the two thresholds. This theorem does not identify the value of for a particular lattice.
For independent bond percolation on a transitive locally finite lattice, let count rooted self-avoiding walks and let be the connective constant. An infinite open percolation cluster supplies an open walk of every length. The union bound gives , which tends to zero when . Thus .
The percolation critical probability of independent bond percolation on the infinite square lattice is exactly
In this model, for and for . The particular graph, independent edge decisions, and distinction between bond percolation and site percolation matter: this value is not a universal threshold for arbitrary random networks. The equality of open and closed edge probabilities at suggests a relation to dual bond percolation, but that symmetry alone is not a proof of long-distance connectivity.
Harris established the lower bound, including absence of an infinite percolation cluster at , in 1960. Kesten completed the equality in 1980. His original paper states the threshold result as Theorem 1 and the positive/zero percolation probability alternatives as Theorem 2: [ref]. These are claims about the infinite square lattice, rather than deductions from a simulated finite sample.
Uniform fixed-aspect rectangle crossing in bond percolation bounds at the self-dual parameter yield a positive lower bound for closed dual circuits in geometrically spaced disjoint annuli. The independent annular barriers for percolation imply that an origin-to-infinity open graph path has probability zero. Parameter monotonicity gives zero percolation probability for every .
At parameter , primal and dual bond percolation on the square lattice have the same probability distribution. Suppose an infinite percolation cluster exists. Large boxes meet it with probability tending to one. The square-root trick for positively associated events and quarter-turn symmetry imply that each side has an infinite exterior open arm with probability tending to one. The same holds for dual arms. A union bound then gives positive probability of primal top and bottom arms together with dual left and right arms.
Use a primal box and a dual box with sides at . Open only primal edges whose endpoints both lie in the primal box, preserving all outward and exterior arm edges. The two primal arms are joined inside. Planarity prevents the two alternating dual arms from joining: a proposed dual connection together with the inner boundary arc separates one primal infinite arm from infinity. Thus the modified configuration has two infinite dual clusters. Its positive probability by finite modification of Bernoulli percolation contradicts uniqueness of the infinite percolation cluster. Consequently the percolation probability at is zero. This is often called Zhang's argument.
For independent bond percolation on a periodic plane lattice with three-fold rotation symmetry, the primal model at and the dual bond percolation model at cannot both percolate. To adapt Zhang's argument, divide a large boundary circle into six arcs, repeating the division in each -degree sector. Vary the division point until the failure probabilities of the two alternating primal arc types are comparable within a factor . Moving past a single crossing edge changes a failure probability by at most a factor , by the FKG inequality. If the probability of no primal exterior arm is at most , then and both failures are at most . For the dual model, at least one arc type has failure at most ; its three rotations have the same bound. Four alternating primal/dual arms now occur with positive probability, contradicting the alternating exterior-arm separation lemma and uniqueness after a finite modification. This extends the four-fold argument to the martini lattice.
Four infinite exterior arms entering a square in alternating primal-open and dual-open order force the two primal arms to be disjoint outside the square. If they met, their finite connecting crosscut together with a boundary arc would enclose one dual arm, preventing its escape to infinity. Connecting the two primal arms through the square creates a proper doubly infinite open path, separating the two remaining dual infinite tails. finite-energy property of Bernoulli percolation can then turn this configuration into two infinite dual clusters, contradicting uniqueness. Care is needed to preserve the exterior dual tails even if the finite modification destroys their original boundary attachments.

Articles by others on the same topic (0)

There are currently no matching articles.