Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 6 min ago
PreprintarXiv licencearXiv

A connection inequality for the random-cluster model

Abstract

For a finite graph G=(V,E), let ϕ be the random-cluster measure with edge parameters (pe)e∈ E, cluster weight q≥ 1 and free boundary condition. For each x∈ V and all nonempty A,B⊆ V, we prove ϕ(x↔ B)≥ ϕ(x↔ A)mina∈ Aϕ(a↔ B). For q=1, this is the (slightly generalized) Kozma-Nitzan inequality. Our extension to q>1 is based on a recent proof of this inequality by Blanc-Renaudie. As an application, we give a simple proof of sharp upper bounds for one-arm and point-to-plane connection probabilities in the subcritical regime.

Related

  1. Hineva Inequality for Submanifolds of Real Space Forms with Semi-Symmetric Non-Metric Connection
    M. S. Lone, M. A. Lone
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
  2. The Triangle Condition for the Marked Random Connection Model
    Matthew Dickson, Markus Heydenreich
    Annales Henri LebesguePeer-reviewedCC BYFull text15 citedMathematical physicsOpenAlex
  3. A Khintchine type inequality for non-independent random variables
    Jingyu Huang, Wenxuan Tao
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  4. Conformal invariance of the planar four-state Potts model and its random-cluster representation
    Emile Averous, Hugo Duminil-Copin, Tiancheng He +2
    arXivPreprintarXiv licenceFull textMathematical physicsProbabilityarXiv
  5. Universality of Large-Scale Geometry For Critical Random-Cluster Models
    Ulrik Thinggaard Hansen, Ioan Manolescu
    arXivPreprintCC BY 4.0Full textMathematical physicsProbabilityarXiv
BibTeX
@misc{jiang2026connection,
  title = {{A connection inequality for the random-cluster model}},
  author = {Jianping Jiang and Sike Lang and Yuxuan Sun},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.26419},
  eprint = {2610.26419},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.26419},
}
RIS
TY  - UNPB
TI  - A connection inequality for the random-cluster model
AU  - Jianping Jiang
AU  - Sike Lang
AU  - Yuxuan Sun
PY  - 2026
DA  - 2026/10/19
PB  - arXiv
DO  - 10.48550/arxiv.2610.26419
UR  - https://arxiv.org/abs/2610.26419
AB  - For a finite graph G=(V,E), let ϕ be the random-cluster measure with edge parameters (p_e)_e∈ E, cluster weight q≥ 1 and free boundary condition. For each x∈ V and all nonempty A,B⊆ V, we prove ϕ(x↔ B)≥ ϕ(x↔ A)min_a∈ Aϕ(a↔ B). For q=1, this is the (slightly generalized) Kozma-Nitzan inequality. Our extension to q>1 is based on a recent proof of this inequality by Blanc-Renaudie. As an application, we give a simple proof of sharp upper bounds for one-arm and point-to-plane connection probabilities in the subcritical regime.
ER  -