Metraipolis › archive › dc_fa731572e632

Negative correlation for the random-cluster model below one on high-degree regular graphs — arXiv:2609.11578

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11578
License (as archived)
CC0-1.0
Archived
2026-10-16T06:06:10.118Z
SHA-256 of the archived text
c5fa3be27f5f1fe33e53d87482b9259808a4e22bc290af4d7d6aec4823b1bc3e
Stable URL of this page
https://metraipolis.com/documento/dc_fa731572e632

How to cite

Negative correlation for the random-cluster model below one on high-degree regular graphs — arXiv:2609.11578 — arXiv (en), https://arxiv.org/abs/2609.11578 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fa731572e632 (Metraipolis archive dc_fa731572e632, sha256 c5fa3be27f5f1fe33e53d87482b9259808a4e22bc290af4d7d6aec4823b1bc3e)
BibTeX
@misc{dcfa731572e632,
  title = {Negative correlation for the random-cluster model below one on high-degree regular graphs — arXiv:2609.11578},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11578},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fa731572e632; sha256 c5fa3be27f5f1fe33e53d87482b9259808a4e22bc290af4d7d6aec4823b1bc3e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11578. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The random-cluster model with cluster parameter \(0<q<1\) is conjectured to exhibit negative dependence, but even pairwise negative correlation between distinct edges remains open on general finite graphs. We first establish a reduction showing that the pairwise conjecture is equivalent to its restriction to regular graph sequences of diverging degrees $(d_n)$, even for edge pairs at distance \(o(d_n/\log d_n)\). We then prove strict pairwise negative correlation for a broad class of high-degree regular graph sequences satisfying a two-scale edge-isoperimetric condition. More precisely, for every fixed \(p\in(0,1)\), all sufficiently large graphs in the sequence have strictly negative covariance between any two distinct edge indicators at distance \(o(d_n/\log d_n)\), uniformly in \(q\in[0,1)\) and in the choice of the two edges. In particular, the result includes the \(q=0\) endpoint, corresponding to Bernoulli bond percolation conditioned to be connected. The isoperimetric hypothesis is satisfied by high-degree expander families and, with probability tending to one, by uniformly random regular graphs of diverging degree; its two-scale form also allows product geometries such as hypercubes and fixed-side high-dimensional discrete tori. The proof is based on a polymer representation and cluster expansion, together with a geometric identification of the leading contribution to the two-edge correlation.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.PR).
Categorie arXiv: Probability (math.PR) ; Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.11578 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:55:14.760Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).