This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Random cluster models on random graphs

Van Hao Can Institute of Mathematics, Vietnam Academy of Science and Technology, 18 Hoang Quoc Viet, 10307 Hanoi, Vietnam, [email protected]  and  Remco van der Hofstad Remco van der Hofstad, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands, [email protected]
Abstract.

On locally tree-like random graphs, we relate the random cluster model with external magnetic fields and q2q\geq 2 to Ising models with vertex-dependent external fields. The fact that one can formulate general random cluster models in terms of two-spin ferromagnetic Ising models is quite interesting in its own right. However, in the general setting, the external fields are both positive and negative, which is mathematically unexplored territory. Interestingly, due to the reformulation as a two-spin model, we can show that the Bethe partition function, which is believed to have the same pressure per particle, is always a lower bound on the graph pressure per particle. We further investigate special cases in which the external fields do always have the same sign.

The first example is the Potts model with general external fields on random dd-regular graphs. In this case, we show that the pressure per particle in the quenched setting agrees with that of the annealed setting, and verify [3, Assumption 1.4]. We show that there is a line of values for the external fields where the model displays a first-order phase transition. This completes the identification of the phase diagram of the Potts model on the random dd-regular graph. As a second example, we consider the high external field and low temperature phases of the system on locally tree-like graphs with general degree distribution.

1. Random cluster models

In this section, we motivate the problem, introduce the models, and state our main results.

1.1. Introduction and motivation

Random cluster models on random graphs have received significant attention in the literature as a key example of percolation models with dependent edges. See [23] for an exposition of the random cluster model, also sometimes called FK-percolation after the pioneers Fortuin and Kasteleyn [20], who invented the model. We also refer to [18, 19] for further properties of the random cluster model. In particular, the random cluster model can be used to study various important models in statistical mechanics in one unified way. The models include percolation for q=1q=1, the Ising model for q=2q=2, and the general qq-state Potts model for q3q\geq 3. These models are paradigmatic models in statistical mechanics in that they all display a phase transition on most infinite graphs, and this phase transition can have rather different shapes.

In this paper, we generalise the recent results of Bencs, Borbényi and Csikváry [4] that translates the partition function of the random cluster model on general graphs having not too many short cycles to include a magnetic field. There are many papers that study Ising, Potts and random cluster models on random graphs. For the Ising model, let us refer to [8, 9, 10, 12, 13, 15, 16, 17] to mention just a few. An overview of results is given in [26]. For the Ising model, the picture is quite clear. The thermodynamic limit of the logarithm of the partition function is proved to exist for general parameters, as well as general random graphs models whose local limit is a (random) tree. From this, the nature of the phase transition can be deduced.

While there are some results on Potts and random cluster models [3, 4, 14, 22, 24], the picture there is less complete. In particular, all results on random graphs apply to the random dd-regular graph, or to annealed settings. It is shown that the pressure per particle exists in the absence of a magnetic field, but not yet in the presence of an external field. This makes it more difficult to study the nature of the phase transition in terms of the existence of a dominant state. Potts and random cluster models have also been studied from the combinatorial perspective, due to their links with Tutte polynomials, and the algorithmic perspective, in terms of the complexity of computing the partition function. We refer to [4, 24] for extensive literature overviews on these topics.

1.2. Model

In this section, we state the models that we will consider. We start by describing the random cluster model, followed by a discussion of locally tree-like graphs.

The random cluster model.

We follow [23]. Let G=(V(G),E(G))G=(V(G),E(G)) be a finite graph with vertex set V(G)V(G) and edge set E(G)E(G). We assume that |V(G)|=n|V(G)|=n. The random cluster measure is denoted by ϕp,q\phi_{p,q}, and gives a measure on configurations 𝝎=(ω(e))eE\bm{\omega}=(\omega(e))_{e\in E}, where the edge variables ω(e)\omega(e) satisfy ω(e){0,1}\omega(e)\in\{0,1\}. We think of ee for which ω(e)=1\omega(e)=1 as being present, and ee for which ω(e)=0\omega(e)=0 as being vacant. The random cluster measure ϕp,q\phi_{p,q} is given by

(1.1) ϕp,q(𝝎)=1Zn,RC(p,q)qk(𝝎)eE(G)pω(e)(1p)1ω(e),\phi_{p,q}(\bm{\omega})=\frac{1}{Z_{n,\rm RC}(p,q)}q^{k(\bm{\omega})}\prod_{e\in E(G)}p^{\omega(e)}(1-p)^{1-\omega(e)},

where q>0q>0 and p[0,1]p\in[0,1], and k(𝝎)k(\bm{\omega}) denotes the number of connected components of the subgraph GpG_{p} with vertex set V(G)V(G) and edge set Ep(G)={eE(G):ω(e)=1}E_{p}(G)=\{e\in E(G)\colon\omega(e)=1\}. The partition function, or normalising constant, Zn,RC(p,q)Z_{n,\rm RC}(p,q) is given by

(1.2) Zn,RC(p,q)=𝝎qk(𝝎)eE(G)pω(e)(1p)1ω(e),Z_{n,\rm RC}(p,q)=\sum_{\bm{\omega}}q^{k(\bm{\omega})}\prod_{e\in E(G)}p^{\omega(e)}(1-p)^{1-\omega(e)},

where the sum is over all bond variables ω(e){0,1}\omega(e)\in\{0,1\}.

The relation to Potts models.

In the above, q>0q>0 is general, as it will often be in this paper. We now specialise to q{1,2,3}q\in\{1,2,3\ldots\}, and relate the above model to the Potts model. For this, we need to specify vertex variables 𝝈=(σx)xV(G)[q]V(G)\bm{\sigma}=(\sigma_{x})_{x\in V(G)}\in[q]^{V(G)}, where [q]={1,,q}[q]=\{1,\ldots,q\}. We first define a joint law μp,q(𝝈,𝝎)\mu_{p,q}(\bm{\sigma},\bm{\omega}) given by

(1.3) μp,q(𝝈,𝝎)=1Zn(p,q){x,y}E(G)[(1p)1l{ω({x,y})=0}+p1l{ω({x,y})=1}1l{σx=σy}],\mu_{p,q}(\bm{\sigma},\bm{\omega})=\frac{1}{Z_{n}(p,q)}\prod_{\{x,y\}\in E(G)}\Big{[}(1-p){\mathchoice{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.5mu\mathrm{l}}{1\mskip-5.0mu\mathrm{l}}}_{\{\omega(\{x,y\})=0\}}+p{\mathchoice{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.5mu\mathrm{l}}{1\mskip-5.0mu\mathrm{l}}}_{\{\omega(\{x,y\})=1\}}{\mathchoice{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.5mu\mathrm{l}}{1\mskip-5.0mu\mathrm{l}}}_{\{\sigma_{x}=\sigma_{y}\}}\Big{]},

where the partition function, or normalising constant, Zn(p,q)Z_{n}(p,q) is now given by

(1.4) Zn(p,q)=𝝈,𝝎{x,y}E(G)[(1p)1l{ω({x,y})=0}+p1l{ω({x,y})=1}1l{σx=σy}],Z_{n}(p,q)=\sum_{\bm{\sigma},\bm{\omega}}\prod_{\{x,y\}\in E(G)}\Big{[}(1-p){\mathchoice{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.5mu\mathrm{l}}{1\mskip-5.0mu\mathrm{l}}}_{\{\omega(\{x,y\})=0\}}+p{\mathchoice{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.5mu\mathrm{l}}{1\mskip-5.0mu\mathrm{l}}}_{\{\omega(\{x,y\})=1\}}{\mathchoice{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.5mu\mathrm{l}}{1\mskip-5.0mu\mathrm{l}}}_{\{\sigma_{x}=\sigma_{y}\}}\Big{]},

and the sum is over all bond variables ω(e){0,1}\omega(e)\in\{0,1\} and vertex variables σv[q]\sigma_{v}\in[q] for all vV(G)v\in V(G).

The key coupling result is that (cf. [23, Theorem (1.10)]) for p=1eβp=1-{\rm e}^{-\beta} and qq\in{\mathbb{N}}, the spin marginal 𝝈μp,q(𝝈)\bm{\sigma}\mapsto\mu_{p,q}(\bm{\sigma}) obtained by summing out over the bond variables is the Potts model with parameters β\beta and qq, while the bond marginal 𝝎μp,q(𝝎)\bm{\omega}\mapsto\mu_{p,q}(\bm{\omega}) obtained by summing out over the vertex spins is the random cluster measure.

Equations (1.3)–(1.4) define the random cluster and Potts model without an external field, and we now extend it to an external field. For this, we define the Potts model partition function, with inverse temperature β0\beta\geq 0 and external field BB, as

(1.5) ZGPotts(q,β,B)=𝝈[q]V(G)eH(𝝈),Z_{G}^{\scriptscriptstyle\rm Potts}(q,\beta,B)=\sum_{\bm{\sigma}\in[q]^{V(G)}}{\rm e}^{-H(\bm{\sigma})},

where

(1.6) H(𝝈)=Hβ,B(𝝈)=β{u,v}E(G)1l{σu=σv}BvV(G)1l{σv=1}.H(\bm{\sigma})=H_{\beta,B}(\bm{\sigma})=-\beta\sum_{\{u,v\}\in E(G)}{\mathchoice{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.5mu\mathrm{l}}{1\mskip-5.0mu\mathrm{l}}}_{\{\sigma_{u}=\sigma_{v}\}}-B\sum_{v\in V(G)}{\mathchoice{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.0mu\mathrm{l}}{1\mskip-4.5mu\mathrm{l}}{1\mskip-5.0mu\mathrm{l}}}_{\{\sigma_{v}=1\}}.

Note that ZGPotts(q,β,0)=eβ|E(G)|Zn(p,q)Z_{G}^{\scriptscriptstyle\rm Potts}(q,\beta,0)={\rm e}^{-\beta|E(G)|}Z_{n}(p,q) with p=1eβp=1-{\rm e}^{-\beta}, but that will play no role in what follows. In this paper, we investigate this partition function, as well as its random cluster model extension, which we define next.

The random cluster model with external field.

We next define the main object of study, which is the random cluster model with a weight that we think of as an external field. For Potts and Ising models, this weighted model is exactly the Potts/Ising model with an external field, while the definition extends to non-integer qq. Let q>1q>1 be a positive real number, and w=eβ1w={\rm e}^{\beta}-1. Then, we define the random cluster measure with external field BB, inspired by [7], by

(1.7) μG(𝝎)=W(𝝎)ZG(q,w,B),andW(𝝎)=eE(G)wωeC𝒞(𝝎)(1+(q1)eB|C|),\mu_{G}(\bm{\omega})=\frac{W(\bm{\omega})}{Z_{G}(q,w,B)},\qquad\text{and}\qquad W(\bm{\omega})=\prod_{e\in E(G)}w^{\omega_{e}}\prod_{C\in\mathscr{C}(\bm{\omega})}(1+(q-1){\rm e}^{-B|C|}),

where the normalisation constant ZG(q,w,B)Z_{G}(q,w,B) is given by

(1.8) ZG(q,w,B)=𝝎eE(G)wωeC𝒞(𝝎)(1+(q1)eB|C|),Z_{G}(q,w,B)=\sum_{\bm{\omega}}\prod_{e\in E(G)}w^{\omega_{e}}\prod_{C\in\mathscr{C}(\bm{\omega})}(1+(q-1){\rm e}^{-B|C|}),

where 𝒞(𝝎)\mathscr{C}(\bm{\omega}) is the collection of connected components in 𝝎\bm{\omega}. It is this measure that we will focus on in this paper. The following lemma relates the partition function for the Potts model with external field BB to ZG(q,w,B):Z_{G}(q,w,B):

Lemma 1.1 (Relation Potts and random cluster partition function).

Let q2q\geq 2 be an integer, and let G=(V(G),E(G))G=(V(G),E(G)) be a finite graph. Then, with β=log(1+w)\beta=\log(1+w),

ZGPotts(β,B)=eB|V(G)|ZG(q,w,B).Z_{G}^{\scriptscriptstyle\rm Potts}(\beta,B)={\rm e}^{B|V(G)|}Z_{G}(q,w,B).

We next describe the random graph models that we will be working on.

Random graphs and local convergence.

In the above, the finite graph G=(V(G),E(G))G=(V(G),E(G)) is general. Here, we introduce the kind of random graphs that we shall work on. We will consider graph sequences (Gn)n(G_{n})_{n\geq} of growing size, where Gn=(V(Gn),E(Gn))G_{n}=(V(G_{n}),E(G_{n})), with V(Gn)V(G_{n}) and E(Gn)E(G_{n}) denoting the vertex and edge sets of GnG_{n}, respectively. We assume that |V(Gn)|=n|V(G_{n})|=n, and assume that nn tends to infinity.

Condition 1.2 (Uniform sparsity).

We assume that (Gn)n(G_{n})_{n\geq} are uniformly sparse, in the sense that DnD_{n}, the degree of a random vertex in V(Gn)V(G_{n}), satisfies that

(1.9) DndD,𝔼[Dn]𝔼[D],D_{n}\stackrel{{\scriptstyle\scriptscriptstyle{d}}}{{\longrightarrow}}D,\qquad\mathbb{E}[D_{n}]\rightarrow\mathbb{E}[D],

for some limiting degree distribution DD. \blacktriangleleft

We will strongly rely on local convergence, as introduced by Benjamini and Schramm in [6], and, independently by Aldous and Steele in [2]. We refer to [25, Chapter 2] for an overview of the theory, and [25, Chapters 3-5] for several examples. By [5], (1.9) implies that the graph sequence (Gn)n(G_{n})_{n\geq} is precompact in the local topology, meaning that every subsequence has a further subsequence that converges in the local topology. See also [1] for further discussion. Our main assumption is that the graph sequence (Gn)n(G_{n})_{n\geq} is locally tree-like:

Condition 1.3 (Locally tree-like random graph sequences).

We assume that (Gn)n(G_{n})_{n\geq} are locally tree-like, in the sense that GnG_{n} converges locally in probability to a rooted graph (G,o)(G,o) that is almost surely a tree. \blacktriangleleft

Conditions 1.2 and 1.3 have a long history in considering Ising and Potts models on random graphs. See e.g., [13, 12, 14, 16] for some of the relevant references. Below, and throughout the paper, we call a graph sequence (Gn)n(G_{n})_{n\geq} locally tree-like when Conditions 1.2 and 1.3 both hold.

Organisation of this section

