Critical Parameters for Loop and Bernoulli Percolation

Abstract

We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta \ge 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta =0$ we start with loops of length 1 and as $\beta$ crosses a critical value ${\beta }_c$, infinite loops start to occur almost surely. Our random loop models admit a natural comparison to bond percolation with $p=1-e^{-\beta }$ on the same graph to obtain a lower bound on ${\beta }_c$. For those graphs of diverging vertex degree where ${\beta }_c$ and the critical parameter for percolation have been calculated explicitly, that inequality has been found to be an equality. In contrast, we show in this paper that for graphs of bounded degree the inequality is strict, i.e. we show existence of an interval of values of $\beta$ where there are no infinite loops, but infinite percolation clusters almost surely.

arXiv comment16 pages, 4 figures. arXiv admin note: text overlap with arXiv:1608.08473 by other authors

References in corpus (11)

• Geometric Aspects of Quantum Spin States
• The free energy in a class of quantum spin systems and interchange processes
• Infinite cycles in the random stirring model on trees
• A numerical study of the 3D random interchange and random loop models
• The interchange process with reversals on the complete graph
• Essential enhancements revisited
• Phase transition for loop representations of Quantum spin systems on trees
• Phase transition for the interchange and quantum Heisenberg models on the Hamming graph
• Critical temperature of Heisenberg models on regular trees, via random loops
• The mean-field quantum Heisenberg ferromagnet via representation theory
• Existence of a phase transition of the interchange process on the Hamming graph

Cited by in corpus (1)

• On a class of orthogonal-invariant quantum spin systems on the complete graph