The Setting
An open cluster in a finite part of may reach the inner cube of one coarse cube while missing the inner cube of its neighbor. The relay estimate concerns this event when the source lies outside both larger cubes and their internal percolation variables have a common density.
The vertices of are integer triples, with coordinates indexed by . Write for the th unit vector, so the positive coordinate step from is .✦ Nearest-neighbor vertices differ by such a step in either order.✦ A lattice bond is the edge with endpoints and ; bond endpoint incidence allows these endpoints in either order.
Fix a model , either bond or site percolation.✦ A percolation variable is a lattice bond in the bond model and a vertex in the site model.✦ A configuration assigns an open or closed state to each variable.✦ Open bond adjacency means nearest-neighbor adjacency across an open bond.✦ Open site adjacency means nearest-neighbor adjacency with both vertices open.✦ A vertex is available unconditionally in the bond model and precisely when it is open in the site model.✦
A finite lattice subgraph consists of a finite vertex set and a finite set of lattice bonds, each with both endpoints in .✦ Its underlying simple graph joins the endpoints of its bonds.✦ Open bond connectivity in is connectivity by a finite path of its open bonds, allowing length zero.✦ Open site connectivity on a graph is connectivity by a finite path of open vertices; length zero also requires an open vertex.✦ In , the sites inherit their states from , and successive vertices must be adjacent in its underlying graph. For a source vertex and a target set of lattice vertices, the source cluster and target connection event in this finite graph are given by (1): (1)
For opening probabilities , let be the independent Bernoulli product measure with those probabilities; denotes the constant assignment .✦ An internal variable of a region is a bond with both endpoints in in the bond model, or a site in in the site model.✦ An opening-probability assignment has uniform density on a region when for every internal variable of .✦ The graph contains the induced lattice subgraph on when every vertex of and every lattice bond with both endpoints in belong to .✦
Cubes and Scale Parameters
A lattice box is the set of integer vertices between lower and upper corners ordered coordinatewise, including their boundary.✦ Its box variables are its internal percolation variables. The cube of coordinate radius centered at is the set of lattice vertices in (2); the same formula defines for integer : (2) For a nonnegative integer radius , the seed variable count is the number of box variables in .
For and a sign , the directed lattice interval is the set of integers satisfying when , and when .✦ A quarter-face index is a pair consisting of a coordinate and a sign vector .✦ The quarter-face with center , integer radius , and quarter-face index is the set in (3): (3)✦ There are signed-coordinate quarter-faces, and their boundary overlaps are permitted.
Restricted open adjacency in a region requires open lattice adjacency and both endpoints in .✦ The confined seed connection event for a center , nonnegative integer radii , and a target set of lattice vertices is the set of configurations with an available and a joined by a finite path, possibly of length zero, of open lattice adjacency restricted to .✦
Renormalization scale data for consist of densities and , error allowances , positive integers , and nonnegative integers , satisfying the budgets and separation conditions in (4): (4) Here is the contour error tolerance. The quarter-face requirement on these data is (5), for every center , every quarter-face index , and each indicated radius: (5)
The Coarse Cubes and Relay Route
The coarse lattice is . Its four directions have outward steps , respectively. For coarse vertices , the coarse embedding, inner cubes, surrounding cubes, and pair regions are defined by (6): (6)
For integer vectors , the rectangular region and its -expansion are the sets in (7): (7) The relay prism is the lattice region in (8): (8)✦ A signed lattice symmetry of is a bijection obtained from a coordinate permutation , signs , and a translation , acting by .
Write for an axial lattice point.✦ For integers , the contracting half-widths , route centers , route half-widths , and route boxes , with nonnegative integers, are defined by (9): (9) A rectangle has a quarter-face interface with a target set in , denoted , when the condition in (10) holds: (10)✦
The Claim
Theorem 1 (Neighboring cube relay). Fix either model and renormalization scale data as above. Let be a finite lattice subgraph, let assign opening probabilities to the percolation variables of , and take and a direction . Suppose contains the induced lattice subgraph on , that has uniform density there, and that lies outside this pair region. The neighboring relay bound is (11): (11)✦
Let be a signed lattice symmetry. Suppose instead that contains the induced lattice subgraph on , that has uniform density there, and that . The framed relay bound is (12): (12)✦
For integers with and , the thirteen route interface conditions are (13): (13)✦
What Is Checked
The relay bounds are stated over finite lattice subgraphs under independent Bernoulli product measures with uniform internal density and the stated scale data; the interface assertion concerns the integer-coordinate route rectangles and their expansions inside the relay prism.