This section is organised as follows. We start by describing our main results, which are divided into three parts. In Section 1.3, we rewrite the random cluster partition function with general external field B>0B>0 in terms of an extended Ising model with specific vertex-dependent external fields. In Section 1.4, we use this representation to give a lower bound on the partition function by the Bethe partition function. In Section 1.5, we use these results to analyse the phase transition of the Potts model on random dd-regular graphs. In Section 1.6, we describe the results for the extended Ising model, and their consequences on the random cluster model for high external magnetic fields and low temperature. We close in Section 1.7 by discussing our results and stating open problems.

1.3. Main results for general graphs

In this section, we explain how the partition function of the random cluster model with non-negative external field can be rewritten in terms of an Ising model with vertex-dependent external fields.

Rank-2 approximation to random cluster model with external fields.

We first give bounds on the partition function of the random cluster model with external field, extending the work of Bencs, Borbényi and Csikváry [4] to non-zero external fields:

Theorem 1.4 (Rank-2 approximation of random cluster partition function with external field).

Let G=(V(G),E(G))G=(V(G),E(G)) be a finite graph. Then if q2q\geq 2 and B0B\geq 0,

(1.10) ZG(2)(q,w,B)ZG(q,w,B)q(G)ZG(2)(q,w,B),Z^{\scriptscriptstyle(2)}_{G}(q,w,B)\leq Z_{G}(q,w,B)\leq q^{\mathcal{L}(G)}Z^{\scriptscriptstyle(2)}_{G}(q,w,B),

where

(1.11) (G)=maxAE|{connected components of GA=(V(G),A) containing a cycle}|,\mathcal{L}(G)=\max_{A\subseteq E}|\{\text{\rm connected components of $G_{A}=(V(G),A)$ containing a cycle}\}|,

and

(1.12) ZG(2)(q,w,B)\displaystyle Z^{\scriptscriptstyle(2)}_{G}(q,w,B) =SV(G)(1+w)|E(S)|(1+wq1)|E(V(G)S)|((q1)eB)|V(G)||S|.\displaystyle=\sum_{S\subseteq V(G)}(1+w)^{|E(S)|}\left(1+\frac{w}{q-1}\right)^{|E(V(G)\setminus S)|}((q-1){\rm e}^{-B})^{|V(G)|-|S|}.

The proof of Theorem 1.4 is given in Section 2, and closely follows Bencs, Borbényi and Csikváry [4].

We next use Theorem 1.4 to investigate the pressure per particle of the random cluster model. We can trivially bound

(1.13) (G)|V(G)|k+i=2k1i(G),\mathcal{L}(G)\leq\frac{|V(G)|}{k}+\sum_{i=2}^{k-1}\mathcal{L}_{i}(G),

where

(1.14) i(G)=max{l:Gcontains l vertex-disjoint cycles of length i}.\mathcal{L}_{i}(G)=\max\{l\colon G\leavevmode\nobreak\ \text{\rm contains $l$ vertex-disjoint cycles of length $i$}\}.

In particular, for graphs Gn=(V(Gn),E(Gn))G_{n}=(V(G_{n}),E(G_{n})) on |V(Gn)|=n|V(G_{n})|=n vertices, having a locally tree-like limit, we can bound

(1.15) 1n(Gn)1k+1ni=2k1i(Gn)1k,\frac{1}{n}\mathcal{L}(G_{n})\leq\frac{1}{k}+\frac{1}{n}\sum_{i=2}^{k-1}\mathcal{L}_{i}(G_{n})\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}\frac{1}{k},

since i(Gn)/n0\mathcal{L}_{i}(G_{n})/n\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}0 by the fact that the local limit is tree-like (recall Condition 1.3). Since kk is arbitrary, it follows that

(1.16) 1nlogZGn(q,w,B)=1nlogZGn(2)(q,w,B)+o(1).\frac{1}{n}\log Z_{G_{n}}(q,w,B)=\frac{1}{n}\log Z_{G_{n}}^{\scriptscriptstyle(2)}(q,w,B)+o(1).

Thus, the pressure per particle for the random cluster model is the same as that for the rank-2 approximation, as will be a guiding principle for this paper:

Corollary 1.5 (Rank-2 approximation of random cluster partition function with external field).

Let Gn=(V(Gn),E(Gn))G_{n}=(V(G_{n}),E(G_{n})) be a finite graph of size |V(Gn)|=n|V(G_{n})|=n. Then if q2q\geq 2 and B0B\geq 0,

(1.17) limn1nlogZGn(q,w,B)=limn1nlogZGn(2)(q,w,B).\lim_{n\rightarrow\infty}\frac{1}{n}\log Z_{G_{n}}(q,w,B)=\lim_{n\rightarrow\infty}\frac{1}{n}\log Z^{\scriptscriptstyle(2)}_{G_{n}}(q,w,B).

We continue by investigating the rank-2 approximation ZGn(2)(q,w,B)Z^{\scriptscriptstyle(2)}_{G_{n}}(q,w,B) in more detail.

Rewrite of rank-2 approximation in terms of two-spin models.

We next write the expressions in (1.12) in terms of two-spin models, which will turn out to be general Ising models with vertex-dependent external fields. Define

(1.18) ZG(ψ,ψ¯)=𝝈{+,}V(G)vV(G)ψ¯(σv){u,v}E(G)ψ(σu,σv),Z_{G}(\psi,\overline{\psi})=\sum_{\bm{\sigma}\in\{+,-\}^{V(G)}}\prod_{v\in V(G)}\overline{\psi}(\sigma_{v})\prod_{\{u,v\}\in E(G)}\psi(\sigma_{u},\sigma_{v}),

where we use a slight abuse of notation and write ++ instead of +1+1 and - instead of 1-1. Sly and Sun [29] show that any two-spin model on regular graphs can be mapped to an Ising model, which can be ferro- or antiferromagnetic. Our second main result rewrites the partition function of the rank-2 approximation of the random cluster model with inverse temperature β\beta and external field BB in terms of the partition function of a ferromagnetic two-spin model:

Theorem 1.6 (Rewrite in terms of two-spin models).

Let G=(V(G),E(G))G=(V(G),E(G)) be a finite graph. For every q,w,Bq,w,B,

(1.19) ZG(2)(q,w,B)=ZG(ψ,ψ¯),Z^{\scriptscriptstyle(2)}_{G}(q,w,B)=Z_{G}(\psi,\overline{\psi}),

where

(1.20) ψ(+,+)=1+w,ψ(+,)=ψ(,+)=1,ψ(,)=1+w/(q1),\psi(+,+)=1+w,\quad\psi(+,-)=\psi(-,+)=1,\quad\psi(-,-)=1+w/(q-1),

and

(1.21) ψ¯(+)=1,ψ¯()=(q1)eB.\overline{\psi}(+)=1,\qquad\overline{\psi}(-)=(q-1){\rm e}^{-B}.

With Theorem 1.6 in hand, we now set to reformulating this result in terms of ferromagnetic Ising models.

Relation to general Ising models.

We next turn to Sly and Sun [29], who investigate general two-spin models, and relate them to Ising models. Note that

(1.22) ZG(ψ,ψ¯)=(ψ¯(+)ψ¯())n/2𝝈{1,1}V(G)vV(G)ehσv{u,v}E(G)ψ(σu,σv),Z_{G}(\psi,\overline{\psi})=(\overline{\psi}(+)\overline{\psi}(-))^{n/2}\sum_{\bm{\sigma}\in\{-1,1\}^{V(G)}}\prod_{v\in V(G)}{\rm e}^{h\sigma_{v}}\prod_{\{u,v\}\in E(G)}\psi(\sigma_{u},\sigma_{v}),

where

(1.23) e2h=ψ¯(+)ψ¯(),{\rm e}^{2h}=\frac{\overline{\psi}(+)}{\overline{\psi}(-)},

so that

(1.24) h=12log(ψ¯(+)/ψ¯())=12log(eB/(q1)).h=\frac{1}{2}\log(\overline{\psi}(+)/\overline{\psi}(-))=\frac{1}{2}\log({\rm e}^{B}/(q-1)).

Then, since ψ>0\psi>0, we can rewrite (see [29, page 2393])

(1.25) ψ(σ,σ)=eB0eβσσek(σ+σ),\psi(\sigma,\sigma^{\prime})={\rm e}^{B_{0}}{\rm e}^{\beta^{*}\sigma\sigma^{\prime}}{\rm e}^{k(\sigma+\sigma^{\prime})},

where the parameters B0B_{0}, kk and β\beta^{*} are determined by

(1.26) ψ(+,+)ψ(,)\displaystyle\frac{\psi(+,+)}{\psi(-,-)} =e4k,\displaystyle={\rm e}^{4k},
(1.27) ψ(+,+)ψ(,)ψ(+,)2\displaystyle\frac{\psi(+,+)\psi(-,-)}{\psi(+,-)^{2}} =e4β,\displaystyle={\rm e}^{4\beta^{*}},
(1.28) ψ(+,+)ψ(+,)2ψ(,)\displaystyle\psi(+,+)\psi(+,-)^{2}\psi(-,-) =e4B0.\displaystyle={\rm e}^{4B_{0}}.

Thus,

(1.29) k=14log(1+w1+w/(q1)),k=\frac{1}{4}\log\left(\frac{1+w}{1+w/(q-1)}\right),

and, by (1.20) and (1.27),

(1.30) (1+w/(q1))(1+w)=e4β,(1+w/(q-1))(1+w)={\rm e}^{4\beta^{*}},

so that

(1.31) β=14log((1+w)(1+w/(q1))),\beta^{*}=\frac{1}{4}\log((1+w)(1+w/(q-1))),

while, by (1.20) and (1.28),

(1.32) (1+w/(q1))(1+w)=e4B0,(1+w/(q-1))(1+w)={\rm e}^{4B_{0}},

so that

(1.33) B0=14log((1+w)(1+w/(q1)))=β.B_{0}=\frac{1}{4}\log((1+w)(1+w/(q-1)))=\beta^{*}.

We conclude that

(1.34) ZG(ψ,ψ¯)=(eB(q1))n/2eβ|E(G)|ZGeIsing(β,k,h),Z_{G}(\psi,\overline{\psi})=({\rm e}^{-B}(q-1))^{n/2}{\rm e}^{\beta^{*}|E(G)|}Z_{G}^{\scriptscriptstyle\rm eIsing}(\beta^{*},k,h),

where we define the partition function of the extended Ising model as

(1.35) ZGeIsing(β,k,h):=𝝈{1,1}V(G)exp(β{u,v}E(G)σuσv+vV(G)(kdv+h)σv),Z_{G}^{\scriptscriptstyle\rm eIsing}(\beta^{*},k,h):=\sum_{\bm{\sigma}\in\{-1,1\}^{V(G)}}\exp\left(\beta^{*}\sum_{\{u,v\}\in E(G)}\sigma_{u}\sigma_{v}+\sum_{v\in V(G)}(kd_{v}+h)\sigma_{v}\right),

and dv=dv(G)d_{v}=d_{v}(G) is the degree of vertex vV(G)v\in V(G). This Ising model is unusual, due to the vertex-dependent external fields, which are governed by the degrees of the vertices in the graph. We defer a discussion of the parameters to below Corollary 1.7.

The above computations lead to the following two corollaries:

Corollary 1.7 (Rewrite in terms of extended Ising models).

Let G=(V(G),E(G))G=(V(G),E(G)) be a finite graphs with |V(G)|=n|V(G)|=n vertices. For every q,w,Bq,w,B,

(1.36) ZG(2)(q,w,B)=(eB(q1))n/2eβ|E(G)|ZGeIsing(β,k,h),\displaystyle Z^{\scriptscriptstyle(2)}_{G}(q,w,B)=({\rm e}^{-B}(q-1))^{n/2}{\rm e}^{\beta^{*}|E(G)|}Z_{G}^{\scriptscriptstyle\rm eIsing}(\beta^{*},k,h),

where kk is given in (1.29), β\beta^{*} in (1.31), and hh in (1.24).

Corollary 1.8 (Thermodynamic limit of random cluster model).

Let Gn=(V(Gn),E(Gn))G_{n}=(V(G_{n}),E(G_{n})) be a random graph with |V(Gn)|=n|V(G_{n})|=n vertices that is locally tree-like. Then, if q2q\geq 2 and B0B\geq 0,

(1.37) limn1nlogZGn(q,w,B)=β2𝔼[Do]+12log(eB(q1))+limn1nlogZGneIsing(β,k,h),\lim_{n\rightarrow\infty}\frac{1}{n}\log Z_{G_{n}}(q,w,B)=\frac{\beta^{*}}{2}\mathbb{E}[D_{o}]+\frac{1}{2}\log({\rm e}^{-B}(q-1))+\lim_{n\rightarrow\infty}\frac{1}{n}\log Z_{G_{n}}^{\scriptscriptstyle\rm eIsing}(\beta^{*},k,h),

where kk is given in (1.29), β\beta^{*} in (1.31), and hh in (1.24), and provided the limit on the rhs exists.

Let us make some observations at this point:

Remark 1.9 (Discussion of the parameters).

We next discuss the nature of the extended Ising model:

Sign of β\beta^{*}:

Since w=eβ1w={\rm e}^{\beta}-1, and β>0\beta>0, we have that β>0\beta^{*}>0 as well. Thus, our extended Ising model is ferromagnetic;

Prefactors and B0B_{0}:

The factor multiplying ZGeIsing(β,k,h)Z_{G}^{\scriptscriptstyle\rm eIsing}(\beta^{*},k,h) is a constant, and will thus not play a significant role in the properties of our model;

Sign of kk:

We have that kk in (1.29) satisfies that k>0k>0 for q>2q>2;

Sign external fields:

The difficulty is that kk in (1.29), and hh in (1.24) might have opposite signs. Thus, the vertex-dependent external field Bv=kdv+hB_{v}=kd_{v}+h for vV(G)v\in V(G) potentially alternates in sign, depending on the degrees. The sign is fixed when dv=dd_{v}=d for all vV(G)v\in V(G), i.e., for dd-regular graphs. The sign is also fixed for q>2q>2 when h0h\geq 0, i.e., Blog(q1)B\geq\log(q-1), in which case we have a high external field. In all other cases, the sign of the vertex-dependent external field is negative for vertices of small degree, and positive for vertices of large degree. For such mixed ferromagnetic/anti-ferromagnetic models, few results are known;

Extended Ising model:

The Ising model with vertex-dependent external fields of the form kdv+hkd_{v}+h for vV(G)v\in V(G) has not been investigated in the literature. However, when kdv+hBmin>0kd_{v}+h\geq B_{\min}>0, i.e., all vertices have an external field that is bounded below by a positive constant, the methods in [12, 13, 14, 16] can be used to compute the thermodynamic limit of the partition function. We refer to [26] for an extensive overview of Ising models on random graphs. \blacktriangleleft

1.4. Bethe functional on random graphs

