Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Critical Parameters for Loop and Bernoulli Percolation (1908.10213v1)

Published 27 Aug 2019 in math.PR, math-ph, and math.MP

Abstract: We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 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.

Summary

We haven't generated a summary for this paper yet.