Infinite-volume wired random-cluster measure (${\varphi }_{p,q}^1$)

For $q\ge 1$, finite random-cluster measures with all boundary graph vertices identified have a weak infinite-volume limit of a sequence. On a regular lattice it is invariant under translations and lattice reflections and has positive association of the random-cluster model. Its conditional single-edge open probability lies between $p/(p+q(1-p))$ and $p$. Connection events can be approximated by increasing finite-volume path events, so their positive-association inequalities pass to the limit of a sequence.

Positive association of random variables and translation invariance give $C_{m+n}\ge C_m{C}_n$ for axis connection probabilities. The Fekete lemma applied to $-\log C_n$ proves the displayed limit of a sequence and the bound $C_n\le e^{-n\alpha }$. The lower single-edge conditional bound gives $C_n\ge [p/(p+q(1-p)){]}^n$, so the decay rate is finite and nonnegative. It may be zero.

Choose a graph vertex $x=(n,x_2,\dots ,x_d)$ on the boundary of a lattice box. Translation and reflection invariance identify the probabilities of $0\leftrightarrow x$ and $x\leftrightarrow 2n{e}_1$. Their intersection implies $0\leftrightarrow 2n{e}_1$, so positive association of random variables gives $C_{2n}\ge \varphi (0\leftrightarrow x{)}^2$. A union bound and lattice symmetries choose such an $x$ with probability at least the box-boundary connection probability divided by the number of boundary graph vertices. This polynomial factor disappears in the exponential rate, identifying boundary and axial inverse correlation lengths.