We next use the above representation, combined with a result of Ruozzi [28], to show that the partition function of the random cluster model is bounded below by the Bethe partition function. See also [31] for more details on the Bethe partition function, and [30], where the authors first conjectured the bound that we are about to discuss. Further, see [27] for background on belief propagation, and the introduction to [11] for a concise explanation.

Before being able to state this bound, let us introduce some notation. Recall (1.18), and, in terms of this, define ZB(G,μ)Z_{\rm B}(G,\mu) by

logZB(G,μ)\displaystyle\log Z_{B}(G,\mu) =vV(G)σ{+,}μv(σ)logψ¯(σ)+{u,v}E(G)σ,σμ{u,v}(σ,σ)logψ(σ,σ)\displaystyle=\sum_{v\in V(G)}\sum_{\sigma\in\{+,-\}}\mu_{v}(\sigma)\log\overline{\psi}(\sigma)+\sum_{\{u,v\}\in E(G)}\sum_{\sigma,\sigma^{\prime}}\mu_{\{u,v\}}(\sigma,\sigma^{\prime})\log\psi(\sigma,\sigma^{\prime})
(1.38) vV(G)σ{+,}μv(σ)logμv(σ){u,v}E(G)σ,σμ{u,v}(σ,σ)log(μ{u,v}(σ,σ)μu(σ)μv(σ)),\displaystyle\quad-\sum_{v\in V(G)}\sum_{\sigma\in\{+,-\}}\mu_{v}(\sigma)\log\mu_{v}(\sigma)-\sum_{\{u,v\}\in E(G)}\sum_{\sigma,\sigma^{\prime}}\mu_{\{u,v\}}(\sigma,\sigma^{\prime})\log\Big{(}\frac{\mu_{\{u,v\}}(\sigma,\sigma^{\prime})}{\mu_{u}(\sigma)\mu_{v}(\sigma^{\prime})}\Big{)},

where

(1.39) μ=((μv(σ))vV(G),σ{+,},(μe(σ,σ))eE(G),σ,σ{+,})\mu=\Big{(}(\mu_{v}(\sigma))_{v\in V(G),\sigma\in\{+,-\}},(\mu_{e}(\sigma,\sigma^{\prime}))_{e\in E(G),\sigma,\sigma^{\prime}\in\{+,-\}}\Big{)}

is a probability distribution with consistent marginals, i.e., μ\mu satisfies that μ0\mu\geq 0 and σ{+,}μv(σ)=1\sum_{\sigma\in\{+,-\}}\mu_{v}(\sigma)=1, while, for every {u,v}E(G)\{u,v\}\in E(G) and σ{+,}\sigma^{\prime}\in\{+,-\},

(1.40) σ{+,}μ{u,v}(σ,σ)=μv(σ).\sum_{\sigma\in\{+,-\}}\mu_{\{u,v\}}(\sigma,\sigma^{\prime})=\mu_{v}(\sigma^{\prime}).

In terms of this notation, let

(1.41) ZB(G)=maxμZB(G,μ).Z_{B}(G)=\max_{\mu}Z_{B}(G,\mu).

The corollary below relates ZG(ψ,ψ¯)Z_{G}(\psi,\overline{\psi}) to the Bethe partition function ZB(G)Z_{B}(G):

Corollary 1.10 (Lower bound in terms of Bethe partition function).

For every graph GG and ZG(ψ,ψ¯)Z_{G}(\psi,\overline{\psi}) as in (1.18), when ψ(+,+)ψ(,)ψ(+,)21\frac{\psi(+,+)\psi(-,-)}{\psi(+,-)^{2}}\geq 1,

(1.42) ZG(ψ,ψ¯)ZB(G).Z_{G}(\psi,\overline{\psi})\geq Z_{B}(G).

As a result, for every q2q\geq 2 and B0B\geq 0, also

(1.43) ZG(q,w,B)ZB(G).Z_{G}(q,w,B)\geq Z_{B}(G).

The above equations in (1.4) and (1.41) are closely related to belief propagation, i.e., the solutions of the belief propagation algorithm are solutions to them as well. For example, we can differentiate ZB(G,μ)Z_{B}(G,\mu) in (1.41) wrt the variables μv(σ)\mu_{v}(\sigma) and μ{u,v}(σ,σ)\mu_{\{u,v\}}(\sigma,\sigma^{\prime}), and use Lagrange multipliers on the constraints. This will give recursion relations for the variables μv(σ)\mu_{v}(\sigma) and μ{u,v}(σ,σ)\mu_{\{u,v\}}(\sigma,\sigma^{\prime}) that are called belief propagation. Such belief propagation equations are exact on a tree, and one can hope that they are almost exact on graphs that are close to trees. Corollary 1.10 shows that the belief propagation solutions always yield lower bounds on the partition function. See Section 4 for belief propagation on trees, where the recursions are exact.

Let us give some background on the proof of Corollary 1.10. We note that

(1.44) ZG(2)(q,w,B)=ZG(ψ,ψ¯)=𝝈{+,}V(G)f(𝝈),Z_{G}^{\scriptscriptstyle(2)}(q,w,B)=Z_{G}(\psi,\overline{\psi})=\sum_{\bm{\sigma}\in\{+,-\}^{V(G)}}f(\bm{\sigma}),

where

(1.45) f(𝝈)=vV(G)ψ¯(σv){u,v}E(G)ψ(σu,σv).f(\bm{\sigma})=\prod_{v\in V(G)}\overline{\psi}(\sigma_{v})\prod_{\{u,v\}\in E(G)}\psi(\sigma_{u},\sigma_{v}).

For 𝝈,𝝈\bm{\sigma},\bm{\sigma}^{\prime}, we let 𝝈𝝈\bm{\sigma}\wedge\bm{\sigma}^{\prime} and 𝝈𝝈\bm{\sigma}\vee\bm{\sigma}^{\prime} be the coordinate-wise minimum and maximum of 𝝈\bm{\sigma} and 𝝈\bm{\sigma}^{\prime}. Then,

(1.46) f(𝝈𝝈)f(𝝈𝝈)f(𝝈)f(𝝈),f(\bm{\sigma}\wedge\bm{\sigma}^{\prime})f(\bm{\sigma}\vee\bm{\sigma}^{\prime})\geq f(\bm{\sigma})f(\bm{\sigma}^{\prime}),

i.e., the function ff is log-supermodular (cf. [28, Definition 2.1]). Ruozzi shows that the lower bound in Corollary 1.10 holds for all log-supermodular functions that are of product structure as in (1.18). In fact, ψ¯(σv)\overline{\psi}(\sigma_{v}) may even depend on the vertex vv as ψ¯v(σv)\overline{\psi}_{v}(\sigma_{v}), and ψ(σu,σv)\psi(\sigma_{u},\sigma^{\prime}_{v}) may depend on the edge {u,v}\{u,v\} as ψ{u,v}(σu,σv)\psi_{\{u,v\}}(\sigma_{u},\sigma^{\prime}_{v}).

The way how Ruozzi proves this statement in [28] is by using kk-covers, which compare graphs to graphs that consist of several copies of the vertex set, and are such that each vertex in each of the copies has exactly the correct number of edges to copies of its neighbours. The main point is that such covers are more tree-like than the original graph, which may intuitively explain the relation to the Bethe partition function. We refer to [28] and the references in it for more details.

1.5. Results for random cluster models on locally tree-like regular graphs

We first analyse the consequences for the dd-regular setting, for which the external field has a fixed sign and is thus vertex independent.

Pressure per particle for general external fields.

Let GnG_{n} be locally tree-like dd-regular graph having |V(Gn)|=n|V(G_{n})|=n vertices. Let us denote φIsing(β,B)\varphi^{\rm\scriptscriptstyle Ising}(\beta,B) as the pressure per particle of the Ising model with inverse temperature β0\beta\geq 0 and external field BB\in\mathbb{R}, i.e.,

(1.47) 1nlogZGnIsing(β,B)φIsing(β,B).\frac{1}{n}\log Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta,B)\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}\varphi^{\rm\scriptscriptstyle Ising}(\beta,B).

This limit exists by [13], see also [12, 14, 16, 17] for related results. Our first result shows that the pressure per particle exists for all β,B\beta,B:

Theorem 1.11 (Thermodynamic limit of random cluster model on regular graphs).

Let Gn=(V(Gn),E(Gn))G_{n}=(V(G_{n}),E(G_{n})) be a locally tree-like dd-regular graph having |V(Gn)|=n|V(G_{n})|=n vertices. Then, for all q2q\geq 2 and w,B0w,B\geq 0, the limit φ(w,B)=limn1nlogZG(q,w,B)\varphi(w,B)=\lim_{n\rightarrow\infty}\tfrac{1}{n}\log Z_{G}(q,w,B) is given by

(1.48) φ(w,B)=βd2+12log(eB(q1))+φIsing(β,B)\varphi(w,B)=\frac{\beta^{*}d}{2}+\frac{1}{2}\log({\rm e}^{-B}(q-1))+\varphi^{\rm\scriptscriptstyle Ising}(\beta^{*},B^{*})

where w=eβ1w={\rm e}^{\beta}-1,

(1.49) β=β4+14log(1+eβ1q1),\beta^{*}=\frac{\beta}{4}+\frac{1}{4}\log\Big{(}1+\frac{{\rm e}^{\beta}-1}{q-1}\Big{)},

and

(1.50) B\displaystyle B^{*} =d4log(1+w1+w/(q1))+12log(eB/(q1)).\displaystyle=\frac{d}{4}\log\left(\frac{1+w}{1+w/(q-1)}\right)+\frac{1}{2}\log({\rm e}^{B}/(q-1)).

Due to the link to the Ising model (where now the external fields are constant) in Corollary 1.8, this result follows directly from the literature, in particular [13]. We refer to [12, 14, 16, 17] for related results, and [26] for an overview of the Ising model on locally tree-like random graphs. The whole point is that these references prove that the pressure per particle for Ising models exists for all locally tree-like random graphs, and fixed external fields.

The nature of the phase transition.

We next analyse the phase transition in terms of β\beta. For q>2q>2, the phase transition when B=0B=0 follows from the analysis by Bencs, Borbényi and Csikváry in [4]. We will show that the first-order phase transition persists for certain positive external fields B>0B>0.

For q2q\geq 2 and d3d\geq 3, define

(1.51) q,d(x)=x2/d111q1x2/d,\ell_{q,d}(x)=\frac{x^{2/d}-1}{1-\tfrac{1}{q-1}x^{2/d}},

and

(1.52) wc(B):=q,d((q1)eB)w_{c}(B):=\ell_{q,d}((q-1){\rm e}^{-B})

Then the critical curve is defined by

(1.53) 𝒞={(w,B):w=wc(B), 0B<B+},\mathscr{C}=\{(w,B):w=w_{c}(B),\,0\leq B<B_{+}\},

where B+>0B_{+}>0 is the unique positive solution of

(1.54) (1+wc(B))(1+wc(B)/(q1))=(dd2)2.(1+w_{c}(B))(1+w_{c}(B)/(q-1))=\left(\frac{d}{d-2}\right)^{2}.

The following theorem describes the first-order phase transition of random cluster model:

Theorem 1.12 (First-order phase transition for random-cluster model on regular graph).

If q>2q>2, the random cluster model on a sequence of locally tree-like dd-regular graph undergoes a first-order phase transition at the critical curve 𝒞\mathscr{C} parameterised by the equation (1.53). More precisely, for 0B<B+0\leq B<B_{+},

wφ(wc(B)+,B)wφ(wc(B),B).\partial_{w}\varphi(w_{c}(B)^{+},B)\neq\partial_{w}\varphi(w_{c}(B)^{-},B).

where φ(w,B)\varphi(w,B) is defined in (1.48) with w=eβ1w={\rm e}^{\beta}-1. For (w,B)𝒞(w,B)\not\in\mathscr{C}, instead, there is no phase transition, that is, wφ(w,B)w\mapsto\varphi(w,B) is analytic.

Remark 1.13 (How does q2q\neq 2 arise?).

When q2q\searrow 2, the curve shrinks to the critical point of the Ising model (wcIsing,0)(w_{c}^{\rm\scriptscriptstyle Ising},0) with wcIsing=eβcIsing1w_{c}^{\rm Ising}={\rm e}^{\beta_{c}^{\rm\scriptscriptstyle Ising}}-1. \blacktriangleleft

Relation to Basak, Dembo and Sly [3] for Potts models with q3q\geq 3.

We close this section by explaining the relation to the work of Basak, Dembo and Sly in [3] that studies the qq-states Potts model on locally tree-like regular graphs with an external field. In this paper, [3, Assumption 1.4] makes an assumption about the form of the pressure per particle in this setting that roughly states that the quenched and annealed pressure per particle agree. More precisely, [3, Assumption 1.4] states that the quenched pressure per particle is the same as the Bethe functional. Our results allow us to prove this assumption. We first show that the quenched and annealed pressure per particle are the same for random dd-regular graphs, which will be an essential ingredient in the proof:

Theorem 1.14 (Quenched equals annealed for random dd-regular graphs).

Let GnG_{n} be a random dd-regular graph with d3d\geq 3 and nn vertices. Then, the quenched and annealed pressures per particle are equal, i.e., for all β0\beta\geq 0 and BB\in\mathbb{R},

(1.55) limn1n𝔼[logZGn(q,w,B)]=limn1nlog𝔼[ZGn(q,w,B)]=φ(w,B).\lim_{n\rightarrow\infty}\frac{1}{n}\mathbb{E}\big{[}\log Z_{G_{n}}(q,w,B)\big{]}=\lim_{n\rightarrow\infty}\frac{1}{n}\log\mathbb{E}[Z_{G_{n}}(q,w,B)]=\varphi(w,B).

Theorem 1.14 has the following direct consequence, showing that the pressure per particle equals the Bethe functional:

Corollary 1.15 (Bethe prediction holds for all B0B\geq 0).

Let GnG_{n} be a regular graph on nn vertices and with degree d3d\geq 3 that converges locally to a dd-regular graph. Then [3, Assumption 1.4] of Potts models with q3q\geq 3 holds for all β0\beta\geq 0, B0B\geq 0.

Proof.

Let GnG_{n} be a regular graph on nn vertices and with degree d3d\geq 3 that converges locally to a dd-regular tree. The limit of the pressure per particle for Ising models exists by local convergence, as shown by Dembo, Montanari, Sly and Sun [14], and the limit of the pressure per particle does not depend on the precise sequence but only on the local limit being a regular tree. Thus, we only need to show that the limit is equal to the Bethe functional, as this is what [3, Assumption 1.4] states. Further, that same paper proves that the annealed pressure of the random dd-regular graph equals the Bethe functional for all B0B\geq 0. By Theorem 1.14, the quenched and annealed pressure per particle agree for the random dd-regular graph and all B0B\geq 0. This means that, for any dd-regular graph GnG_{n} that converges locally to the regular tree, the quenched pressure per particle converges to the Bethe functional. ∎

