{'fraction_non_alphanumeric': 0.04677333780123426, 'fraction_numerical': 0.017117645416212895, 'mean_word_length': 3.7915440192667917, 'pattern_counts': {'":': 0, '<': 6, '<?xml version=': 0, '>': 10, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 10, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Non-robust phase transitions in the generalized clock model on trees

Pemantle and Steif provided a sharp threshold for the existence of a RPT (robust phase transition) for the continuous rotator model and the Potts model in terms of the branching number and the second eigenvalue of the transfer operator, where a robust phase transition is said to occur if an arbitrarily weak coupling with symmetry-breaking boundary conditions suffices to induce symmetry breaking in the bulk. They further showed that for the Potts model RPT occurs at a different threshold than PT (phase transition in the sense of multiple Gibbs measures), and conjectured that RPT and PT should occur at the same threshold in the continuous rotator model. We consider the class of 4- and 5-state rotation-invariant spin models with reflection symmetry on general trees which contains the Potts model and the clock model with scalarproduct-interaction as limiting cases. The clock model can be viewed as a particular discretization which is obtained from the classical rotator model on the continuous one-dimensional sphere. We analyze the transition between PT=RPT and PT is unequal to RPT, in terms of the eigenvalues of the transfer matrix of the model at the critical threshold value for the existence of RPT. The transition between the two regimes depends sensitively on the third largest eigenvalue.


Introduction
We consider spin models on locally finite trees T = (V, E) where the spin variables σ x , x ∈ V , take values in the finite local state space Ω 0 = {0, ..., q − 1}, q ∈ N. The interaction between the spin variables will be given by a transfer matrix which is circulant, i.e. possesses discrete rotationinvariance, and which can therefore be uniquely described by its eigenvalues. An interesting question is whether or not there exists more than one extremal Gibbs measure, i.e., if there is a phase transition for this model. A little bit more involved is the question if it is possible to identify precise values for the free parameters of the transfer matrix at which a phase transition occurs. For background and recent results see [1, 2, 11, 14, 16, 17, 21-23, 28, 32]. Another interest in spin models on trees comes from network theory, where random graphs are used to describe the interaction between different agents.
In these models the random graphs are often assumed (or proven in the largegraph limit) to be locally tree-like. To understand the behavior of these systems it is important to understand the situation on the tree first [4][5][6][7]. For the Ising model on an arbitrary infinite tree with constant interaction strength J the exact critical inverse temperature β c of phase transition is well-known and is given by Jβ c = k coth −1 (br T ), where k is Boltzmann's constant and br T is the branching number of the tree which captures the average number of edges per vertex [25]. Similarly, the critical value for the existence of infinite clusters under independent Bernoulli percolation and the critical value for recurrence of random walks on the tree are given in terms of br T as well [26].
One way to determine whether or not the spin model exhibits a phase transition is to exploit the recursion formula for the marginal distributions of the finite-volume Gibbs measures under boundary condition, see (3.1). For such models there is no phase transition, if and only if all the single-site marginals of the finite-volume Gibbs measures converge to the equidistribution for every boundary condition ω ∈ Ω (Proposition 3.1). For some models which are stochastically increasing in the boundary condition, in a sense described below, it is even enough to prove that the marginals of the finite-volume Gibbs measure under plus boundary condition converge to the equidistribution. This is for example the case in the Ising and the continuous rotator model, but also in the generalized clock model which will be introduced shortly (Proposition 3.2).
Showing that the Gibbs marginals converge under the tree recursion is in general a challenging problem: Along the leaves of the finite subtree we have to fix a boundary condition, which means that we are starting from a Dirac distribution, i.e., far away from the equidistribution, and the recursion, in general, lacks any convexity.
In [29] Pemantle and Steif introduced the notion of a robust phase transition (or RPT) which makes the tree recursion for the Gibbs marginals easier to analyze. Such a robust phase transition is said to occur when even for an arbitrary weakening of the interaction along the spins at the boundary of a sequence of finite sub-volumes Λ n V , we still retain information about the spins at a single site in the thermodynamic limit n → ∞, i.e., even under this stronger condition the single-site Gibbs marginals are not converging to the equidistribution. For more background on phase-transitions in systems with weak boundary couplings see also [9,10]. The question whether or not there is a robust phase transition is easier to answer as one can make use of local arguments around the equidistribution. To be more specific: Under the assumption that there is a robust phase transition it is possible to start the recursion in a distribution which is already arbitrarily close to the equidistribution. Then, we only have to make sure that under the recursion we are repelled from the equidistribution. The behavior is heuristically understood in terms of the linearization of the recursion, but to control the non-linearities along relevant directions is delicate.
Pemantle and Steif provided a sharp threshold for the existence of a RPT for the continuous rotator model (also called classical Heisenberg model) in any dimension, as well as for the Potts model. Similarly to the threshold for regular phase transitions in the Ising model, it is given in terms of the branching number of the tree and an effective coupling parameter, which turns out to be the second eigenvalue of the transfer operator. Furthermore they showed that for the Potts model RPT occurs at a different threshold than the regular phase transition, but conjectured that RPT and regular phase transition should occur at the same threshold in the continuous Heisenberg models [29]. It is therefore interesting to investigate generalized clock models as interpolations between the Potts model and the model of plane rotators (XY-model, Heisenberg model on S 1 ), from the perspective of the study of RPTs. (For more results around the issue of differences and similarities between continuous spin-models and clock models see e.g. [12,13,19,27].) This paper consists of two main parts: Applicability of Pemantle-Steif theory: We consider a class of finite-state spin models on general trees and show that for a wide range of circulant transfer matrices the sharp threshold for the existence of RPT given by Pemantle and Steif holds in these cases as well (Proposition 2.5). More precisely, this result holds under the assumption that the matrix elements of the transfer matrix are non-increasing in the distance to the diagonal. This is equivalent to saying that the pair potential describing the interaction of two neighboring spins along the tree is non-decreasing in the difference of the spin values along the discrete circle.
Bifurcation analysis on binary tree for q = 4, 5: For q = 4, 5 we show that in these models, which we call generalized clock models, RPT and regular phase transition are in general not equivalent and we determine the transition point between both scenarios in terms of the third eigenvalue of the corresponding transfer operator for two examples on the binary tree (Theorem 2.6). For a visualization of the regions of the different regimes see Figures 5,6 in Section 4. In the standard clock model with cosine-potential it turns out that there are no non-robust phase transitions (unlike q = 3). The non-equivalence is shown by studying the tree recursion on the level of the Fourier coefficients α 1 , α 2 of the marginal distributions of the finitevolume Gibbs measures. This leads us to a two-dimensional fixed-point equation which turns out to be polynomial. The number of solutions to this fixed-point equation can then be given by analytic arguments.

The generalized clock model: Definitions and main results
Let T = (V, E) be a locally finite tree with vertex set V and edge set E which is rooted at some vertex o ∈ V . The number of neighbors of the vertices is assumed to be bounded by a finite constant B throughout. Let d G : V × V → N be the graph distance on T , i.e., d G (x, y) equals the number of edges in the shortest path from x to y for each pair x, y ∈ V . Also, let |x| := d G (x, o) for any x ∈ V . Two vertices v and w are called nearest neighbors if d G (v, w) = 1, i.e., if there exists an edge e ∈ E connecting them. We use the notation e = {v, w}. We write v → w if d G (v, w) = 1 and |w| = |v| + 1, i.e., v is the parent of w. Finite subsets Λ of V will be denoted by Λ V .
. Due to the Perron-Frobenius theorem the stochastic matrix M has the distinguished eigenvalue λ 0 = 1 with the following properties: First, |λ| < λ 0 for all eigenvalues λ = λ 0 of M , and secondly, λ 0 is simple. We note that because M is invariant under the G-action the matrix is circulant and can hence be completely described by its first row, which will be denoted by r.
As M is a transfer matrix (which even happens to be a stochastic matrix the way we have defined it) we can define an associated potential Φ(i, j) by letting and define the corresponding formal infinite-volume Hamiltonian by We call a spin model with such a Hamiltonian a generalized clock model. Using inverse discrete Fourier transformation we can describe the circulant transfer matrix M (and the potential Φ accordingly) also by its eigenvalues. Remember that the eigenvalues λ j of M are given by r k e −2πijk/q , j ∈ {0, ..., q − 1} and the first row of M is then recovered by λ k e 2πilk/q , l ∈ {0, ..., q − 1}.
If the eigenvalues are chosen such that M is of the form where J > 0 suitable and Z > 0 is a normalizing constant, we recover the Potts model. If M is given by for some J > 0 and normalizing constant Z > 0, we recover the standardclock model with scalarproduct-interaction.
A cutset C is a finite set of vertices such that every self-avoiding infinite path starting from the root o intersects C such that there are no vertices x, y ∈ C with |x| < |y| and x lies in the shortest path from o to y. For a cutset C the graph T \ C consists of some infinite components and one finite component. The finite component will be denoted by C i and the union of the infinite components of T \ C will be denoted by n for every n ≥ N . We define the configuration space by Ω = Ω V 0 . Definition 2.1. Let C be a cutset of the tree T and δ ∈ Ω a spin configuration which serves as a boundary condition to the interior. The finite-volume Gibbs measure on Ω C i 0 under boundary condition δ is defined by and is a normalizing constant or partition function. If the second summand in the Hamiltonian H is left out, i.e., if there is no interaction with the boundary, we call this the free Gibbs measure.
Note that the family of finite-volume Gibbs measures as we have defined them above can also be interpreted as a (local) Gibbsian specification γ Φ [18, Definition 1.23] which is given by This specification is a family of probability kernels with the property that the sigma-algebra generated by the spin variables {σ v , v ∈ (C i ) c } for every A ∈ (P(Z q )) V . Let a measure space (X, F X , µ), a measurable space (Y, F Y ) and a probability kernel π from F X to F Y be given. Then the push-forward of µ under π is defined by The probability kernels given by (2.2) are only defined for finite sub-volumes Λ V of the specific form Λ = C i where C is a cutset, but this is not an issue w.r.t. identifying the set of Gibbs measures: Lemma 2.2. Suppose γ is a specification and µ a measure on Ω V 0 . Then the following statements are equivalent: (i) µ is a Gibbs measure.
For a proof, see [18,Remark 1.24]. This lemma allows us to give an alternative characterization of Gibbs measures (in the infinite volume) as follows: Lemma 2.3. A probability measure µ in the infinite volume Ω V 0 is called a Gibbs measure for the potential Φ if for any cutset C the conditional distribution on C i given a boundary configuration δ ∈ Ω V 0 is given by µ Φ,δ C , i.e., . Given an interaction potential Φ, a cutset C and a boundary condition δ, let p Φ,δ C,o denote the marginal distribution of the finite-volume Gibbs measure µ Φ,δ C at the root o. We now come to the key definition of a robust phase transition, which is said to occur if a "plus" boundary condition retains its influence on the root even when the interaction along the edges at the boundary is made arbitrarily small: Given Φ and u ∈ (0, 1] and a cutset C of T , letΦ(u, C) be the potential which is Φ on edges in C i and uΦ on edges connecting C to C i . Let δ 0 be a boundary configuration which is all 0, i.e.,  . In the following we will always denote the equidistribution on Ω 0 by 1. Definition 2.4. A generalized clock model on the tree T is said to exhibit a robust phase transition for the interaction Φ if for every u ∈ (0, 1], where the infimum is taken over all cutsets C of T .
We will show that under a positivity assumption on the eigenvalues of the transfer matrix M , which is chosen such that M is non-increasing, the existence of a robust phase transition is a geometric property of the underlying tree T . The decisive parameter in this regard is the branching number, which in some sense captures the average number of edges per vertex of the tree. It is defined by where the infimum is once more taken over all cutsets C. The branching number has been introduced in this form by Lyons [26] and it can be interpreted as the exponential of the Hausdorff dimension of the boundary ∂T of the tree which has been studied previously by Furstenberg [15]. For percolation and symmetric root-biased random walks on trees it is known that there exist sharp thresholds for the existence of infinite clusters and positive recurrence respectively that are given by the branching number [26].
The definition of robust phase transitions goes back to a paper by Pemantle and Steif [29], in which they showed that under certain "ferromagneticity" assumptions, amongst others regarding the positivity of the Fourier coefficients of the Gibbs marginals, there exists a sharp threshold for the existence of such RPTs which is given by where λ 1 denotes the first non-trivial Fourier coefficient of the transfer operator. By establishing applicability of the results of Pemantle and Steif we prove that this threshold holds also for certain types of generalized clock models: Remember that for suitably chosen eigenvalues for the transfer matrix M we recover the Potts model and the standard-clock model with the potential Φ(i, j) = cos 2π q (i − j) respectively from the generalized clock model. In both of these two models the same sharp threshold for the existence of a RPT as given in Theorem 2.5 holds.
The existence of a robust phase transition always implies phase transition (Proposition 3.2). However for the Potts model it is known that the existence of regular phase transitions does not solely depend on the second largest eigenvalue and the existence of a regular phase transition does not imply the existence of a RPT. For the classical Heisenberg model it has been only conjectured that robust and non-robust phase transitions do coincide [29].
We show that in the generalized clock model there is no equivalence of PT and RPT in general: For q = 4, 5 on the binary tree we provide the exact transition point between the two regimes PT=RPT and PT =RPT at criticality, i.e., for λ 1 = 1/2, in terms of the third largest eigenvalue λ 2 . For q = 4 we give the transition points for every λ 1 ∈ (0, 1/2) (see Figure 5). Theorem 2.6. Consider the generalized q-state clock model on the binary rooted tree. For q = 4 and q = 5 there exists a non-empty region for the eigenvalues λ 1 , λ 2 of the transfer matrix M , such that the spin system exhibits a phase transition but no robust phase transition.

RPT is a geometric property: Applicability of Pemantle-Steif theory for the generalized clock model on possibly irregular trees
An important property of Gibbs measures for spin models on trees is the recursive nature of their marginal distributions p Φ,δ C,v : Let w 1 , ..., w k be the children of v. Then We like to note that equation (3.1) is the defining property of so-called boundary laws or entrance laws [18], [33]. It is known that every Gibbs measure which is a tree-indexed Markov chain can be uniquely represented in terms of a boundary law (up to a positive pre-factor), and conversely that every boundary law can be used to construct a Gibbs measure which is a Markov chain [33]. Furthermore, the extremal elements of the set of Gibbs measures are necessarily Markov chains (see [18,Theorem 12.6]), and therefore spin models on trees exhibit a phase transition if and only if there exists more than one boundary law. Note that we always have the free solution, i.e., the equidistribution 1. For a recent paper showing the connection between gradient Gibbs measures and periodic boundary laws for models with non-compact local state space, see [23]. In the following we will work towards an equivalent definition of phase transition. For every neighboring pair of vertices v, w ∈ V we get two infinite trees when we remove the edge {v, w} from E. Let us denote the tree containing v by T v and the other by T w . For any cutset C n on the whole tree T we define cutsets C v n := C n ∩T v and C w n := C n ∩T w on the two subtrees T v , T w . For any configuration δ ∈ Ω we introduce boundary conditions δ v and δ w on T v and T w by setting δ v := δ ∩ T v and δ w := δ ∩ T w respectively. Note that in the following we denote the marginal distributions of the finitevolume Gibbs measures on the infinite subtrees T v and T w by p Φ,δv C v n ,v and p Φ,δw C w n ,w respectively. These are not to be confused with the marginals of the finite-volume Gibbs measure on the whole tree T . Let the inner boundary of a subset Λ ⊂ V be defined by ∂ i Λ := {v ∈ Λ : ∃w ∈ ∂Λ with {v, w} ∈ E}.
Proposition 3.1. Let (α i ) i∈V be a family of measures on Ω 0 and let {C n } n∈N be a sequence of cutsets that exhausts V . Suppose that for every v ∈ V and every δ ∈ Ω the marginal distribution p Φ,δv C v n ,v converges to the distribution α v . Then the thermodynamic limit of the finite-volume Gibbs measure, µ := lim n→∞ γ C i n (· | δ), exists for any choice of δ and is given by where Λ V is any finite connected set, ω Λ ∈ Ω Λ 0 , and Z Λ is a normalizing constant.
Proof. The proof is done by induction on |Λ|. First, let Λ = {v, w} with v ∼ w. Remove the edge connecting v to w from the tree to get the two subtrees T v and T w which contain v and w respectively. Note that by assumption for n → ∞. Let g be some test-function on Λ = {v, w}. Then for n → ∞. This proves the claim for volumes Λ that consist of only two sites. Now suppose the claim holds for any sub-volume ∆ ⊂ V with |∆| = n. Let Λ := ∆∪{w} with w ∈ ∂∆ and v := ∂w∩∆. Let g be some test-function on Λ. Then The last equation follows from the induction assumption. Note that γ C v,i n (· | δ v ) is the measure on the subtree T v and not on the whole tree. Hence the inner boundary of ∆ in T v is not containing w. This completes the proof.
Note that Proposition 3.1 readily implies that there is no phase transition under the given assumptions: Every extremal Gibbs measure µ can be given as a thermodynamic limit of a finite-volume Gibbs measure prepared with some boundary configuration which is typical for µ (see [8, Proposition 2.23]). As these limits are assumed to be the same for any boundary configuration ω, we find that there can only exist one extremal Gibbs measure. Therefore the spin model exhibits a phase transition if and only if the recursion equation (3.1) has more than one solution. It is even enough to study the recursion under "plus" boundary condition:  Observe that the r.h.s. of (3.1) is a convolution of the different distributions of the children over the vectors in the circular matrix representing the interaction, followed by an ordinary product. We will make use of consequences of this structure regarding monotonicity below.
In the following we will show that in the generalized clock model, where we assume that the eigenvalues of the transfer matrix M are restricted by 1 ≥ λ j > 0, ∀j ∈ {0, ..., q − 1}, and such that M is non-increasing, the existence of a RPT is determined by the branching number of the underlying tree and the second largest eigenvalue of the transfer matrix.
To understand the recursion (3.1) for the Gibbs marginals, it is important to note that it preserves the natural class of symmetric probability vectors which have positive Fourier (cosine-)coefficients, as we will explain now. By P (Ω 0 /0) we denote the vectors on Ω 0 that are symmetric to 0, i.e., f (j) = f (k) if d(0, j) = d(0, k) for any f ∈ P (Ω 0 /0). Note that dim(P (Ω 0 /0)) = This basis has the properties where φ i * φ j (k) := l φ i (k − l)φ j (l) and z j = k∈E φ 2 j (k). We introduce a new norm ||·|| A on the space of symmetric vectors P (Ω 0 /0), which is defined as the sum of the absolute values of the Fourier coefficients, i.e.,

||f ||
For any two distributions f, g ∈ P (Ω 0 /0), we clearly have f g ∈ P (Ω 0 /0) and ||f g|| A ≤ ||f || A ||g|| A . This submultiplicativity can be seen by developing f and g w.r.t. B and using property (3.2). As any f ∈ P (Ω 0 /0) can be developed w.r.t. B, property (3.3) gives us a j (f * g) = z j a j (f )a j (g) ∀f, g ∈ P (Ω 0 /0). Note that (3.4) a j (M e 1 ) = a j (r) = λ j /z j > 0 for all j ≥ 0. We define the class P + (Ω 0 /0) ⊂ P (Ω 0 /0) as the smallest class of symmetric probability vectors which contains the canonical basis vector e 1 = (1, 0, ..., 0) and which is closed under the recursion given by (3.1). Note that this class contains all possible marginal distributions of any finite-volume Gibbs measure under "plus" boundary condition. By the recursion formula it follows, that all the Fourier coefficients of any marginal g ∈ P + (Ω 0 /0) of a Gibbs measure are strictly positive: Remember that this is only the case since we have chosen the eigenvalues of the transfer matrix M to be positive. Another important property is that the Fourier coefficients of higher order are dominated by the first one: Let f ∈ P + (Ω 0 /0). Then which is equivalent to say that z 1 a 1 (f ) ≥ |z j a j (f )| for all j ∈ {0, ..., q/2 }. For r being the first row of the transfer matrix M of a generalized clock model with M being non-increasing this implies that λ 1 is the second largest eigenvalue: We come to an important lemma which establishes an upper bound for the distance of the convoluted distributions to their linearization.
Here the product is understood to be pointwise and Z > 0 is a normalizing constant turning k i=1 h i into a probability vector.
This lemma is similar to Lemma 2.7 from [29] and the proof works similarly. We like to point out that the proof requires a bound on the term q−1 j=0 k i=1 h i (j) from below. This is where the non-negativity of the eigenvalues λ i of the transition matrix enters. We have seen that under this condition all Fourier coefficients of the vectors h i are positive. This and property (3.2)   get by the orthogonality of the basis functions that For q = 5 we get For probability vectors h ∈ P + (Ω 0 ) there are of course restrictions on the values of the Fourier modes a 1,2 that come from 0 ≤ h(j) ≤ 1 for all j ∈ Ω 0 and from the fact that h is non-increasing. For the region of values the coefficients a 1,2 can attain in this case, see Figure 1. It can be easily checked that q−1 j=0 h 1 (j)h 2 (j) is always bounded from below for any choice of h 1 , h 2 . Therefore Lemma 3.3 holds for the generalized clock model with q = 4, 5 even for transfer matrices with non-positive eigenvalues.
We come to the proof of Proposition 2.5 regarding robust phase transitions on trees in the generalized clock model.
Proof of Proposition 2.5. We will check the necessary conditions for Theorems 3.1 and 3.2 from the paper by Pemantle and Steif [29]: (i) From Lemma 3.3 follows the upper bound for the distance of the convoluted distributions to their linearization. (ii) Note that as P (Ω 0 /0) is finite-dimensional all norms are equivalent, in particular the A-Norm || · || A and the supremum norm || · || ∞ .
(iii) Let Φ be a potential that corresponds to some circulant transfer matrix M . For u ∈ (0, 1] we define M u to be the transfer matrix that corresponds to the potential uΦ, i.e., the first row of M u is given by Clearly ||r u − 1|| ∞ → 0 and hence ||r u − 1|| A → 0 for u → 0. (iv) The transfer matrix M is bounded by 1 in the operator norm: (v) The next inequality shows that the convolution is in some sense a contraction w.r.t. to the A-norm: Therefore all the conditions for Theorem 3.1 from [29] are met. Hence we can already conclude that in the generalized clock model λ 1 br(T ) < 1 implies the absence of a RPT.
In the following we check the conditions for Theorem 3.2 of [29]: (i) First we like to note that for all f ∈ P + (Ω 0 /0) (ii) If f is non-increasing, it is easy to see that M f = r * f is also nonincreasing. Therefore, as a consequence of the recursion (3.1), all f ∈ P + (Ω 0 /0) are non-increasing. Define the functional L : P (Ω 0 /0) → R that captures the weighted absolute value of the first Fourier coefficient by Let f ∈ P + (Ω 0 /0). Then (iii) Note that L(f ) can be bounded from above by the A-norm of f : for all f ∈ P + (Ω 0 /0). (iv) Now, we want to find a constant d > 0 s.t. L(f ) ≥ d||f − 1|| A for all f ∈ P + (Ω 0 /0). We already know that |a 1 (f )| = a 1 (f ) ≥ |a j (f )| for all j ≥ 2. Therefore we can choose d := z 1 / q 2 . Therefore all the prerequisites for Theorem 3.2 in [29] are met as well. Hence we get that in the general clock model λ 1 br T > 1 implies the existence of a RPT and we have finished the proof of Proposition 2.5.
Remark 3.5. Let us once more consider the q-state generalized clock model with q ∈ {4, 5} on the binary tree. We have already seen in Remark 3.4 that Lemma 3.3 also holds for the case of transition matrices with negative eigenvalues as long as they are non-increasing. One can easily check that all the other prerequisites for Theorem 3.1 from [29] are also met in this case and therefore λ 1 br T < 1 still implies the absence of robust phase transitions.
For the verification of the conditions of Theorem 3.2 from [29] note that the space P + (Ω 0 /0) is three-dimensional and |a 1 (f )| = a 1 (f ) ≥ |a 2 (f )| for every f ∈ P + (Ω 0 /0). It is then easily seen that for suitably chosen constant c 4 indeed L(f ) ≥ c 4 ||f − 1|| A for all f ∈ P + (Ω 0 /0). For q = 4, 5 the constant can be chosen to be c 4 = 2/z 1 . All the other conditions of Theorem 3.2 are clearly met as well.
We conclude that for q = 4, 5 the sharp threshold for the existence of a RPT holds even for transition matrices with negative eigenvalues as long as the transfer matrix M is non-increasing.

Non-robust phase transitions in the generalized clock
model on the binary tree 4.1. Case q=5. In this section we will take a closer look at the generalized clock model with local state space Ω 0 = {0, ..., 4}. Furthermore we will assume that T is the binary tree, i.e., the Cayley tree CT (2). The first row of the transfer matrix M is given by r = (r 0 , r 1 , r 2 , r 3 , r 4 ) = (a, b, c, c, b), where a + 2b + 2c = 1. As M is symmetric there are five eigenvalues λ i , i = 0, ..., 4, that are given by
All the solutions to the polynomial equation (4.6) can be calculated by numerical techniques. For a plot of the derived coefficients α 1 and α 2 respectively against the corresponding value of λ 2 , see Figures 2a and 2b. It can be checked by simple numerical calculations that all of these solutions correspond to a probability distribution.
In accordance with our previous investigation we find that there only exists the trivial solution to the fixed-point equations if λ 2 < λ c 2 . At the critical value λ c 2 an additional solution away from the trivial one appears, which then undergoes a pitchfork bifurcation. For λ 2 = 0.4 the lower branch then becomes 0, which happens when e = 8λ 2 2 − 36λ 3 2 + 40λ 4 2 = 0. As we have predicted, an additional solution appears when λ 2 =λ c 2 . This solution then also undergoes a bifurcation for increasing values of λ 2 and the lower branch becomes 0 for λ 2 = 0.5, which is again where e = 0. So we have exactly four different solutions to our two-dimensional fixed-point equation when λ 2 = 0.5 which is of course when our generalized clock model turns into the Potts model with no external magnetic field. In this situation there are three additional solutions s 1 , s 2 , s 3 to the trivial one. The symmetries of the corresponding boundary laws are visualized in Figure 3.
with β > 0 and Z = e β + q − 1 being a normalizing constant. Then λ 1 = λ 2 = e β −1 e β +q−1 . Note that 2λ 1 = 1 if and only if θ := e β = q + 1. Let us comment on this value. Recall that in the 5-state Potts model the translation-invariant states are described by the translation-invariant solutions for the boundary law equation [21]: There is always the free solution (corresponding to open boundary conditions), and each boundary law has the property that its 5 components take only two values. There are two different one-dimensional fixed-point equations for the case of a decomposition into either 1 + 4 or 2 + 3 components. Each of these fixed-point equations have different critical inverse temperatures at which solutions appear and bifurcate into an upper and a lower branch. It is a property of the recursion that on the binary tree at θ := e β = q + 1 the lower branches of these recursions become equal to the free solution. This behavior is similar for all Potts models on Cayley trees of any degree and the corresponding value θ cr is known [21]. As we will see shortly in Proposition 4.1 this critical value is identical with the critical value for the existence of RPT for Cayley trees of any degree. This is remarkable. Robust phase transition is caused by local instability of the equidistribution, that is small perturbations won't be attracted by the equidistribution but will converge to (one of) the stable symmetry breaking fixed points. On the other hand, the degeneration of the lower branches of the m-indexed boundary laws (with m singled out components) is indicated by the same equation. Let θ RP T denote the critical value of θ for the existence of RPT in the Potts model. Proof. It is known that θ cr = d+q−1 d−1 [21]. As θ = θ RP T iff the claim is obviously true.

4.2.
Case q=4. We still consider the generalized clock model on the binary tree T . Let the local state space be given by Ω 0 = {0, ..., 3}. Again we assume M to be non-increasing. The entries of the first row of the transfer matrix are given by where λ i , i = 0, 1, 2 denote the eigenvalues of M . For the basis of the masszero measures we choose ϕ 2 := c −1 2 (1, cos π, cos 2π, cos 3π) = c −1 2 (1, −1, 1, −1), c −1 2 := 2. The symmetric probability distributions can be represented as The recursion F 4 of the distributions on the binary tree T is then given by The summands in the numerator are given by By orthogonality the normalization is just and hence This leads to the two fixed-point equations For the critical value λ 1 = 1/2 it follows from the first of these equations that α 1 = 0 or In the case where α 1 = ± 2λ 2 α 2 − 4λ 2 2 α 2 2 , it follows from the second fixedpoint equation that .
Plugging this value for α 2 into (4.8), we get that ± 2λ 2 α 2 − 4λ 2 2 α 2 2 only takes real values if and only if λ 2 ∈ (1/3, 1). Hence the critical value for λ 2 for the existence of a phase transition is λ c 2 := 1 3 . An easy calculation shows that all the solutions to (4.7) correspond to a probability distribution. We have thereby shown the following theorem. We have seen that there exist non-robust phase transitions in the generalized clock model on the binary tree for q ∈ {4, 5}. It is not difficult to prove that for a generalized clock model on a tree T which exhibits no RPT there always exists another tree T s.t. br T = br T and T does not exhibit a PT. This is very much done by the same techniques proving the absence of RPT under the condition λ 1 br T < 1. The tree T is constructed by adding edges in series with sufficient length to the tree T , where the adding of these edges must be done sufficiently sparse such that br T = br T . The recursion along these added series of edges then replaces the weakening of the coupling along the cutset in the notion of RPT (see the proof of Theorem 1.14 in [29]).
Let us map our solutions to the known solutions of the Potts model [21]. Note that at λ 1 = 1/2 there is a bifurcation of the m = 2 branches from the free solution α = 1, where both branches exist only for bigger values of λ 1 . Hence the only available solution is of type m = 1, and here we only find the solution of the upper branch of the form, written in boundary law language, (a, 1, 1, 1), a = 1. Also, our recursion acts in the subspace of these solutions which are symmetric w.r.t. 0. Hence only two of the possible permutations persist, namely (a, 1, 1, 1), (1, 1, a, 1). These solutions are mapped to the upper and lower end of the pitchfork type branches in Figure 4.
For q = 5 the task to determine the transition line between the two regimes becomes more difficult. However, it is possible to use the implicit function theorem to prove the existence of non-robust phase transitions. In the Potts regime with λ 1 = λ 2 = λ and λ ∈ (4/9, 1/2) there exist two b.l. solutions of the form l = (a ± , 1, 1, 1, 1) with a ± = 1 − e β 2(q − 1) ± 5 − 4q − 2e β + e 2β 2(q − 1) −1 (4.11) where e β = 1+λ(q−1) 1−λ . Here, λ is the only non-trivial eigenvalue of the transfer matrix M . The Fourier modes α ± 1 , α ± 2 of the solutions a ± are then given by The region for the existence of non-robust phase transitions is given by the area above the dashed line inside the quadrangle. Note that the transition point in the Potts model is given by λ 1 = λ 2 = 2 √ q−1 q+2 √ q−1 ≈ 0.4641 and the transition point at the critical value for RPT in the generalized clock model on the binary tree is given by λ 1 = 1/2 and λ 2 = 1/3. The eigenvalues of the transition matrix for the standardclock model with scalarproduct-interaction are given by the dotted line. There are no non-robust PTs in the standard clock model.
. Let T : R 2 → R 2 be defined by To apply the implicit function theorem we need to compute and discuss the Jacobian. We don't give details, but provide a plot of the Jacobian of T for λ 1 = λ 2 and α 1 = α 2 = α ± which is given in Figure 7. Note that the Jacobi matrix becomes non-invertible right at the critical value for the existence of RPT, i.e., λ 1 = λ 2 = 1/2. This is the point where the lower branch of the b.l. solutions, i.e. a − , turns into the free solution. For In the Potts regime the values of the determinant of the Jacobi matrix of (4.12) for α 1 = α 2 = α ± are plotted against λ = λ 1 = λ 2 .
Hence for every λ 1 = λ 2 there exists an open neighborhood around that point in which there exist non-robust phase transitions. Even though we did not give an analytic argument to show the form of the transition line between the regimes PT=RPT and PT =RPT, we can compute it numerically. The transition line for the case q = 5 is given by the dashed line in Figure 6.