The Uniform Even Subgraph and Its Connection to Phase Transitions of Graphical Representations of the Ising Model

MaRDI QIDQ6439650zbMATH OpenFDO

Authors Boris Kjær, Frederik Ravn Klausen

Publication date 8 June 2023

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Classical equilibrium statistical mechanics (general) (82B05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Phase transitions (general) in equilibrium statistical mechanics (82B26) Percolation (82B43)

Abstract: The uniform even subgraph is intimately related to the Ising model, the random-cluster model, the random current model and the loop $mathrmO$(1) model. In this paper, we first prove that the uniform even subgraph of $mathbb{Z}^d$ percolates for $dgeq2$ using its characterisation as the Haar measure on the group of even graphs. We then tighten the result by showing that the loop $mathrmO$(1) model on $mathbb{Z}^d$ percolates for $dgeq2$ on some interval $(1-varepsilon,1]$. Finally, our main theorem is that the loop $mathrmO$(1) model and random current models corresponding to a supercritical Ising model are always at least critical, in the sense that their two-point correlation functions decay at most polynomially and the expected cluster sizes are infinite.

This page was built for publication: The Uniform Even Subgraph and Its Connection to Phase Transitions of Graphical Representations of the Ising Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6439650)