1.6. Pressure per particle for the extended Ising model with fixed-sign fields

In this section, we investigate the pressure per particle for the extended Ising model with external fields that have a fixed sign, i.e., we consider

(1.56) ZGeIsing(β,k,h):=𝝈{1,1}V(G)exp(β{u,v}E(G)σuσv+uV(G)Bvσu),Z_{G}^{\scriptscriptstyle\rm eIsing}(\beta,k,h):=\sum_{\bm{\sigma}\in\{-1,1\}^{V(G)}}\exp\Big{(}\beta\sum_{\{u,v\}\in E(G)}\sigma_{u}\sigma_{v}+\sum_{u\in V(G)}B_{v}\sigma_{u}\Big{)},

where we define the vertex-dependent external fields (Bv)vV(G)(B_{v})_{v\in V(G)} by

(1.57) Bv=kdv+h.B_{v}=kd_{v}+h.

The following theorem shows that the pressure per particle of such an extended Ising model exists provided the external fields have fixed sign:

Theorem 1.16 (Thermodynamic limit of extended Ising model).

Let (Gn=(V(Gn),E(Gn)))n1(G_{n}=(V(G_{n}),E(G_{n})))_{n\geq 1} be a sequence of locally tree-like random graph having |V(Gn)|=n|V(G_{n})|=n vertices. Suppose that β0\beta\geq 0, k0k\geq 0 and kdmin+h>0kd_{\min}+h>0, where

(1.58) dmin=infn1minvV(Gn)dvd_{\min}=\inf_{n\geq 1}\min_{v\in V(G_{n})}d_{v}

is the minimal degree in the graph. Then, as nn\rightarrow\infty,

(1.59) 1nlogZGneIsing(β,k,h)φeIsing(β,k,h).\frac{1}{n}\log Z_{G_{n}}^{\rm\scriptscriptstyle eIsing}(\beta,k,h)\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}\varphi^{\rm\scriptscriptstyle eIsing}(\beta,k,h).

By symmetry of the spins, the same result holds when k0k\leq 0 and kdmin+h<0kd_{\min}+h<0. We refer to Theorem 4.1 for a more detailed statement, in which a reprentation of φeIsing(β,k,h)\varphi^{\rm\scriptscriptstyle eIsing}(\beta,k,h) is given in terms of message passing recursion relations. For k0k\geq 0, the condition kdmin+h>0kd_{\min}+h>0 is verified either when h>0h>0 or when kdminkd_{\min} is sufficiently large. While the first case can be interpreted as the high external field regime, the second one corresponds to the low temperature regime. The following corollary investigates the high external field, and low temperature, regimes of the random cluster model on locally tree-like random graphs:

Corollary 1.17 (High field or low temperature regimes).

Consider the random cluster model with parameters q2q\geq 2, w=eβ1w={\rm e}^{\beta}-1 and external field B0B\geq 0 on a sequence of locally tree-like random graphs having |V(Gn)|=n|V(G_{n})|=n vertices.

High external field regime:

If B>log(q1)B>\log(q-1) then

(1.60) limn1nlogZGn(q,w,B)=β2𝔼[Do]+12log(eB(q1))+φeIsing(β,k,h).\lim_{n\rightarrow\infty}\frac{1}{n}\log Z_{G_{n}}(q,w,B)=\frac{\beta^{*}}{2}\mathbb{E}[D_{o}]+\frac{1}{2}\log({\rm e}^{-B}(q-1))+\varphi^{\rm\scriptscriptstyle eIsing}(\beta^{*},k,h).
Low temperature regime:

Suppose that

dmin3,w>(q1)2/dmin11(q1)2/dmin1,d_{\min}\geq 3,\qquad w>\frac{(q-1)^{2/d_{\min}}-1}{1-(q-1)^{2/d_{\min}-1}},

where dmind_{\min} is the minimal degree defined in (1.58). Then, (1.60) holds.

Theorem 1.16 is proved in Section 4. While we do not give the precise formula for φeIsing(β,k,h)\varphi^{\rm\scriptscriptstyle eIsing}(\beta,k,h) here, its form will follow from the proof (see Theorem 4.1 below). The proof of Theorem 1.16 follows the proof in [26], which, in turn, is inspired by [13, 14, 16].

1.7. Discussion and open problems

In this section, we discuss our results and state open problems and conjectures.

Relation to the literature for regular graphs.

Dembo, Montanari, Sly and Sun [14] show that [3, Assumption 1.4] holds for dd even and all B0B\geq 0. Bencs, Borbényi and Csikváry [4] prove that it holds for all dd and B=0B=0, improving upon an earlier result by Helmuth, Jenssen and Perkins [24] that applies to qq sufficiently large. With Theorem 1.14, we now know that it holds for all β>0\beta>0 and B0B\geq 0. The main results in [3] are related to the existence of the limiting Potts measure on locally tree-like regular graphs in the local sense, the uniqueness of these limiting measures, and how these relate to boundary conditions. For the phase diagram of some values q,dq,d, we refer to [3, Figure 1]. We also refer to [3] for further consequences of [3, Assumption 1.4].

Aside from the existence and shape of the pressure per particle, and the phase transitions that arise from their non-analyticities, there are deep connections to other problems that have received substantial attention in the literature in the past years. The dynamics of Potts models, and the metastable states that arise from the phase transitions, are investigated by Coja-Oghlan et al. in [11], to which we also refer for the history of the problem and appropriate references. Combinatorial aspects, including the relation to Tutte polynomials, are highlighted in [4] and the references therein. For the relation to the computational hardness of partition functions, we refer to [21] and the references therein.

Thermodynamic limits of extended Ising models.

It would be highly natural, as well as interesting, to show that the partition function of the extended Ising model exists, even when not all external fields have the same sign. This is our next conjecture:

Conjecture 1.18 (Pressure per particle of extended Ising model).

Let GnG_{n} be a graph sequence that is locally tree-like. Let ZGneIsing(β,k,h)Z_{G_{n}}^{\scriptscriptstyle\rm eIsing}(\beta,k,h) denote the partition function of the extended Ising model with parameters β,k,h\beta,k,h defined as in (1.35). Then, there exists φeIsing(β,k,h)\varphi^{\scriptscriptstyle\rm eIsing}(\beta,k,h) such that

(1.61) φneIsing(β,k,h)=1nlogZGneIsing(β,k,h)φeIsing(β,k,h).\varphi_{n}^{\scriptscriptstyle\rm eIsing}(\beta,k,h)=\frac{1}{n}\log Z_{G_{n}}^{\scriptscriptstyle\rm eIsing}(\beta,k,h)\rightarrow\varphi^{\scriptscriptstyle\rm eIsing}(\beta,k,h).

Conjecture 1.18 has the following immediate corollary:

Corollary 1.19 (Pressure per particle of random cluster model).

Let GnG_{n} be a graph sequence that is locally tree-like. Assume that Conjecture 1.18 holds for GnG_{n}. Then,

(1.62) 1nlogZGn(q,w,B)φ(q,w,B):=12log(eB(q1))+12β𝔼[Do]+φeIsing(β,k,h),\frac{1}{n}\log Z_{G_{n}}(q,w,B)\rightarrow\varphi(q,w,B):=\frac{1}{2}\log({\rm e}^{-B}(q-1))+\frac{1}{2}\beta^{*}\mathbb{E}[D_{o}]+\varphi^{\scriptscriptstyle\rm eIsing}(\beta^{*},k,h),

where β,k,h\beta^{*},k,h are given in (1.24)–(1.31).

Proof.

This immediately follows since |E(Gn)|/n𝔼[Do]/2|E(G_{n})|/n\rightarrow\mathbb{E}[D_{o}]/2. ∎

The difficulty in proving Conjecture 1.18 is that the external fields in our representation in terms of the extended Ising model have both positive and negative contributions. Because of this, we cannot use the usual techniques for proving convergence of the pressure per particle. For example, it is not even clear what the ground state, corresponding to β=\beta=\infty or zero temperature, of this model is.

Negative external fields.

The Ising model, arising for q=2q=2, is perfectly symmetric, so that ZG(q,w,B)=ZG(q,w,B)Z_{G}(q,w,-B)=Z_{G}(q,w,B), which allows us to translate results for B0B\leq 0 to B0B\geq 0. This property, however, does not extend to general qq. Our results only apply to non-negative BB. We next explore what happens for B<0B<0 for locally tree-like regular graphs:

Remark 1.20 (Implications of lower bound for regular graphs).

Let GnG_{n} be a regular graph that is locally tree-like. Note that the rank-2 lower bound in Lemma 2.3 is always true. We next look at consequences of this fact. Suppose that

(1.63) 1nlogZG(2)(q,w,B)φB(e)(w,B),\frac{1}{n}\log Z^{\scriptscriptstyle(2)}_{G}(q,w,B)\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}\varphi_{\rm B}^{\rm\scriptscriptstyle(e)}(w,B),

as well as

(1.64) 1nlog𝔼[ZG(2)(q,w,B)]φB(e)(w,B),\frac{1}{n}\log\mathbb{E}[Z^{\scriptscriptstyle(2)}_{G}(q,w,B)]\rightarrow\varphi_{\rm B}^{\rm\scriptscriptstyle(e)}(w,B),

so that quenched and annealed pressures agree for the rank-2 approximation. Here, we think of φB(e)(w,B)\varphi_{\rm B}^{\rm\scriptscriptstyle(e)}(w,B) as the Bethe functional of the (extended) Ising model, but this equality is not needed in what follows. Note that the lower bound in terms of the Bethe functional follows from Corollary 1.10.

Further, assume that we can also show the annealed statement that

(1.65) 1nlog𝔼[ZG(q,w,B)]φB(w,B),\frac{1}{n}\log\mathbb{E}[Z_{G}(q,w,B)]\rightarrow\varphi_{\rm B}(w,B),

where the latter is the Bethe functional of the original random cluster measure. Our final assumption is that the (hopefully reasonably explicit) formulas for φB(w,B)\varphi_{\rm B}(w,B) and φB(e)(w,B)\varphi_{\rm B}^{\rm\scriptscriptstyle(e)}(w,B) allow us to relate them as

(1.66) φB(w,B)=φB(e)(w,B),\varphi_{\rm B}(w,B)=\varphi_{\rm B}^{\rm\scriptscriptstyle(e)}(w,B),

Of course, it may be that this is only true for part of the parameter choices of (β,B)(\beta,B).

Then we claim that the quenched and annealed pressure per particle for locally tree-like regular graphs converges to φB(w,B)=φB(e)(w,B)\varphi_{\rm B}(w,B)=\varphi_{\rm B}^{\rm\scriptscriptstyle(e)}(w,B). This may be used to extend our results to B<0B<0. Indeed, by Lemma 2.3,

(1.67) 1nlogZG(q,w,B)1nlogZG(2)(q,w,B)φB(e)(w,B).\frac{1}{n}\log Z_{G}(q,w,B)\geq\frac{1}{n}\log Z^{\scriptscriptstyle(2)}_{G}(q,w,B)\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}\varphi_{\rm B}^{\rm\scriptscriptstyle(e)}(w,B).

Further, since the quenched pressure is bounded from above by the annealed one, also

(1.68) 𝔼[1nlogZG(q,w,B)]1nlog𝔼[ZG(q,w,B)]φB(w,B)=φB(e)(w,B),\mathbb{E}\Big{[}\frac{1}{n}\log Z_{G}(q,w,B)\Big{]}\leq\frac{1}{n}\log\mathbb{E}[Z_{G}(q,w,B)]\rightarrow\varphi_{\rm B}(w,B)=\varphi_{\rm B}^{\rm\scriptscriptstyle(e)}(w,B),

where the last inequality follows from (1.66). Then, we conclude that

(1.69) 1nlogZG(q,w,B)φB(w,B),1nlog𝔼[ZG(q,w,B)]φB(w,B),\frac{1}{n}\log Z_{G}(q,w,B)\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}\varphi_{\rm B}(w,B),\qquad\frac{1}{n}\log\mathbb{E}[Z_{G}(q,w,B)]\rightarrow\varphi_{\rm B}(w,B),

as desired.

Let us close by discussing what we know about these assumptions in (1.63)–(1.66) for random regular graphs. We note that (1.63) and (1.64) follow for random regular graphs, since quenched and annealed Ising models have the same pressure per particle (see e.g., [9]). This also gives an explicit expression for φB(e)(w,B)\varphi_{\rm B}^{\rm\scriptscriptstyle(e)}(w,B).

The computation in (1.65) is for an annealed system, and should thus be simpler than for the quenched system. See e.g., [21, Equation (13)] for an explicit expression for the annealed partition function for B=0B=0, for Potts models. Further, one may hope that the relatively explicit expressions for φB(w,B)\varphi_{\rm B}(w,B) and φB(e)(w,B)\varphi_{\rm B}^{\rm\scriptscriptstyle(e)}(w,B) can be compared to prove (1.66). \blacktriangleleft

The nature of the phase transition in random cluster measures.

It would be highly interesting to use our representation to study the critical nature of the extended Ising model on locally tree-like random graphs beyond the regular setting. It can be expected that the phase transition is second order when q(1,2]q\in(1,2], while it becomes first-order when q>2q>2. For q>2q>2, one can expect the phase transition to persist even for B>0B>0, as follows from our results combined with those of [3], as well as for the annealed case in [22]. In the latter paper, special attention was given to settings where the random graphs have power-law degrees. Remarkably, the phase transition may depend on the power-law exponent for q>2q>2. Indeed, it was shown that the phase transition is second-order when the power-law exponent is below τ(q)\tau(q) for some τ(q)(3,4)\tau(q)\in(3,4), while it is first-order when ττ(q)\tau\geq\tau(q). Here, τ>2\tau>2 is characterised by the limiting proportion of vertices of degree at least kk being of the order k(τ1)k^{-(\tau-1)} in the large-graph limit. Does this ‘smoothing’ of the phase transition also occur in the quenched case?

Connected components in random cluster measures.

One particularly interesting aspect could be to consider the connected component of the random cluster measure, and show that this has a phase transition. So far, most phase transition results for the Ising or Potts model have been proved for the magnetisation instead.

In more detail, denote μβ,q(x,y)=μp,q(σx=σy)1/q\mu_{\beta,q}(x,y)=\mu_{p,q}(\sigma_{x}=\sigma_{y})-1/q for the two-point correlation function of the Potts model. Then, (cf. [23, Theorem (1.16)]) for p=1eβp=1-{\rm e}^{-\beta} and qq\in{\mathbb{N}},

(1.70) μβ,q(x,y)=(11/q)ϕp,q(xy).\mu_{\beta,q}(x,y)=(1-1/q)\phi_{p,q}(x\longleftrightarrow y).

