Random cluster models on random graphs
Abstract.
On locally tree-like random graphs, we relate the random cluster model with external magnetic fields and 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 -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 -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 , the Ising model for , and the general -state Potts model for . 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 -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 be a finite graph with vertex set and edge set . We assume that . The random cluster measure is denoted by , and gives a measure on configurations , where the edge variables satisfy . We think of for which as being present, and for which as being vacant. The random cluster measure is given by
(1.1) |
where and , and denotes the number of connected components of the subgraph with vertex set and edge set . The partition function, or normalising constant, is given by
(1.2) |
where the sum is over all bond variables .
The relation to Potts models.
In the above, is general, as it will often be in this paper. We now specialise to , and relate the above model to the Potts model. For this, we need to specify vertex variables , where . We first define a joint law given by
(1.3) |
where the partition function, or normalising constant, is now given by
(1.4) |
and the sum is over all bond variables and vertex variables for all .
The key coupling result is that (cf. [23, Theorem (1.10)]) for and , the spin marginal obtained by summing out over the bond variables is the Potts model with parameters and , while the bond marginal 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 and external field , as
(1.5) |
where
(1.6) |
Note that with , 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 . Let be a positive real number, and . Then, we define the random cluster measure with external field , inspired by [7], by
(1.7) |
where the normalisation constant is given by
(1.8) |
where is the collection of connected components in . 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 to
Lemma 1.1 (Relation Potts and random cluster partition function).
Let be an integer, and let be a finite graph. Then, with ,
We next describe the random graph models that we will be working on.
Random graphs and local convergence.
In the above, the finite graph is general. Here, we introduce the kind of random graphs that we shall work on. We will consider graph sequences of growing size, where , with and denoting the vertex and edge sets of , respectively. We assume that , and assume that tends to infinity.
Condition 1.2 (Uniform sparsity).
We assume that are uniformly sparse, in the sense that , the degree of a random vertex in , satisfies that
(1.9) |
for some limiting degree distribution .
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 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 is locally tree-like:
Condition 1.3 (Locally tree-like random graph sequences).
We assume that are locally tree-like, in the sense that converges locally in probability to a rooted graph that is almost surely a tree.
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 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 -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 be a finite graph. Then if and ,
(1.10) |
where
(1.11) |
and
(1.12) |
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) |
where
(1.14) |
In particular, for graphs on vertices, having a locally tree-like limit, we can bound
(1.15) |
since by the fact that the local limit is tree-like (recall Condition 1.3). Since is arbitrary, it follows that
(1.16) |
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 be a finite graph of size . Then if and ,
(1.17) |
We continue by investigating the rank-2 approximation 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) |
where we use a slight abuse of notation and write instead of and instead of . 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 and external field in terms of the partition function of a ferromagnetic two-spin model:
Theorem 1.6 (Rewrite in terms of two-spin models).
Let be a finite graph. For every ,
(1.19) |
where
(1.20) |
and
(1.21) |
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) |
where
(1.23) |
so that
(1.24) |
Then, since , we can rewrite (see [29, page 2393])
(1.25) |
where the parameters , and are determined by
(1.26) | ||||
(1.27) | ||||
(1.28) |
Thus,
(1.29) |
(1.30) |
so that
(1.31) |
(1.32) |
so that
(1.33) |
We conclude that
(1.34) |
where we define the partition function of the extended Ising model as
(1.35) |
and is the degree of vertex . 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).
Corollary 1.8 (Thermodynamic limit of random cluster model).
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 :
-
Since , and , we have that as well. Thus, our extended Ising model is ferromagnetic;
- Prefactors and :
-
The factor multiplying is a constant, and will thus not play a significant role in the properties of our model;
- Sign of :
-
We have that in (1.29) satisfies that for ;
- Sign external fields:
-
The difficulty is that in (1.29), and in (1.24) might have opposite signs. Thus, the vertex-dependent external field for potentially alternates in sign, depending on the degrees. The sign is fixed when for all , i.e., for -regular graphs. The sign is also fixed for when , i.e., , 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 for has not been investigated in the literature. However, when , 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.
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 by
(1.38) |
where
(1.39) |
is a probability distribution with consistent marginals, i.e., satisfies that and , while, for every and ,
(1.40) |
In terms of this notation, let
(1.41) |
The corollary below relates to the Bethe partition function :
Corollary 1.10 (Lower bound in terms of Bethe partition function).
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 in (1.41) wrt the variables and , and use Lagrange multipliers on the constraints. This will give recursion relations for the variables and 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) |
where
(1.45) |
For , we let and be the coordinate-wise minimum and maximum of and . Then,
(1.46) |
i.e., the function 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, may even depend on the vertex as , and may depend on the edge as .
The way how Ruozzi proves this statement in [28] is by using -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 -regular setting, for which the external field has a fixed sign and is thus vertex independent.
Pressure per particle for general external fields.
Let be locally tree-like -regular graph having vertices. Let us denote as the pressure per particle of the Ising model with inverse temperature and external field , i.e.,
(1.47) |
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 :
Theorem 1.11 (Thermodynamic limit of random cluster model on regular graphs).
Let be a locally tree-like -regular graph having vertices. Then, for all and , the limit is given by
(1.48) |
where ,
(1.49) |
and
(1.50) |
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 . For , the phase transition when 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 .
For and , define
(1.51) |
and
(1.52) |
Then the critical curve is defined by
(1.53) |
where is the unique positive solution of
(1.54) |
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 , the random cluster model on a sequence of locally tree-like -regular graph undergoes a first-order phase transition at the critical curve parameterised by the equation (1.53). More precisely, for ,
where is defined in (1.48) with . For , instead, there is no phase transition, that is, is analytic.
Remark 1.13 (How does arise?).
When , the curve shrinks to the critical point of the Ising model with .
Relation to Basak, Dembo and Sly [3] for Potts models with .
We close this section by explaining the relation to the work of Basak, Dembo and Sly in [3] that studies the -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 -regular graphs, which will be an essential ingredient in the proof:
Theorem 1.14 (Quenched equals annealed for random -regular graphs).
Let be a random -regular graph with and vertices. Then, the quenched and annealed pressures per particle are equal, i.e., for all and ,
(1.55) |
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 ).
Let be a regular graph on vertices and with degree that converges locally to a -regular graph. Then [3, Assumption 1.4] of Potts models with holds for all , .
Proof.
Let be a regular graph on vertices and with degree that converges locally to a -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 -regular graph equals the Bethe functional for all . By Theorem 1.14, the quenched and annealed pressure per particle agree for the random -regular graph and all . This means that, for any -regular graph 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) |
where we define the vertex-dependent external fields by
(1.57) |
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 be a sequence of locally tree-like random graph having vertices. Suppose that , and , where
(1.58) |
is the minimal degree in the graph. Then, as ,
(1.59) |
By symmetry of the spins, the same result holds when and . We refer to Theorem 4.1 for a more detailed statement, in which a reprentation of is given in terms of message passing recursion relations. For , the condition is verified either when or when 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).
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 even and all . Bencs, Borbényi and Csikváry [4] prove that it holds for all and , improving upon an earlier result by Helmuth, Jenssen and Perkins [24] that applies to sufficiently large. With Theorem 1.14, we now know that it holds for all and . 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 , 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 be a graph sequence that is locally tree-like. Let denote the partition function of the extended Ising model with parameters defined as in (1.35). Then, there exists such that
(1.61) |
Conjecture 1.18 has the following immediate corollary:
Corollary 1.19 (Pressure per particle of random cluster model).
Proof.
This immediately follows since . ∎
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 or zero temperature, of this model is.
Negative external fields.
The Ising model, arising for , is perfectly symmetric, so that , which allows us to translate results for to . This property, however, does not extend to general . Our results only apply to non-negative . We next explore what happens for for locally tree-like regular graphs:
Remark 1.20 (Implications of lower bound for regular graphs).
Let 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) |
as well as
(1.64) |
so that quenched and annealed pressures agree for the rank-2 approximation. Here, we think of 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) |
where the latter is the Bethe functional of the original random cluster measure. Our final assumption is that the (hopefully reasonably explicit) formulas for and allow us to relate them as
(1.66) |
Of course, it may be that this is only true for part of the parameter choices of .
Then we claim that the quenched and annealed pressure per particle for locally tree-like regular graphs converges to . This may be used to extend our results to . Indeed, by Lemma 2.3,
(1.67) |
Further, since the quenched pressure is bounded from above by the annealed one, also
(1.68) |
where the last inequality follows from (1.66). Then, we conclude that
(1.69) |
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 .
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 , for Potts models. Further, one may hope that the relatively explicit expressions for and can be compared to prove (1.66).
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 , while it becomes first-order when . For , one can expect the phase transition to persist even for , 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 . Indeed, it was shown that the phase transition is second-order when the power-law exponent is below for some , while it is first-order when . Here, is characterised by the limiting proportion of vertices of degree at least being of the order 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 for the two-point correlation function of the Potts model. Then, (cf. [23, Theorem (1.16)]) for and ,
(1.70) |
This allows one to compute Potts quantities using the random cluster representation. In particular, the critical value should be the value for which will become positive uniformly in and , or for random and , 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 and , we let
(2.1) |
where we recall that denotes the number of connected components of the graph . To relate this to the random cluster model (or even Potts models), we have to take . Indeed, comparing to (1.2), we see that
(2.2) |
since , so that
(2.3) |
Thus, obviously, to study the partition function of the random cluster model, it suffices to study 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 , and let be a finite graph. Then
(2.4) |
where
Let be a graph with cycles of length at most and size . Then also
(2.5) |
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 , 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 with , where we recall that
In the following lemma, we reduce , and at the same time isolate the dependence on :
Lemma 2.2 (Reduction of and dependence on ).
For all and ,
Proof.
This proof is an adaptation of [4, Proof of Lemma 2.2]. Recall the Potts model and Lemma 1.1 saying that with , if is an integer larger than ,
(2.6) |
Note that the partition function of the Potts model can be represented as
where is the set of all -partitions of a set . Thus,
(2.7) | ||||
Combining the last two display equations, we get for all integers ,
Moreover, for a finite graph , both expressions in the above equation are polynomials in . Therefore, the equation holds for all . ∎
The next lemma provides a rank-2 lower bound on the partition function:
Lemma 2.3 (Rank-2 lower bound).
For all and ,
(2.8) |
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 :
Lemma 2.4 (Rank-2 upper bound).
For all and ,
where
If we compare the upper bound in Lemma 2.4 to the one in Theorem 2.1, we see that the power of 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 , let be the vertex sets of the connected components of the graph , and let be the corresponding subsets of . If is an isolated vertex, then, by convention, is the empty set. We define
Since ,
(2.11) | ||||
We say that a vertex set is compatible with if with is the union of some tree components of . Note that may be the empty set. We denote this relation by . Furthermore, let be the edges of induced by the vertex set . Note that if , then is a forest. On the other hand, there is no restriction on
Let be the number of connected components of . Since is the set of tree components in ,
(2.12) | ||||
Therefore,
(2.13) | ||||
where, in the last sum, is a subset of the edges on the subgraph that is such that is a forest, and the number of connected components of the graph on with edges given by . Then
(2.14) | ||||
Combining the last two estimates, and setting , 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 and , follows from Lemmas 2.3 and 2.4. For (ii) or the estimate of , we say that a connected component of is large when it contains a cycle of length at least , and small otherwise. It is clear that there are at most 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 , and thus is smaller than . ∎
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) |
where
and we recall that
We claim that
(3.2) |
Using (3.1) and (3.2) then gives
(3.3) |
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) |
On the other hand, using (3.2) and the fact that
(3.5) |
where is a constant, we obtain
This estimate, together with (3.1), implies that
(3.6) |
It follows from (3.3), (3.4), and (3.6) that
Considering the Potts models, i.e., letting be an integer, [14, Theorem 3] states that
where is the so-called Bethe free energy. Therefore, the last two equations imply
which is indeed [3, Assumption 1.4]. Thus, it remains to prove (3.2).
Proof of (3.2).
Observe that
(3.7) |
where
Recall that we call a cyclic connected components of for large if it contains a cycle of length at least , and small otherwise. It clear that there are at most 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 , and thus is at most . It suffices to show that
(3.8) |
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 , set and consider
(3.9) |
where is the induced subgraph of with vertex set . We call a cycle an cycle when it has length . Given with , we pick a vertex arbitrarily and observe that
(3.10) |
where
and is the configuration model on with degrees
Applying (3.1) recursively, we arrive at
(3.11) |
where the sum is taken over all the possible tubes of disjoint sets such that for all , and we also used that
Note that there are at most
such choices for . Thus,
(3.12) |
where we also used that since . Combining (3.9) and (3.1) gives
since and , and . 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 -regular graph. We define (see [9])
(3.13) |
where
(3.14) |
Then, by [9, Theorem 1.1],
(3.15) |
We summarise here some properties of the maximiser of the function :
-
(a)
If then is unique. Moreover, the function is differentiable w.r.t. if .
-
(b)
If then and . Moreover,
where
-
(c)
is differentiable in for all . On the other hand, is differentiable in for all except for and :
We remark that
(3.16) |
where
and
By observation (c), is the only possible value of for which the derivatives of might be discontinuous. Solving , we obtain
(3.17) |
Also by observation (c), while is continuous in the whole regime, is discontinuous when and , and is continuous otherwise.
Next, we aim to check the condition . By a direct computation, for ,
(3.18) |
Consequently,
(3.19) |
We claim that, for ,
(3.20) |
where
(3.21) |
We defer the proof of (3.20) to the end of the proof. Since and is strictly decreasing by (3.18), there exists a unique such that
Since is increasing in , is decreasing in . Moreover, and . Therefore, there exists such that
Particularly, if ,
and otherwise.
In conclusion, if and , where
(3.22) |
then the derivative is discontinuous, i.e., , i.e., we have a first-order phase transition. We conclude that it remains to prove (3.20).
Proof of (3.20).
Setting and , we have
since for . By (3.21), , and substituting , we obtain
(3.23) |
Thus,
(3.24) |
Since ,
(3.25) |
Moreover,
where, for the third line, we have used the Cauchy-Schwarz inequality in the form , and the inequality that if and . In addition, . Therefore,
Since as , 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) |
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 Further, let be the rooted random tree that arises as the local limit of our graph sequence. Fix such a rooted tree with root . Let and for every . Let be an edge in . Then, let be the sub-tree of rooted at which results from deleting the edge from . We write for the directed version of the edge that points from to .
Let be the marginal law of for the Ising model on with inverse temperature and vertex-dependent external fields . We will mostly be interested in or for some child of . We emphasise that are random variables when is a random tree.
We let be the children of , and define, for
(4.2) |
and
(4.3) |
Our main result is then the following:
Theorem 4.1 (Pressure per particle on locally tree-like graphs).
Consider a graph sequence of size that converges locally in probability to the random rooted tree . Then, for every and for every ,
(4.4) |
where
(4.5) |
and the expectation is w.r.t. the random rooted tree .
Theorem 4.1 obviously implies Theorem 1.16, and gives an explicit formula for the limiting pressure per particle . We next discuss its proof, for which, rather than studying directly, we study its derivative w.r.t. . In more detail, we use that
(4.6) |
where is the extended Ising measure on , i.e.,
(4.7) |
denotes the expectation w.r.t. , and is chosen uniformly at random. By the GKS inequality (see, e.g., [26, Lemma 10.1]), we can bound, for every , and using that for every ,
(4.8) |
where is the -neighbourhood of in , and 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) |
where is the -neighbourhood of in the limiting rooted tree Key here is that our external fields are local, in that only depends on the degree of the vertex , and not on any other properties of the pre-limit graph . Similarly,
(4.10) |
By [16, Lemma 3.1], is close to for large, whenever all external fields for satisfy . This shows that
(4.11) |
for an appropriate . Theorem 4.1 follows by combining two further crucial steps. First, convergence of the pressure per particle follows from integrating from to , and considering what happens for 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 , 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).
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 -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 -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.