Skip to content
Preprint

The $q<1$ Random-Cluster Model on Wired Trees: Uniqueness and Negative Dependence

Aug 2026 · 1 citation · ⚡ 1 influential · 25 references
Mathematics Physics

Abstract

The random-cluster model with cluster weight $0<q<1$ is expected to exhibit negative dependence, but without FKG even pairwise negative correlation remains open on general graphs. We study the model on the infinite $\Delta$-regular tree with wired boundary conditions. Write $\widehat p:=p/(p+q(1-p))$ and $p_{\mathsf c}:=q/(\Delta+q-2)$. Classical results identify the product wired state for $p\le p_{\mathsf c}$ and construct a percolative all-wired limit for $p>p_{\mathsf c}$. We prove that the supercritical wired DLR specification has a unique Gibbs measure, namely this all-wired limit. Consequently, the wired DLR phase diagram is complete: the unique measure is Bernoulli bond percolation with parameter $\widehat p$ for $p\le p_{\mathsf c}$, while it percolates for $p>p_{\mathsf c}$. We also establish negative dependence across wired branches. On a finite wired tree, the vector of branch-connectivity indicators satisfies conditional negative association under positive external fields (CNA+). Hence bounded increasing observables supported on disjoint collections of branches incident to a common vertex have nonpositive covariance. The same inequality holds in the unique infinite-volume wired measure for every $p$, with equality for $p\le p_{\mathsf c}$.

View source

Similar papers

Preprint Sep 2026

Negative Correlations for Forests and the $q<1$ Random Cluster Model

We study negative edge correlation for two well-known models in statistical physics, the arboreal gas and the $q<1$ random-cluster model. We show that after the edges $e$ and $f$ are removed, their Rayleigh difference is a crossing contribution minus the covariance of two endpoint-connectivity events. For the arboreal...

R. A. Çiçeksiz, M. Ravichandran · 0 citations
Preprint Aug 2026

Phase Transition and Fluctuation Results for First-Passage Percolation on Spread-Out Cycle Graphs

We study first-passage percolation on the $\ell$-spread-out one-dimensional cycle of size $n$, where vertices are connected if their graph distance is at most $\ell$. We assign i.i.d.~non-negative random weights from a Weibull distribution $\omega_e \sim \mathrm{Exp}(1)^{1/\theta}$ to the edges for $\theta>0$ fixed. Th...

P. Dey, Daecheol Kim · 1 citation
Preprint Oct 2026

Explicit upper bounds on the threshold of one-dimensional long-range percolation

We study bond percolation on the one-dimensional lattice in which two sites at distance $r$ are connected with probability $p_r=C/r^{1+\sigma}$, where $0<\sigma<1$. An infinite cluster exists if $C$ exceeds a critical value $C_c(\sigma)$, which is not known exactly: the available results are the lower bound of Schulman...

Guy Amit · 0 citations
Preprint Sep 2026

$\beta$-Skewed Maximal Spanning Forests

The Free $\mathbf{w}$-Maximal Spanning Forest (FMaxSF) is a weighted generalization of the classical Free Minimal Spanning Forest (FMSF) that is able to detect nonhyperfiniteness in percolation on nonunimodular graphs. We introduce a parameterized family of invariant random spanning forests that interpolates between th...

Shirshendu Chatterjee, Yang Chen, Grigory Terlov · 0 citations
Preprint Sep 2026

A finite-graph conjecture related to $\theta(p_c)=0$ for Bernoulli bond percolation on $\mathbb Z^d$

We introduce a conjecture for Bernoulli bond percolation on finite graphs. Roughly speaking, it asserts that if each boundary vertex is associated with a highly probable event that is increasing with respect to the percolation configuration, then, conditionally on the origin being connected to the boundary, the origin...

Lucas Flammant · 0 citations
Preprint Aug 2026

The critical probability for percolation on finite graphs

We determine the critical probability for Bernoulli bond percolation on essentially any finite graph. Namely, letting $\lambda(G)$ denote the spectral radius (maximum eigenvalue) of $G$, we prove that the critical probability is at $1/\lambda(G)$: above this probability there is typically a component of order $\Omega(\...

Micha Christoph, Patryk Morawski, Yuval Wigderson · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.