This allows one to compute Potts quantities using the random cluster representation. In particular, the critical value βc(q)\beta_{c}(q) should be the value for which ϕp,q(xy)\phi_{p,q}(x\longleftrightarrow y) will become positive uniformly in xx and yy, or for random xx and yy, i.e., there is a giant component in the corresponding random cluster measure. It would be highly interesting to explore these connections further.

2. Rank-2 approximations to random cluster models

In this section, we rely on Bencs, Borbényi and Csikváry [4] to give a representation of general random cluster measures on random graphs with few cycles.

2.1. Rank-2 approximations to random cluster models without external fields

We rely on [4, Theorem 2.4], which we restate here. For this, we first define some additional notation. For q>0q>0 and w>0w>0, we let

(2.1) ZG(q,w)=AE(G)qk(A)w|A|,Z_{G}(q,w)=\sum_{A\subseteq E(G)}q^{k(A)}w^{|A|},

where we recall that k(A)k(A) denotes the number of connected components of the graph (V(G),A)(V(G),A). To relate this to the random cluster model (or even Potts models), we have to take w=eβ1w={\rm e}^{\beta}-1. Indeed, comparing to (1.2), we see that

(2.2) w=p1p=eβ1,w=\frac{p}{1-p}={\rm e}^{\beta}-1,

since p=1eβp=1-{\rm e}^{-\beta}, so that

(2.3) Zn,RC(p,q)=ωqk(ω)eE(G)pω(e)(1p)1ω(e)=(1p)|E(G)|ZG(q,w).Z_{n,\rm RC}(p,q)=\sum_{\omega}q^{k(\omega)}\prod_{e\in E(G)}p^{\omega(e)}(1-p)^{1-\omega(e)}=(1-p)^{|E(G)|}Z_{G}(q,w).

Thus, obviously, to study the partition function of the random cluster model, it suffices to study ZG(q,w)Z_{G}(q,w) in (2.1). In terms of this notation, [4, Theorem 2.4] reads as follows:

Theorem 2.1 (Rank-2 approximation of random cluster partition function [4, Theorem 2.4]).

Fix q2q\geq 2, and let GG be a finite graph. Then

(2.4) ZG(q,w)ZG(2)(q,w),Z_{G}(q,w)\geq Z_{G}^{\scriptscriptstyle(2)}(q,w),

where

ZG(2)(q,w)=SV(G)(q1)|V(G)S|(1+w)|E(S)|(1+w/(q1))|E(V(G)S)|.Z_{G}^{\scriptscriptstyle(2)}(q,w)=\sum_{S\subseteq V(G)}(q-1)^{|V(G)\setminus S|}(1+w)^{|E(S)|}(1+w/(q-1))^{|E(V(G)\setminus S)|}.

Let GG be a graph with L=L(G,g)L=L(G,g) cycles of length at most g1g-1 and size |V(G)|=n|V(G)|=n. Then also

(2.5) ZG(q,w)qn/g+LZG(2)(q,w).Z_{G}(q,w)\leq q^{n/g+L}Z_{G}^{\scriptscriptstyle(2)}(q,w).

We refer to [4] for its proof.

2.2. Rank-2 lower bound for random cluster models with external fields

We next adapt the proof of Theorem 2.1 to B>0B>0, in anticipation of proving Theorem 1.4. Many parts of this analysis are actually closely related, and we spell out some of the ingredients of the proof.

Our aim is to compare ZG(q,w,B)Z_{G}(q,w,B) with ZG(2)(q,w,B)Z^{\scriptscriptstyle(2)}_{G}(q,w,B), where we recall that

ZG(2)(q,w,B)=SV(G)(1+w)|E(S)|(1+wq1)|E(V(G)S)|((q1)eB)|V(G)||S|.Z^{\scriptscriptstyle(2)}_{G}(q,w,B)=\sum_{S\subseteq V(G)}(1+w)^{|E(S)|}\left(1+\frac{w}{q-1}\right)^{|E(V(G)\setminus S)|}((q-1){\rm e}^{-B})^{|V(G)|-|S|}.

In the following lemma, we reduce qq, and at the same time isolate the dependence on BB:

Lemma 2.2 (Reduction of qq and dependence on BB).

For all qq and BB\in\mathbb{R},

ZG(q,w,B)=SV(G)eB(|S||V(G)|)(1+w)|E(S)|ZGS(q1,w).Z_{G}(q,w,B)=\sum_{S\subseteq V(G)}{\rm e}^{B(|S|-|V(G)|)}(1+w)^{|E(S)|}Z_{G\setminus S}(q-1,w).
Proof.

This proof is an adaptation of [4, Proof of Lemma 2.2]. Recall the Potts model and Lemma 1.1 saying that with β=log(1+w)\beta=\log(1+w), if qq is an integer larger than 22,

(2.6) ZGPotts(q,β,B)=eBnZG(q,w,B).Z_{G}^{\scriptscriptstyle\rm Potts}(q,\beta,B)={\rm e}^{Bn}Z_{G}(q,w,B).

Note that the partition function of the Potts model can be represented as

ZGPotts(β,B)\displaystyle Z_{G}^{\scriptscriptstyle\rm Potts}(\beta,B) =(S,S1,,Sq1)𝒫q(V(G))eB|S|(1+w)|E(S)|i=1q1(1+w)|E(Si)|,\displaystyle=\sum_{(S,S_{1},\ldots,S_{q-1})\in\mathcal{P}_{q}(V(G))}{\rm e}^{B|S|}(1+w)^{|E(S)|}\prod_{i=1}^{q-1}(1+w)^{|E(S_{i})|},

where 𝒫k(U)\mathcal{P}_{k}(U) is the set of all kk-partitions of a set UU. Thus,

(2.7) ZGPotts(q,β,B)\displaystyle Z_{G}^{\scriptscriptstyle\rm Potts}(q,\beta,B) =SV(G)eB|S|(1+w)|E(S)|(S1,,Sq1)𝒫q1(V(G)S)i=1q1(1+w)|E(Si)|\displaystyle=\sum_{S\subseteq V(G)}{\rm e}^{B|S|}(1+w)^{|E(S)|}\sum_{(S_{1},\ldots,S_{q-1})\in\mathcal{P}_{q-1}(V(G)\setminus S)}\prod_{i=1}^{q-1}(1+w)^{|E(S_{i})|}
=SV(G)eB|S|(1+w)|E(S)|ZGSPotts(q1,β,0),\displaystyle=\sum_{S\subseteq V(G)}{\rm e}^{B|S|}(1+w)^{|E(S)|}Z_{G\setminus S}^{\scriptscriptstyle\rm Potts}(q-1,\beta,0),

Combining the last two display equations, we get for all integers q2q\geq 2,

ZG(q,w,B)=SV(G)eB(|S||V(G)|)(1+w)|E(S)|ZGS(q1,w).Z_{G}(q,w,B)=\sum_{S\subseteq V(G)}{\rm e}^{B(|S|-|V(G)|)}(1+w)^{|E(S)|}Z_{G\setminus S}(q-1,w).

Moreover, for a finite graph GG, both expressions in the above equation are polynomials in qq. Therefore, the equation holds for all qq. ∎

The next lemma provides a rank-2 lower bound on the partition function:

Lemma 2.3 (Rank-2 lower bound).

For all q2q\geq 2 and B0B\geq 0,

(2.8) ZG(q,w,B)ZG(2)(q,w,B).Z_{G}(q,w,B)\geq Z^{\scriptscriptstyle(2)}_{G}(q,w,B).
Proof.

By [4, Lemma 2.1], for q1q\geq 1,

(2.9) ZG(q,w)q|V(G)|(1+w/q)|E(G)|.Z_{G}(q,w)\geq q^{|V(G)|}\left(1+w/q\right)^{|E(G)|}.

This can be seen by noting that, since k(A)|V(G)||A|k(A)\geq|V(G)|-|A| for any collection of edges AA,

(2.10) ZG(q,w)=AE(G)qk(A)w|A|AE(G)q|V(G)||A|w|A|=q|V(G)|(1+w/q)|E(G)|.Z_{G}(q,w)=\sum_{A\subseteq E(G)}q^{k(A)}w^{|A|}\geq\sum_{A\subseteq E(G)}q^{|V(G)|-|A|}w^{|A|}=q^{|V(G)|}\left(1+w/q\right)^{|E(G)|}.

Using (2.9) and Lemma 2.2, now for q11q-1\geq 1, so that q2q\geq 2,

ZG(q,w,B)\displaystyle Z_{G}(q,w,B) =SV(G)eB(|S||V(G)|)(1+w)|E(S)|ZGS(q1,w)\displaystyle=\sum_{S\subseteq V(G)}{\rm e}^{B(|S|-|V(G)|)}(1+w)^{|E(S)|}Z_{G\setminus S}(q-1,w)
SV(G)eB(|S||V(G)|)(1+w)|E(S)|(q1)|V(G)||S|(1+w/(q1))|E(V(G)S)|\displaystyle\geq\sum_{S\subseteq V(G)}{\rm e}^{B(|S|-|V(G)|)}(1+w)^{|E(S)|}(q-1)^{|V(G)|-|S|}(1+w/(q-1))^{|E(V(G)\setminus S)|}
=ZG(2)(q,w,B).\displaystyle=Z^{\scriptscriptstyle(2)}_{G}(q,w,B).

2.3. Rank-2 upper bound for random cluster models with external fields

We next proceed with the upper bound, which is only valid for B0B\geq 0:

Lemma 2.4 (Rank-2 upper bound).

For all q2q\geq 2 and B0B\geq 0,

ZG(q,w,B)q(G)ZG(2)(q,w,B),Z_{G}(q,w,B)\leq q^{\mathcal{L}(G)}Z^{\scriptscriptstyle(2)}_{G}(q,w,B),

where

(G)=maxAE|{connected components of GA=(V(G),A) containing a cycle}|.\mathcal{L}(G)=\max_{A\subseteq E}|\{\textrm{\rm connected components of $G_{A}=(V(G),A)$ containing a cycle}\}|.

If we compare the upper bound in Lemma 2.4 to the one in Theorem 2.1, we see that the power of qq is slightly different. It turns out that the bound in Lemma 2.4 allow us to also investigate the annealed setting (for which we have to do a large deviation type estimate on the number of components with cycles), whereas the bound in Theorem 2.1 is not strong enough for that. We refer to Section 3 for details.

Proof.

Let A={eE(G):ωe=1}E(G)A=\{e\in E(G)\colon\omega_{e}=1\}\subseteq E(G), let V1,,VrV_{1},\dots,V_{r} be the vertex sets of the connected components of the graph GA=(V(G),A)G_{A}=(V(G),A), and let A1,,ArA_{1},\dots,A_{r} be the corresponding subsets of AA. If ViV_{i} is an isolated vertex, then, by convention, Ai=A_{i}=\emptyset is the empty set. We define

𝒮A={i:Vi is a tree},A={i:Vi contains a cycle}.\mathcal{S}_{A}=\{i\colon V_{i}\textrm{ is a tree}\},\qquad\mathcal{L}_{A}=\{i\colon V_{i}\textrm{ contains a cycle}\}.

Since |A|(G)|\mathcal{L}_{A}|\leq\mathcal{L}(G),

(2.11) ZG(q,w,B)\displaystyle Z_{G}(q,w,B) =AE(G)w|A|C𝒞(A)(1+(q1)eB|C|)\displaystyle=\sum_{A\subseteq E(G)}w^{|A|}\prod_{C\in\mathscr{C}(A)}(1+(q-1){\rm e}^{-B|C|})
q(G)AE(G)w|A|i𝒮A(1+(q1)eB|Vi|).\displaystyle\leq q^{\mathcal{L}(G)}\sum_{A\subseteq E(G)}w^{|A|}\prod_{i\in\mathcal{S}_{A}}(1+(q-1){\rm e}^{-B|V_{i}|}).

We say that a vertex set RR is compatible with AA if R=iIViR=\cup_{i\in I}V_{i} with I𝒮AI\subseteq\mathcal{S}_{A} is the union of some tree components of AA. Note that RR may be the empty set. We denote this relation by RAR\sim A. Furthermore, let ARA\llbracket R\rrbracket be the edges of AA induced by the vertex set RR. Note that if RAR\sim A, then ARA\llbracket R\rrbracket is a forest. On the other hand, there is no restriction on AV(G)R.A\llbracket V(G)\setminus R\rrbracket.

Let k(R,AR)k(R,A\llbracket R\rrbracket) be the number of connected components of (R,AR)(R,A\llbracket R\rrbracket). Since 𝒮A\mathcal{S}_{A} is the set of tree components in (V(G),A)(V(G),A),

(2.12) i𝒮A(1+(q1)eB|Vi|)\displaystyle\prod_{i\in\mathcal{S}_{A}}(1+(q-1){\rm e}^{-B|V_{i}|}) =I𝒮A(q1)|I|eBiI|Vi|\displaystyle=\sum_{I\subseteq\mathcal{S}_{A}}(q-1)^{|I|}{\rm e}^{-B\sum_{i\in I}|V_{i}|}
=RA(q1)k(R,AR)eB|R|.\displaystyle=\sum_{R\sim A}(q-1)^{k(R,A\llbracket R\rrbracket)}{\rm e}^{-B|R|}.

Therefore,

(2.13) ZG(q,w,B)\displaystyle Z_{G}(q,w,B) q(G)AE(G)R:RA(q1)k(R,AR)w|A|eB|R|\displaystyle\leq q^{\mathcal{L}(G)}\sum_{A\subseteq E(G)}\sum_{R:R\sim A}(q-1)^{k(R,A\llbracket R\rrbracket)}w^{|A|}{\rm e}^{-B|R|}
=q(G)RV(G)eB|R|A:RA(q1)k(R,AR)w|AR|×w|AV(G)R|\displaystyle=q^{\mathcal{L}(G)}\sum_{R\subseteq V(G)}{\rm e}^{-B|R|}\sum_{A\colon R\sim A}(q-1)^{k(R,A\llbracket R\rrbracket)}w^{|A\llbracket R\rrbracket|}\times w^{|A\llbracket V(G)\setminus R\rrbracket|}
=q(G)RV(G)eB|R|(1+w)|E(VR)|D(q1)k(R,D)w|D|,\displaystyle=q^{\mathcal{L}(G)}\sum_{R\subseteq V(G)}{\rm e}^{-B|R|}(1+w)^{|E(V\setminus R)|}\sum_{D}(q-1)^{k(R,D)}w^{|D|},

where, in the last sum, D=ARD=A\llbracket R\rrbracket is a subset of the edges on the subgraph (R,E(R))(R,E(R)) that is such that (R,D)(R,D) is a forest, and k(R,D)k(R,D) the number of connected components of the graph on RR with edges given by DD. Then

(2.14) D(q1)k(R,D)w|D|\displaystyle\sum_{D}(q-1)^{k(R,D)}w^{|D|} =D(q1)|R||D|w|D|=(q1)|R|D(w/(q1))|D|\displaystyle=\sum_{D}(q-1)^{|R|-|D|}w^{|D|}=(q-1)^{|R|}\sum_{D}(w/(q-1))^{|D|}
(q1)|R|(1+w/(q1))|E(R)|.\displaystyle\leq(q-1)^{|R|}(1+w/(q-1))^{|E(R)|}.

Combining the last two estimates, and setting S=V(G)RS=V(G)\setminus R, we obtain the desired result. ∎

Now we are ready to complete the proof of Theorem 1.4:

Proof of Theorem 1.4.

The proof of Theorem 1.4(i), or the comparison of the partition functions ZG(q,w,B)Z_{G}(q,w,B) and ZG(2)(q,w,B)Z^{\scriptscriptstyle(2)}_{G}(q,w,B), follows from Lemmas 2.3 and 2.4. For (ii) or the estimate of (G)\mathcal{L}(G), we say that a connected component of (V(G),A)(V(G),A) is large when it contains a cycle of length at least kk, and small otherwise. It is clear that there are at most |V(G)|/k|V(G)|/k large cyclic components. On the other hand, the number of small cyclic components is smaller than the maximal number of disjoint cycles of length at most k1k-1, and thus is smaller than i=2k1i(G)\sum_{i=2}^{k-1}\mathcal{L}_{i}(G). ∎

3. Random cluster model on random regular graphs

In this section, we prove the main results for the random cluster model on locally tree-like regular graphs. This section is organised as follows. In Section 3.1, we investigate the quenched and annealed random cluster measures on random regular graphs, and prove Theorem 1.14. In Section 3.2, we investigate the nature of the phase transition, and prove Theorem 1.12.

3.1. Quenched equals annealed: Proof of Theorem 1.14

In this section, we prove Theorem 1.14 using the relation to the degree-regular configuration model.

Proof of Theorem 1.14.

Combining Theorem 1.4, Corollary 1.7, we obtain

(3.1) eλnZGnIsing(β,kd+h)ZGn(q,w,B)eλne(Gn)ZGnIsing(β,kd+h),{\rm e}^{\lambda n}Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta^{*},kd+h)\leq Z_{G_{n}}(q,w,B)\leq{\rm e}^{\lambda n}{\rm e}^{\mathcal{L}(G_{n})}Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta^{*},kd+h),

where

λ=12βd+12log(eB(q1)),h=12log(eB/(q1)),\lambda=\frac{1}{2}\beta^{*}d+\frac{1}{2}\log({\rm e}^{-B}(q-1)),\qquad h=\frac{1}{2}\log({\rm e}^{B}/(q-1)),

and we recall that

(Gn)=maxAE(Gn)|{connected components of GA=(V(Gn),A) containing a cycle}|.\mathcal{L}(G_{n})=\max_{A\subseteq E(G_{n})}|\{\textrm{\rm connected components of $G_{A}=(V(G_{n}),A)$ containing a cycle}\}|.

We claim that

(3.2) ((G)2n/kn)exp(nkn/2),kn=(logn)1/4.\mathbb{P}(\mathcal{L}(G)\geq 2n/k_{n})\leq\exp(-nk_{n}/2),\qquad k_{n}=\lfloor(\log n)^{1/4}\rfloor.

Using (3.1) and (3.2) then gives

(3.3) limn1nlogZGn(q,w,B)=λ+limn1nlogZGnIsing(β,kd+h).\lim_{n\rightarrow\infty}\frac{1}{n}\log Z_{G_{n}}(q,w,B)=\lambda+\lim_{n\rightarrow\infty}\frac{1}{n}\log Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta^{*},kd+h).

It has been shown in [14, Theorem 1] or [9, Proposition 3.2] that the quenched and annealed Ising pressure per particle are equal, i.e.,

(3.4) limn1nlogZGnIsing(β,kd+h)=limn1nlog𝔼[ZGnIsing(β,kd+h)].\lim_{n\rightarrow\infty}\frac{1}{n}\log Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta^{*},kd+h)=\lim_{n\rightarrow\infty}\frac{1}{n}\log\mathbb{E}[Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta^{*},kd+h)].

On the other hand, using (3.2) and the fact that

(3.5) ZGnIsing(β,kd+h)exp(Kn),Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta^{*},kd+h)\leq\exp(Kn),

where K=K(q,d,w,B)K=K(q,d,w,B) is a constant, we obtain

𝔼[q(Gn)ZGnIsing(β,kd+h)]\displaystyle\mathbb{E}[q^{\mathcal{L}(G_{n})}Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta^{*},kd+h)] q4n/kn𝔼[ZGnIsing(β,kd+h)]+q2Kn((Gn)2n/kn)\displaystyle\leq q^{4n/k_{n}}\mathbb{E}[Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta^{*},kd+h)]+q^{2Kn}\mathbb{P}(\mathcal{L}(G_{n})\geq 2n/k_{n})
2q4n/kn𝔼[ZGnIsing(β,kd+h)].\displaystyle\leq 2q^{4n/k_{n}}\mathbb{E}[Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta^{*},kd+h)].

This estimate, together with (3.1), implies that

(3.6) limn1nlog𝔼[ZGn(q,w,B)]=λ+limn1nlog𝔼[ZGnIsing(β,kd+h)].\lim_{n\rightarrow\infty}\frac{1}{n}\log\mathbb{E}[Z_{G_{n}}(q,w,B)]=\lambda+\lim_{n\rightarrow\infty}\frac{1}{n}\log\mathbb{E}[Z_{G_{n}}^{\scriptscriptstyle\rm Ising}(\beta^{*},kd+h)].

It follows from (3.3), (3.4), and (3.6) that

limn1nlogZGn(q,w,B)=limn1nlog𝔼[ZGn(q,w,B)].\lim_{n\rightarrow\infty}\frac{1}{n}\log Z_{G_{n}}(q,w,B)=\lim_{n\rightarrow\infty}\frac{1}{n}\log\mathbb{E}[Z_{G_{n}}(q,w,B)].

Considering the Potts models, i.e., letting q2q\geq 2 be an integer, [14, Theorem 3] states that

limn1nlog𝔼[ZGn(q,w,B)]=Φ(w,B),\lim_{n\rightarrow\infty}\frac{1}{n}\log\mathbb{E}[Z_{G_{n}}(q,w,B)]=\Phi^{\star}(w,B),

where Φ(w,B)\Phi^{\star}(w,B) is the so-called Bethe free energy. Therefore, the last two equations imply

limn1nlogZGn(q,w,B)=Φ(w,B),\lim_{n\rightarrow\infty}\frac{1}{n}\log Z_{G_{n}}(q,w,B)=\Phi^{\star}(w,B),

which is indeed [3, Assumption 1.4]. Thus, it remains to prove (3.2).

Proof of (3.2).

Observe that

(3.7) (G)nkn+i=2kn1i(G),\mathcal{L}(G)\leq\frac{n}{k_{n}}+\sum_{i=2}^{k_{n}-1}\mathcal{L}_{i}(G),

where

i(G)=max{l:G contains l vertex-disjoint cycles of length i}.\mathcal{L}_{i}(G)=\max\{l\colon G\textrm{ contains $l$ vertex-disjoint cycles of length $i$}\}.

Recall that we call a cyclic connected components of GA=(V(G),A)G_{A}=(V(G),A) for AE(G)A\subseteq E(G) large if it contains a cycle of length at least knk_{n}, and small otherwise. It clear that there are at most n/knn/k_{n} large cyclic components. On the other hand, the number of small cyclic components is at most the maximal number of disjoint cycles of length at most kn1k_{n}-1, and thus is at most i=2kn1i(G)\sum_{i=2}^{k_{n}-1}\mathcal{L}_{i}(G). It suffices to show that

(3.8) max2ikn1(i(Gn)n/kn2)exp(nkn).\max_{2\leq i\leq k_{n}-1}\mathbb{P}\big{(}\mathcal{L}_{i}(G_{n})\geq n/k_{n}^{2}\big{)}\leq\exp(-nk_{n}).

Indeed, the desired result (3.2) then directly follows from (3.7) and (3.8) and a union bound.

To prove (3.8), we fix ikni\leq k_{n}, set m=n/kn2m=\lfloor n/k_{n}^{2}\rfloor and consider

(3.9) (i(Gn)m)SV(Gn):|S|=im(Gn(S) has m disjoint i cycles),\mathbb{P}(\mathcal{L}_{i}(G_{n})\geq m)\leq\sum_{S\subseteq V(G_{n})\colon|S|=im}\mathbb{P}(G_{n}(S)\textrm{ has $m$ disjoint $i$ cycles}),

where Gn(S)G_{n}(S) is the induced subgraph of GnG_{n} with vertex set SS. We call a cycle an ii cycle when it has length ii. Given SV(Gn)S\subseteq V(G_{n}) with |S|=im|S|=im, we pick a vertex v1Sv_{1}\in S arbitrarily and observe that

(Gn(S) has m disjoint i cycles)\displaystyle\mathbb{P}(G_{n}(S)\textrm{ has $m$ disjoint $i$ cycles})
S1S{v1}|S1|=i1(Gn(S¯1) contains an i cycle, and Gn(SS¯1) has m1 disjoint i cycles)\displaystyle\leq\sum_{\begin{subarray}{c}S_{1}\subseteq S\setminus\{v_{1}\}\\ |S_{1}|=i-1\end{subarray}}\mathbb{P}\Big{(}G_{n}(\bar{S}_{1})\textrm{ contains an $i$ cycle, and\leavevmode\nobreak\ }G_{n}(S\setminus\bar{S}_{1})\textrm{ has $m-1$ disjoint $i$ cycles}\Big{)}
(3.10) S1S{v1}|S1|=i1(i1)!vB¯1dvj=0i1(n2j+1)×(Gn(1)(SS¯1) has m1 disjoint i cycles),\displaystyle\leq\sum_{\begin{subarray}{c}S_{1}\subseteq S\setminus\{v_{1}\}\\ |S_{1}|=i-1\end{subarray}}\frac{(i-1)!\prod_{v\in\bar{B}_{1}}d_{v}}{\prod_{j=0}^{i-1}(\ell_{n}-2j+1)}\times\mathbb{P}\Big{(}G^{\scriptscriptstyle(1)}_{n}(S\setminus\bar{S}_{1})\textrm{ has $m-1$ disjoint $i$ cycles}\Big{)},

where

S¯1=S1{v1},n=vV(Gn)dv=nd,\bar{S}_{1}=S_{1}\cup\{v_{1}\},\quad\ell_{n}=\sum_{v\in V(G_{n})}d_{v}=nd,

and Gn(1)(SS¯1)G^{\scriptscriptstyle(1)}_{n}(S\setminus\bar{S}_{1}) is the configuration model on [n][n] with degrees ((dv2)vS¯1,(dv)vS¯1).((d_{v}-2)_{v\in\bar{S}_{1}},(d_{v})_{v\not\in\bar{S}_{1}}).

Applying (3.1) recursively, we arrive at

(Gn(S) has m disjoint i cycles)\displaystyle\mathbb{P}(G_{n}(S)\textrm{ has $m$ disjoint $i$ cycles}) S1,,Sms=1m(i1)!vS¯sdvj=0i1(n2j+12(s1)i)\displaystyle\leq\sum_{S_{1},\ldots,S_{m}}\,\,\prod_{s=1}^{m}\frac{(i-1)!\prod_{v\in\bar{S}_{s}}d_{v}}{\prod_{j=0}^{i-1}(\ell_{n}-2j+1-2(s-1)i)}
(3.11) S1,,Sms=1m(i1)!vSdvj=0i1(n2j+12(s1)i),\displaystyle\leq\sum_{S_{1},\ldots,S_{m}}\,\,\prod_{s=1}^{m}\frac{(i-1)!\prod_{v\in S}d_{v}}{\prod_{j=0}^{i-1}(\ell_{n}-2j+1-2(s-1)i)},

where the sum is taken over all the possible tubes of disjoint sets (Ss)s=1mS(S_{s})_{s=1}^{m}\subseteq S such that |Ss|=i1|S_{s}|=i-1 for all 1sm1\leq s\leq m, and we also used that

s=1mvS¯sdv=vSdv.\prod_{s=1}^{m}\prod_{v\in\bar{S}_{s}}d_{v}=\prod_{v\in S}d_{v}.

Note that there are at most

(imi1)m(im)(i1)m((i1)!)m\binom{im}{i-1}^{m}\leq\frac{(im)^{(i-1)m}}{((i-1)!)^{m}}

such choices for (Ss)s=1m(S_{s})_{s=1}^{m}. Thus,

(Gn(S) has m disjoint i cycles)\displaystyle\mathbb{P}(G_{n}(S)\textrm{ has $m$ disjoint $i$ cycles}) S1,,Sm((i1)!)mvSdv(n/2)im\displaystyle\leq\sum_{S_{1},\ldots,S_{m}}\,\,((i-1)!)^{m}\frac{\prod_{v\in S}d_{v}}{(\ell_{n}/2)^{im}}
(3.12) (im)(i1)mvV(Gn)dv(n/2)imvV(Gn)dv(n/2)m,\displaystyle\leq(im)^{(i-1)m}\frac{\prod_{v\in V(G_{n})}d_{v}}{(\ell_{n}/2)^{im}}\leq\frac{\prod_{v\in V(G_{n})}d_{v}}{(\ell_{n}/2)^{m}},

where we also used that n2min/2\ell_{n}-2mi\geq\ell_{n}/2 since mi=o(n)mi=o(n). Combining (3.9) and (3.1) gives

(i(Gn)m)2nexp(vV(Gn)logdvmlog(n/2))exp(nkn),\displaystyle\mathbb{P}(\mathcal{L}_{i}(G_{n})\geq m)\leq 2^{n}\exp\left(\sum_{v\in V(G_{n})}\log d_{v}-m\log(\ell_{n}/2)\right)\leq\exp(-nk_{n}),

since m=n/kn2m=\lfloor n/k_{n}^{2}\rfloor and kn=(logn)1/4k_{n}=\lfloor(\log n)^{1/4}\rfloor, and vV(Gn)logdv=nlogd\sum_{v\in V(G_{n})}\log d_{v}=n\log d. This completes the proof of (3.2), and thus of Theorem 1.14. ∎

3.2. The nature of the phase transition: Proof of Theorem 1.12

We first recall the form of the free energy of the Ising model on a random dd-regular graph. We define (see [9])

(3.13) L(β,t)=tlog(1/t)+(1t)log(1/(1t))+dlogFe2β(t),L(\beta,t)=t\log(1/t)+(1-t)\log(1/(1-t))+d\log{F_{{\rm e}^{-2\beta}}(t)},

where

(3.14) Fb(t)=0t(1t)logfb(s)𝑑s,withfb(s)=b(12s)+1+(b21)(12s)22(1s).F_{b}(t)=\int_{0}^{t\wedge(1-t)}\log{f_{b}(s)}ds,\quad\text{with}\quad f_{b}(s)=\frac{b(1-2s)+\sqrt{1+(b^{2}-1)(1-2s)^{2}}}{2(1-s)}.

Then, by [9, Theorem 1.1],

(3.15) φIsing(β,z)=βd2+supt[0,1]G(β,z,t),G(β,z,t)=L(β,t)+z(2t1).\varphi^{\scriptscriptstyle\rm Ising}(\beta,z)=\frac{\beta d}{2}+\sup_{t\in[0,1]}G(\beta,z,t),\qquad G(\beta,z,t)=L(\beta,t)+z(2t-1).

We summarise here some properties of the maximiser tβ,zt_{\beta,z} of the function GG:

  • (a)

    If z0z\neq 0 then tβ,zt_{\beta,z} is unique. Moreover, the function tβ,zt_{\beta,z} is differentiable w.r.t. (β,z)(\beta,z) if z0z\neq 0.

  • (b)

    If z>0z>0 then tβ,z>1/2t_{\beta,z}>1/2 and tβ,z=1tβ,z<1/2t_{\beta,-z}=1-t_{\beta,z}<1/2. Moreover,

    tβ,0+=1tβ,0>1/2if β>βcIsing;tβ,0+=tβ,0=1/2if ββcIsing,t_{\beta,0^{+}}=1-t_{\beta,0^{-}}>1/2\quad\textrm{if }\quad\beta>\beta^{\scriptscriptstyle\rm Ising}_{c};\qquad t_{\beta,0^{+}}=t_{\beta,0^{-}}=1/2\quad\textrm{if }\quad\beta\leq\beta^{\scriptscriptstyle\rm Ising}_{c},

    where

    βcIsing=12log(dd2).\beta^{\scriptscriptstyle\rm Ising}_{c}=\frac{1}{2}\log\left(\frac{d}{d-2}\right).
  • (c)

    βφIsing(β,z)\beta\mapsto\varphi^{\scriptscriptstyle\rm Ising}(\beta,z) is differentiable in β\beta for all (β,z)(\beta,z). On the other hand, φIsing(β,z)\varphi^{\scriptscriptstyle\rm Ising}(\beta,z) is differentiable in zz for all (β,z)(\beta,z) except for β>βcIsing\beta>\beta_{c}^{\scriptscriptstyle\rm Ising} and z=0z=0:

    zφIsing(β,0+)=zφIsing(β,0)>0.\partial_{z}\varphi^{\scriptscriptstyle\rm Ising}(\beta,0^{+})=-\partial_{z}\varphi^{\scriptscriptstyle\rm Ising}(\beta,0^{-})>0.

We remark that

(3.16) φ(q,w,B)=λ+φIsing(β,z),\varphi(q,w,B)=\lambda+\varphi^{\scriptscriptstyle\rm Ising}(\beta^{*},z),

where

β=14log((1+w)(1+w/(q1))),z=kd+h,k=14log(1+w1+w/(q1)),\beta^{*}=\frac{1}{4}\log((1+w)(1+w/(q-1))),\quad z=kd+h,\qquad k=\frac{1}{4}\log\left(\frac{1+w}{1+w/(q-1)}\right),

and

λ=12βd+12log(eB(q1)),h=12log(eB/(q1)).\lambda=\frac{1}{2}\beta^{*}d+\frac{1}{2}\log({\rm e}^{-B}(q-1)),\qquad h=\frac{1}{2}\log({\rm e}^{B}/(q-1)).

By observation (c), z=0z=0 is the only possible value of zz for which the derivatives of φ\varphi might be discontinuous. Solving z=kd+h=0z=kd+h=0, we obtain

(3.17) w=wc(B):=q,d(e2h),q,d(x)=x2/d111q1x2/d.w=w_{c}(B):=\ell_{q,d}({\rm e}^{-2h}),\qquad\ell_{q,d}(x)=\frac{x^{2/d}-1}{1-\tfrac{1}{q-1}x^{2/d}}.

Also by observation (c), while βφ\partial_{\beta^{*}}\varphi is continuous in the whole regime, zφ\partial_{z}\varphi is discontinuous when β>βcIsing\beta^{*}>\beta_{c}^{\scriptscriptstyle\rm Ising} and z=0z=0, and zφ\partial_{z}\varphi is continuous otherwise.

Next, we aim to check the condition β(wc(B))>βcIsing\beta^{*}(w_{c}(B))>\beta_{c}^{\scriptscriptstyle\rm Ising}. By a direct computation, for q>2q>2,

(3.18) wc(B)=2(q1)e4h/dd(q1e4h/d)2(2q)Bh=(q1)(2q)e4h/dd(q1e4h/d)2<0.w_{c}^{\prime}(B)=\frac{2(q-1){\rm e}^{-4h/d}}{d(q-1-{\rm e}^{-4h/d})^{2}}(2-q)\partial_{B}h=\frac{(q-1)(2-q){\rm e}^{-4h/d}}{d(q-1-{\rm e}^{-4h/d})^{2}}<0.

Consequently,

(3.19) Bwc(B) is strictly decreasing when B>0.B\mapsto w_{c}(B)\textrm{ is strictly decreasing when $B>0$}.

We claim that, for q>2q>2,

(3.20) wc(0)>0,g(wc(0))>(dd2)2.w_{c}(0)>0,\qquad g(w_{c}(0))>\left(\frac{d}{d-2}\right)^{2}.

where

(3.21) g(w)=e4β(w)=(1+w)(1+w/(q1)).g(w)={\rm e}^{4\beta^{*}(w)}=(1+w)(1+w/(q-1)).

We defer the proof of (3.20) to the end of the proof. Since wc(0)>0w_{c}(0)>0 and wc()w_{c}(\cdot) is strictly decreasing by (3.18), there exists a unique B+>0B^{+}>0 such that

wc(B+)=0,wc(B)>0 if and only if 0B<B+.w_{c}(B^{+})=0,\qquad w_{c}(B)>0\quad\textrm{ if and only if }0\leq B<B^{+}.

Since g()g(\cdot) is increasing in +\mathbb{R}_{+}, g(wc(B))g(w_{c}(B)) is decreasing in 0B<B+0\leq B<B^{+}. Moreover, g(wc(B+))=g(0)=1g(w_{c}(B^{+}))=g(0)=1 and g(wc(0))>(dd2)2g(w_{c}(0))>(\tfrac{d}{d-2})^{2}. Therefore, there exists B+(0,B+)B_{+}\in(0,B^{+}) such that

g(wc(B+))=(dd2)2,g(wc(B))>(dd2)2 iff 0B<B+.g(w_{c}(B_{+}))=\left(\frac{d}{d-2}\right)^{2},\qquad g(w_{c}(B))>\left(\frac{d}{d-2}\right)^{2}\quad\textrm{ iff }0\leq B<B_{+}.

Particularly, if 0B<B+0\leq B<B_{+},

β(wc(B))=14logg(wc(B))>12log(dd2)=βcßIsing,\beta^{*}(w_{c}(B))=\frac{1}{4}\log g(w_{c}(B))>\frac{1}{2}\log\left(\frac{d}{d-2}\right)=\beta_{c}^{\ss\rm Ising},

and β(wc(B))<βcßIsing\beta^{*}(w_{c}(B))<\beta_{c}^{\ss\rm Ising} otherwise.

In conclusion, if q>2q>2 and (w,B)𝒞(w,B)\in\mathscr{C}, where

(3.22) 𝒞={(w,B):w=wc(B)for some 0B<B+},\mathscr{C}=\{(w,B)\colon w=w_{c}(B)\leavevmode\nobreak\ \text{\rm for some }0\leq B<B_{+}\},

then the derivative wφ\partial_{w}\varphi is discontinuous, i.e., wφ(wc(B)+,B)wφ(wc(B),B)\partial_{w}\varphi(w_{c}(B)^{+},B)\neq\partial_{w}\varphi(w_{c}(B)^{-},B), i.e., we have a first-order phase transition. We conclude that it remains to prove (3.20).

Proof of (3.20).

Setting x=q1>0x=q-1>0 and a=2/d(0,1)a=2/d\in(0,1), we have

wc(0)=q,d(q1)=xa11xa1>0,w_{c}(0)=\ell_{q,d}(q-1)=\frac{x^{a}-1}{1-x^{a-1}}>0,

since x>1x>1 for q>2q>2. By (3.21), g(w)=(1+w)(1+w/x)g(w)=(1+w)(1+w/x), and substituting wc(0)=(xa1)/(1xa1)=x(xa1)/(xxa)w_{c}(0)=(x^{a}-1)/(1-x^{a-1})=x(x^{a}-1)/(x-x^{a}), we obtain

(3.23) g(wc(0))=(1+x(xa1)xxa)(1+xa1xxa)=xa(x1)2(xxa)2.g(w_{c}(0))=\Big{(}1+\frac{x(x^{a}-1)}{x-x^{a}}\Big{)}\Big{(}1+\frac{x^{a}-1}{x-x^{a}}\Big{)}=\frac{x^{a}(x-1)^{2}}{(x-x^{a})^{2}}.

Thus,

g(wc(0))(dd2)2\displaystyle g(w_{c}(0))-\left(\frac{d}{d-2}\right)^{2}
=xa(x1)2(xxa)21(1a)2=1(1a)2(xxa)2[xa(x1)2(1a)2(xxa)2]\displaystyle=\frac{x^{a}(x-1)^{2}}{(x-x^{a})^{2}}-\frac{1}{(1-a)^{2}}=\frac{1}{(1-a)^{2}(x-x^{a})^{2}}[x^{a}(x-1)^{2}(1-a)^{2}-(x-x^{a})^{2}]
=xa/2(1a)2(xxa)2(xa/2(x1)(1a)+xxa)((x1)(1a)x1a/2+xa/2)\displaystyle=\frac{x^{a/2}}{(1-a)^{2}(x-x^{a})^{2}}\left(x^{a/2}(x-1)(1-a)+x-x^{a}\right)\left((x-1)(1-a)-x^{1-a/2}+x^{a/2}\right)
(3.24) =:xa/2(1a)2(xxa)2A1(x)A2(x).\displaystyle=:\frac{x^{a/2}}{(1-a)^{2}(x-x^{a})^{2}}A_{1}(x)A_{2}(x).

Since a=2/d(0,1)a=2/d\in(0,1),

(3.25) A1(x)>0 if x>1.A_{1}(x)>0\quad\textrm{ if }\quad x>1.

Moreover,

A2(x)\displaystyle A_{2}^{\prime}(x) =1a(1a/2)xa/2+axa/21/2\displaystyle=1-a-(1-a/2)x^{-a/2}+ax^{a/2-1}/2
=1axa/2+a(xa/2+xa/21)/2\displaystyle=1-a-x^{-a/2}+a(x^{-a/2}+x^{a/2-1})/2
1axa/2+ax1/20,\displaystyle\geq 1-a-x^{-a/2}+ax^{-1/2}\geq 0,

where, for the third line, we have used the Cauchy-Schwarz inequality in the form u+v2uvu+v\geq 2\sqrt{uv}, and the inequality that 1a+ayya01-a+ay-y^{a}\geq 0 if y>0y>0 and a(0,1)a\in(0,1). In addition, A2(1)=0A_{2}(1)=0. Therefore,

A2(x)>0 if x>1.A_{2}(x)>0\quad\textrm{ if }\quad x>1.

Since x=q1>1x=q-1>1 as q>2q>2, this, together with (3.2) and (3.25), implies the desired result (3.20).∎

4. Thermodynamic limit of extended Ising model: Proof of Theorem 1.16

In this section, we give an overview of the proof of Theorem 1.16. For fixed-sign parameters, this proof is a minor adaptation of the proof for the Ising model with constant external field. In fact, some of the crucial ingredients have been proved for general vertex-dependent external fields, so that this proof requires only minor modifications. Let

(4.1) φneIsing(β,k,h)=1nlogZGneIsing(β,k,h).\varphi^{\rm\scriptscriptstyle eIsing}_{n}(\beta,k,h)=\frac{1}{n}\log Z_{G_{n}}^{\rm\scriptscriptstyle eIsing}(\beta,k,h).

In order to state the limit of the pressure per particle, we define the necessary quantities related to message passing algorithms and belief propagation, as already briefly discussed in Section 1.4.

Message passing quantities

Let 𝑩=(Bv)vV(𝖳)=(kdv+h)vV(𝖳).\bm{B}=(B_{v})_{v\in V({\sf T})}=(kd_{v}+h)_{v\in V({\sf T})}. Further, let 𝖳=(V(𝖳),E(𝖳)){\sf T}=(V({\sf T}),E({\sf T})) be the rooted random tree that arises as the local limit of our graph sequence. Fix such a rooted tree 𝖳{\sf T} with root oV(𝖳)o\in V({\sf T}). Let β0\beta\geq 0 and Bv=kdv+hBmin>0B_{v}=kd_{v}+h\geq B_{\min}>0 for every vV(𝖳)v\in V({\sf T}). Let {x,y}\{x,y\} be an edge in 𝖳{\sf T}. Then, let 𝖳xy{\sf T}_{x\rightarrow y} be the sub-tree of 𝖳{\sf T} rooted at xx which results from deleting the edge {x,y}\{x,y\} from 𝖳{\sf T}. We write (x,y)(x,y) for the directed version of the edge {x,y}\{x,y\} that points from xx to yy.

Let σxμ𝖳,xyβ,𝑩(σx)\sigma_{x}\mapsto\mu_{{\sf T},x\rightarrow y}^{\scriptscriptstyle\beta,\bm{B}}(\sigma_{x}) be the marginal law of σx\sigma_{x} for the Ising model on 𝖳xy{\sf T}_{x\rightarrow y} with inverse temperature β\beta and vertex-dependent external fields 𝑩=(Bv)vV(𝖳)\bm{B}=(B_{v})_{v\in V({\sf T})}. We will mostly be interested in (x,y)=(o,j)(x,y)=(o,j) or (x,y)=(j,o)(x,y)=(j,o) for some child jj of oo. We emphasise that μ𝖳,xyβ,𝑩(σx)\mu_{{\sf T},x\rightarrow y}^{\scriptscriptstyle\beta,\bm{B}}(\sigma_{x}) are random variables when 𝖳{\sf T} is a random tree.

We let o\partial o be the children of oV(𝖳)o\in V({\sf T}), and define, for 𝑩=(Bv)vV(𝖳)=(kdv+h)vV(𝖳),\bm{B}=(B_{v})_{v\in V({\sf T})}=(kd_{v}+h)_{v\in V({\sf T})},

(4.2) Φ𝖳vx(β,𝑩)=log[σeBoσjo(σjeβσσjμ𝖳,joβ,𝑩(σj))],\Phi_{{\sf T}}^{\rm vx}(\beta,\bm{B})=\log\Big{[}\sum_{\sigma}{\rm e}^{B_{o}\sigma}\prod_{j\in\partial o}\Big{(}\sum_{\sigma_{j}}{\rm e}^{\beta\sigma\sigma_{j}}\mu_{{\sf T},j\rightarrow o}^{\scriptscriptstyle\beta,\bm{B}}(\sigma_{j})\Big{)}\Big{]},

and

(4.3) Φ𝖳e(β,𝑩)=12jolog[σ,σjeβσσjμ𝖳,joβ,𝑩(σj)μ𝖳,ojβ,𝑩(σ)].\Phi_{{\sf T}}^{\rm e}(\beta,\bm{B})=\frac{1}{2}\sum_{j\in\partial o}\log\Big{[}\sum_{\sigma,\sigma_{j}}{\rm e}^{\beta\sigma\sigma_{j}}\mu_{{\sf T},j\rightarrow o}^{\scriptscriptstyle\beta,\bm{B}}(\sigma_{j})\mu_{{\sf T},o\rightarrow j}^{\scriptscriptstyle\beta,\bm{B}}(\sigma)\Big{]}.

Our main result is then the following:

Theorem 4.1 (Pressure per particle on locally tree-like graphs).

Consider a graph sequence (Gn)n1(G_{n})_{n\geq 1} of size |V(Gn)|=n|V(G_{n})|=n that converges locally in probability to the random rooted tree 𝖳{\sf T}. Then, for every β0\beta\geq 0 and Bv=kdv+hBmin>0B_{v}=kd_{v}+h\geq B_{\min}>0 for every vV(Gn)v\in V(G_{n}),

(4.4) 1nlogZGneIsing(β,k,h)φneIsing(β,k,h),\frac{1}{n}\log Z_{G_{n}}^{\rm\scriptscriptstyle eIsing}(\beta,k,h)\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}\varphi^{\rm\scriptscriptstyle eIsing}_{n}(\beta,k,h),

where

(4.5) φneIsing(β,k,h)=𝔼[Φ𝖳vx(β,𝑩)Φ𝖳e(β,𝑩)],\varphi^{\rm\scriptscriptstyle eIsing}_{n}(\beta,k,h)=\mathbb{E}[\Phi_{{\sf T}}^{\rm vx}(\beta,\bm{B})-\Phi_{{\sf T}}^{\rm e}(\beta,\bm{B})\Big{]},

and the expectation is w.r.t. the random rooted tree 𝖳{\sf T}.

Theorem 4.1 obviously implies Theorem 1.16, and gives an explicit formula for the limiting pressure per particle φ(β,B)\varphi(\beta,B). We next discuss its proof, for which, rather than studying φneIsing(β,k,h)\varphi^{\rm\scriptscriptstyle eIsing}_{n}(\beta,k,h) directly, we study its derivative w.r.t. hh. In more detail, we use that

(4.6) hφneIsing(β,k,h)=1nuV(Gn)σuμn=𝔼[σonμnGn],\frac{\partial}{\partial h}\varphi^{\rm\scriptscriptstyle eIsing}_{n}(\beta,k,h)=\frac{1}{n}\sum_{u\in V(G_{n})}\langle\sigma_{u}\rangle_{\mu_{n}}=\mathbb{E}\Big{[}\langle\sigma_{o_{n}}\rangle_{\mu_{n}}\mid G_{n}\Big{]},

where μn\mu_{n} is the extended Ising measure on GnG_{n}, i.e.,

(4.7) μn(𝝈)=1ZGneIsing(β,k,h)exp(β{u,v}E(Gn)σuσv+uV(Gn)Bvσu),\mu_{n}(\bm{\sigma})=\frac{1}{Z_{G_{n}}^{\rm\scriptscriptstyle eIsing}(\beta,k,h)}\exp\Big{(}\beta\sum_{\{u,v\}\in E(G_{n})}\sigma_{u}\sigma_{v}+\sum_{u\in V(G_{n})}B_{v}\sigma_{u}\Big{)},

μn\langle\cdot\rangle_{\mu_{n}} denotes the expectation w.r.t. μn\mu_{n}, and onV(Gn)o_{n}\in V(G_{n}) is chosen uniformly at random. By the GKS inequality (see, e.g., [26, Lemma 10.1]), we can bound, for every t0t\geq 0, and using that Bv=kdv+hBmin>0B_{v}=kd_{v}+h\geq B_{\min}>0 for every vV(Gn)v\in V(G_{n}),

(4.8) σonBon(Gn)(t)fσonμnσonBon(Gn)(t)+,\langle\sigma_{o_{n}}\rangle^{f}_{B_{o_{n}}^{\scriptscriptstyle(G_{n})}(t)}\leq\langle\sigma_{o_{n}}\rangle_{\mu_{n}}\leq\langle\sigma_{o_{n}}\rangle^{+}_{B_{o_{n}}^{\scriptscriptstyle(G_{n})}(t)},

where Bon(Gn)(t)B_{o_{n}}^{\scriptscriptstyle(G_{n})}(t) is the tt-neighbourhood of onV(Gn)o_{n}\in V(G_{n}) in GnG_{n}, and +/f\langle\cdot\rangle^{+/f} denote the expectation w.r.t. the extended Ising model with + and free boundary conditions, respectively.

We now rely on local convergence to obtain that

(4.9) σonBon(Gn)(t)+𝔼[σoBo(G)(t)+],\langle\sigma_{o_{n}}\rangle^{+}_{B_{o_{n}}^{\scriptscriptstyle(G_{n})}(t)}\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}\mathbb{E}\big{[}\langle\sigma_{o}\rangle^{+}_{B_{o}^{\scriptscriptstyle(G)}(t)}\big{]},

where Bo(G)(t)B_{o}^{\scriptscriptstyle(G)}(t) is the tt-neighbourhood of oV(𝖳)o\in V({\sf T}) in the limiting rooted tree G=(𝖳,o).G=({\sf T},o). Key here is that our external fields are local, in that BvB_{v} only depends on the degree of the vertex vv, and not on any other properties of the pre-limit graph GnG_{n}. Similarly,

(4.10) σonBon(Gn)(t)f𝔼[σoBo(G)(t)f],\langle\sigma_{o_{n}}\rangle^{f}_{B_{o_{n}}^{\scriptscriptstyle(G_{n})}(t)}\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}\mathbb{E}\big{[}\langle\sigma_{o}\rangle^{f}_{B_{o}^{\scriptscriptstyle(G)}(t)}\big{]},

By [16, Lemma 3.1], 𝔼[σoBo(G)(t)+]\mathbb{E}\big{[}\langle\sigma_{o}\rangle^{+}_{B_{o}^{\scriptscriptstyle(G)}(t)}\big{]} is close to 𝔼[σoBo(G)(t)f]\mathbb{E}\big{[}\langle\sigma_{o}\rangle^{f}_{B_{o}^{\scriptscriptstyle(G)}(t)}\big{]} for tt large, whenever all external fields BvB_{v} for vV(𝖳)v\in V({\sf T}) satisfy BvBmin>0B_{v}\geq B_{\min}>0. This shows that

(4.11) hφneIsing(β,k,h)ϕ(β,k,h),\frac{\partial}{\partial h}\varphi^{\rm\scriptscriptstyle eIsing}_{n}(\beta,k,h)\stackrel{{\scriptstyle\scriptscriptstyle{\mathbb{P}}}}{{\longrightarrow}}\phi(\beta,k,h),

for an appropriate ϕ(β,k,h)\phi(\beta,k,h). Theorem 4.1 follows by combining two further crucial steps. First, convergence of the pressure per particle 1nlogZGneIsing(β,k,h)\frac{1}{n}\log Z_{G_{n}}^{\rm\scriptscriptstyle eIsing}(\beta,k,h) follows from integrating from h0h_{0} to \infty, and considering what happens for hh being close to infinity (where all spins wish to be equal). For this part, we refer to the analysis in [26, Section 12.2.3]. Secondly, we then have to identify the limit by proving that ϕ(β,k,h)=hφneIsing(β,k,h)\phi(\beta,k,h)=\frac{\partial}{\partial h}\varphi^{\rm\scriptscriptstyle eIsing}_{n}(\beta,k,h), and show that it can be described directly as a solution to the message-passing fixed-point equations (see also the discussion in Section 1.4 on the Bethe partition function).

We refrain from giving more details, and refer to [26, Chapter 11] instead. In particular, we can follow the proof of [26, Theorem 11.3] almost verbatim. In turn, this theorem closely follows the proof by Dembo, Montanari and Sun [15].

Acknowledgement.

The work of RvdH was supported in part by the Netherlands Organisation for Scientific Research (NWO) through the Gravitation NETWORKS grant no. 024.002.003. The work of RvdH is further supported by the National Science Foundation under Grant No. DMS-1928930 while he was in residence at the Simons Laufer Mathematical Sciences Institute in Berkeley, California, during the spring semester 2025. RvdH thanks Amir Dembo and Lenka Zdeborova for enlightening discussions. The work of Van Hao Can is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 101.03-2023.34.

References

  • [1] D. Aldous and R. Lyons. Processes on unimodular random networks. Electron. J. Probab., 12(54):1454–1508, 2007.
  • [2] D. Aldous and J. Steele. The objective method: probabilistic combinatorial optimization and local weak convergence. In Probability on discrete structures, volume 110 of Encyclopaedia Math. Sci., pages 1–72. Springer, 2004.
  • [3] A. Basak, A. Dembo, and A. Sly. Potts and random cluster measures on locally regular-tree-like graphs. arXiv:2312.16008 [math.PR], 2023.
  • [4] F. Bencs, M. Borbényi, and P. Csikvári. Random cluster model on regular graphs. Comm. Math. Phys., 399(1):203–248, 2023.
  • [5] I. Benjamini, R. Lyons, and O. Schramm. Unimodular random trees. Ergodic Theory Dynam. Systems, 35(2):359–373, 2015.
  • [6] I. Benjamini and O. Schramm. Recurrence of distributional limits of finite planar graphs. Electron. J. Probab., 6(23):13 pp. (electronic), 2001.
  • [7] M. Biskup, C. Borgs, J. T. Chayes, and R. Kotecký. Gibbs states of graphical representations of the Potts model with external fields. J. Math. Phys., 41(3):1170–1210, 2000.
  • [8] V. Can. Critical behavior of the annealed Ising model on random regular graphs. J. Stat. Phys., 169(3):480–503, 2017.
  • [9] V. Can. Annealed limit theorems for the Ising model on random regular graphs. Ann. Appl. Probab., 29(3):1398–1445, 2019.
  • [10] V. Can, C. Giardinà, C. Giberti, and R. van der Hofstad. Annealed inhomogeneities in random ferromagnets. Phys. Rev. E, 105(2):Paper No. 024128, 7, 2022.
  • [11] A. Coja-Oghlan, A. Galanis, L. Goldberg, D. Ravelomanana, J.B.and Štefankovič, and E. Vigoda. Metastability of the Potts ferromagnet on random regular graphs. Comm. Math. Phys., 401(1):185–225, 2023.
  • [12] A. Dembo and A. Montanari. Gibbs measures and phase transitions on sparse random graphs. Braz. J. Probab. Statist., 24(2):137–211, 2010.
  • [13] A. Dembo and A. Montanari. Ising models on locally tree-like graphs. Ann. Appl. Probab., 20(2):565–592, 2010.
  • [14] A. Dembo, A. Montanari, A. Sly, and N. Sun. The replica symmetric solution for Potts models on dd-regular graphs. Comm. Math. Phys., 327(2):551–575, 2014.
  • [15] A. Dembo, A. Montanari, and N. Sun. Factor models on locally tree-like graphs. Ann. Probab., 41(6):4162–4213, 2013.
  • [16] S. Dommers, C. Giardinà, and R. van der Hofstad. Ising models on power-law random graphs. J. Statist. Phys., 141(4):638–660, 2010.
  • [17] S. Dommers, C. Giardinà, and R. van der Hofstad. Ising critical exponents on random trees and graphs. Comm. Math. Phys., 328(1):355–395, 2014.
  • [18] C. M. Fortuin. On the random-cluster model. II. The percolation model. Physica, 58:393–418, 1972.
  • [19] C. M. Fortuin. On the random-cluster model. III. The simple random-cluster model. Physica, 59:545–570, 1972.
  • [20] C. M. Fortuin and P. W. Kasteleyn. On the random-cluster model. I. Introduction and relation to other models. Physica, 57:536–564, 1972.
  • [21] A. Galanis, D. Štefankovič, E. Vigoda, and L. Yang. Ferromagnetic Potts model: refined #BIS-hardness and related results. SIAM J. Comput., 45(6):2004–2065, 2016.
  • [22] C. Giardinà, C. Giberti, R. van der Hofstad, G. Janssen, and N. Maitra. Annealed Potts models on rank-1 inhomogeneous random graphs. arXiv:2502.10553 [math.PR], 2025.
  • [23] G. Grimmett. The random-cluster model. Berlin: Springer, 2006.
  • [24] T. Helmuth, M. Jenssen, and W. Perkins. Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs. Ann. Inst. Henri Poincaré Probab. Stat., 59(2):817–848, 2023.
  • [25] R. van der Hofstad. Random graphs and complex networks. Volume 2. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, 2024.
  • [26] R. van der Hofstad. Stochastic processes on random graphs. 2025+. In preparation, see
    http://www.win.tue.nl/~rhofstad/SaintFlour_SPoRG.pdf.
  • [27] M. Mézard and A. Montanari. Information, physics, and computation. Oxford Graduate Texts. Oxford University Press, Oxford, 2009.
  • [28] N. Ruozzi. The Bethe partition function of log-supermodular graphical models. Advances in Neural Information Processing Systems, 25, 2012.
  • [29] A. Sly and N. Sun. Counting in two-spin models on dd-regular graphs. Ann. Probab., 42(6):2383–2416, 2014.
  • [30] A. Willsky, E. Sudderth, and M. J. Wainwright. Loop series and Bethe variational bounds in attractive graphical models. Advances in neural information processing systems, 20, 2007.
  • [31] J. Yedidia, W. Freeman, and Y. Weiss. Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Trans. Inform. Theory, 51(7):2282–2312, 2005.