Next Article in Journal
Parameter Optimization of Active Disturbance Rejection Controller Using Adaptive Differential Ant-Lion Optimizer
Previous Article in Journal
Analog Circuit Fault Diagnosis Using a Novel Variant of a Convolutional Neural Network
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Extremality of Disordered Phase of λ-Model on Cayley Trees

by
Farrukh Mukhamedov
1,2
1
Department of Mathematical Sciences, College of Science, United Arab Emirates University, Al Ain P.O. Box 15551, United Arab Emirates
2
Department of Algebra and Analysis, Institute of Mathematics Named after V.I.Romanovski, 4, University Str., Tashkent 100125, Uzbekistan
Algorithms 2022, 15(1), 18; https://doi.org/10.3390/a15010018
Submission received: 5 December 2021 / Revised: 30 December 2021 / Accepted: 30 December 2021 / Published: 3 January 2022

Abstract

:
In this paper, we consider the λ -model for an arbitrary-order Cayley tree that has a disordered phase. Such a phase corresponds to a splitting Gibbs measure with free boundary conditions. In communication theory, such a measure appears naturally, and its extremality is related to the solvability of the non-reconstruction problem. In general, the disordered phase is not extreme; hence, it is natural to find a condition for their extremality. In the present paper, we present certain conditions for the extremality of the disordered phase of the λ -model.

1. Introduction

In communication theory [1], if a process on a tree T is considered, it is crucial to be informed of the information transmitted from the root of the tree (given there is one) to all the nodes of the tree. In this setting, each node inherits information from its parent node with some probability of error. The transmission process is assumed to have an identical distribution on all the edges and different edges of the tree are assumed to act independently [2,3]. Similar kinds of processes have been investigated in statistical physics [4,5]. The main problem that arises with this theory is related to whether the configuration obtained at level n of T typically contains significant information on the root variable. We point out that such a problem arose independently in biology, information theory and statistical physics. For models of statistical physics on trees, the problem is related to the extremality of the disordered Gibbs measure [6,7]. This problem is also related to the solvability of the reconstruction problem of Markov fields on trees (see [8]). The simplest model in statistical physics is the Ising model, for which the extremality of the disordered phase has been investigated [9,10,11]. It is known that the q-state Potts model [12] is a natural generalization of the Ising model to more than two components and encompasses a number of problems in statistical physics [13]. Therefore, in [14,15], the reconstruction problem is investigated for the Potts models over trees. The q-state Potts model has a rich structure to illustrate almost every conceivable nuance of the subject. Furthermore, the Potts models became one of the important models in statistical mechanics. It has been known [16] for a long time that, at sufficiently low temperatures, such a q-state Potts model on the Cayley tree has at least q + 1 translation-invariant Gibbs measures which are also tree-indexed Markov chains. Such translation-invariant tree-indexed measures are equivalently called translation-invariant splitting Gibbs measures (TISGMs). The q measures with homogeneous boundary conditions are always extremal in the set of all Gibbs measures. However, the Gibbs measure associated with the free boundary condition measure is extremal in an intermediate temperature interval below the transition temperature and loses its extremality for even lower temperatures [17] (see [18] for a recent review of the Potts models).
On the other hand, it is natural to consider more general models than the Potts model. In this connection, a so-called λ -model (i.e., a model with nearest neighbors in which the interactions depend on the function λ ) was proposed in [19,20]. This model includes the Potts model as a special case if the λ -function is taken as λ ( x , y ) = J δ x , y , where δ is the Kronecker symbol. If one takes λ ( x , y ) = cos ( 2 π ( x y ) / q ) , then we obtain the Clock model. This model, from the physics perspective, is equivalent to the Potts model in the case q = 3 . Both models undergo a phase transition between a ferromagnetic phase and a paramagnetic phase belonging to the same universality class. In the present paper, we are going to investigate extremity and non-extremity of translation-invariant Gibbs measures of the λ -model. At this point, we stress that the indicated λ -model includes various possible interactions that cannot be described by the Potts models, including, in particular, the Widom–Rowlinson model or Potts-SOS model, with the interaction described by the following function [21,22,23]. Recently, in [24,25], the existence of the phase transition for the λ -model on the Cayley tree with an order of two has been established. However, the existence of the disordered phase and its extremality were not investigated. In this paper, we are going to fill that gap, i.e., the extremality of such a Gibbs measures will be studied. To prove the main result, the Kesten–Stigum condition [26] is employed for the non-extremality of a Gibbs measure. Furthermore, to establish the extremality, we use so called non-re-constructability in information-theoretic language. Our findings have a significant role in information sciences and percolation theory [8,14] since the model that we considered is much more general than all previously known ones.

2. Preliminaries

Let Γ + k = ( V , L ) be a semi-infinite Cayley tree of order k 1 , with the root x 0 (with each vertex having exactly k + 1 edges, except for the root x 0 , which has k edges). Here, V is the set of vertices and L is the set of edges. The vertices x and y are called nearest neighbors and they are denoted by l = x , y if there exists an edge connecting them. A collection of the pairs x , x 1 , , x d 1 , y is called a path from point x to point y. The distance d ( x , y ) , x , y V , on the Cayley tree, is the length of the shortest path from x to y.
W n = x V d ( x , x 0 ) = n , V n = m = 1 n W m , L n = l = < x , y > L x , y V n .
The set of direct successors of x is defined by
S ( x ) = y W n + 1 : d ( x , y ) = 1 , x W n .
Observe that any vertex x x 0 has k direct successors and x 0 has k + 1 .
In this paper, we consider the models where the spin takes values in the set Φ = { 1 , 2 , , q } and is assigned to the vertices of the tree. A configuration σ on V is then defined as a function x V σ ( x ) Φ ; the set of all configurations coincides with Ω = Φ Γ k . The Hamiltonian of the λ -model has the following form
H ( σ ) = < x , y > L λ ( σ ( x ) , σ ( y ) )
where the sum is taken over all pairs of nearest-neighbor vertices x , y , σ Ω . From a physical point of view, the interactions between particles do not depend on their locations; therefore, from now on we will assume that ł is a symmetric function, i.e., λ ( u , v ) = λ ( v , u ) for all u , v R .
We note that the λ -model of this type can be considered as a generalization of the Potts model. The Potts model corresponds to the choice λ ( x , y ) = J δ x y , where x , y , J R .

3. Splitting Gibbs Measures

In this section, we recall the definition of splitting Gibbs measures.
Now, let us define a finite-dimensional distribution of probability measure μ ( n ) on Ω n : = Φ V n as follows
μ ( n ) ( σ n ) = Z n 1 exp { β H n ( σ n ) + x W n h σ ( x ) , x } , σ n Ω n
where β = 1 / T , T > 0 is the temperature, and
Z n 1 = σ Φ V n exp { β H n ( σ n ) + x W n h σ ( x ) , x }
is the normalizing factor. Moreover, in (2), { h x = ( h 1 , x , , h q , x ) R q , x V } is the set of vectors and
H n ( σ n ) = x , y L n λ ( σ ( x ) , σ ( y ) ) .
We say that a sequence of a probability distribution { μ ( n ) } is consistent if, for all n 1 and σ n 1 Ω n 1 , one has
ω n Φ W n μ ( n ) ( σ n 1 ω n ) = μ ( n 1 ) ( σ n 1 ) .
Here, σ n 1 ω n is the concatenation of the configurations. In this setting, there is a unique measure μ on Ω , such that for all n and σ n Ω n ,
μ ( { σ | V n = σ n } ) = μ ( n ) ( σ n ) .
Such a measure is called a splitting Gibbs measure (SGM), corresponding to the Hamiltonian (1) and a vector-valued function h x , x V (for more information, see [27]).
The next statement describes the condition on h x ensuring that the sequence { μ ( n ) } is consistent.
Theorem 1
([19,24]). The measures μ ( n ) , n = 1 , 2 , satisfy the consistency condition if and only if for any x V the following equation holds:
u k , x = y S ( x ) j = 1 q 1 exp { β λ ( k , j ) } u j , y + exp { β λ ( k , q ) } j = 1 q 1 exp { β λ ( q , j ) } u j , y + exp { β λ ( q , q ) }
where u k , x = exp { h k , x h q , x } , k = 1 , q 1 ¯ .
In what follows, we restrict ourself to the case Φ = { 1 , 2 , 3 } (i.e., q = 3 ), and we consider the following function:
λ ( i , j ) = a ¯ , if | i j | = 2 , b ¯ , if | i j | = 1 , c ¯ 1 , if i = j = 1 , c ¯ 2 , if i = j = 2 , c ¯ 3 , if i = j = 3 ,
where a ¯ , b ¯ , c ¯ 1 , c ¯ 2 , c ¯ 3 R for some given numbers.
Remark 1.
We point out that the considered model is more general than the well known Potts model [12], since if a ¯ = b ¯ and a ¯ c ¯ 1 = c ¯ 2 = c ¯ 3 , then this model reduces to the mentioned one. Namely, in this setting, the function λ is defined by λ ( i , j ) = a ¯ + ( c ¯ 1 a ¯ ) δ i , j . The case of c ¯ 1 = c ¯ 2 = c ¯ 3 has been investigated in [24,25]. If λ ( i , j ) = J | i j | , then the model reduces to the Solid-on-SOlid (SOS) model [28]. If λ ( i , j ) = J p δ i , j + J | i j | , then the model becomes the Potts-SOS model [23].
Now, we are going to find the disordered phase of the model which is related to the translation-invariant splitting Gibbs measure (for short, SGM). Here, through the use of the the translation-invariant SGM, it is an SGM that corresponds to a solution u x of (4), which satisfies u x = u y for all x , y V . This means that u x = u , where u = ( u 1 , u 2 ) , u 1 , u 2 > 0 . Due to Theorem 1, u 1 and u 2 must satisfy the following system equations:
u 1 = C 1 u 1 + B u 2 + A A u 1 + B u 2 + C 3 k , u 2 = B u 1 + C 2 u 2 + B A u 1 + B u 2 + C 3 k ,
where A = exp { β a ¯ } , B = exp { β b ¯ } , C k = exp { β c ¯ k } , k = 1 , 2 , 3 .
We recall that an SGM is called the disordered phase of the λ -model if u 1 = 1 , u 2 = 1 is a solution of (6). This means that the corresponding SGM does not have external boundary conditions.
Remark 2.
We notice that, for symmetric models (interactions), the disordered Gibbs measure corresponds to the zero solution of the recurrent equations (Equation (4)). However, if the model is not symmetric, then the corresponding recurrent equation has no zero solution. In this case, the disordered measure is defined as a translation-invariant Gibbs measure that corresponds to the free boundary condition. Therefore, in some studies (see, for example, [29]), the disordered measure is called a free measure.
Since u 1 = 1 , u 2 = 1 is a solution of (6), which yields
B + C 2 = A + C 3 , C 1 = C 3 .
Remark 3.
It is worth noting that (7) is satisfied for the Potts model. However, if one considers the SOS model (see Remark 1) the condition (7) is not satisfied, i.e., the model does not possess the disordered phase. Now, let us provide a model that is different from the Potts ones and for which the disordered phase exists.
Example 1.
Let λ ( i , j ) = J | i j | + J 1 ( δ 2 , i + δ 2 , j ) , where i , j { 1 , 2 , 3 } and J > 0 , J 1 > 0 . Since λ ( 1 , 1 ) = λ ( 3 , 3 ) , then the first condition of (7) is reduced to
e 2 J β + 1 = e ( J + J 1 ) β + e 2 J 1 β .
From this, we easily obtain
e J β = 1 2 e J 1 β + 5 e 2 J 1 β 4 .
Hence, if (8) is satisfied, then the considered model possesses the disordered phase.
Clearly, the model is totally different from the Potts and SOS models.
Hence, in the sequel, we assume that (7) is satisfied. Therefore, one infers that the line u 1 = 1 in (6) is invariant, so the equation over this invariant line reduces to
u 2 = C 2 u 2 + 2 B B u 2 + B + C 2 k .
By denoting
X = C 2 u 2 2 B , a = 1 8 B 5 , b = C 2 ( B + C 2 ) 2 B 2 ,
we rewrite (9) as follows:
a X = 1 + X b + X 2 .
One can see that X > 0 , k 1 , a > 0 , and b > 0 . Then, through the use of [4] (Proposition 10.7), one finds the following:
Lemma 1
([24]).
(i)
If b k + 1 k 1 2 , then a solution to (11) is unique.
(ii)
If b > k + 1 k 1 2 , then there are ζ 1 ( b ) and ζ 2 ( b ) , such that 0 < ζ 2 < ζ 2 , and if ζ 1 < a < ζ 2 , then (11) has three solutions.
(iii)
If a = ζ 1 and a = ζ 2 , then (11) has two solutions. The quantity ζ 1 and ζ 2 are determined from the formula
ζ i ( b ) = 1 x i 1 + x i b + x i k , i = 1 , 2 ,
where x 1 and x 2 are solutions to the equation z 2 + ( 3 b ) z + b = 0 .
The condition (i) of Lemma 1 reduces to
C 2 ( B + C 2 ) 2 B 2 < k + 1 k 1 2
which is equivalent to
C 2 B 2 + C 2 B 2 k + 1 k 1 2 < 0
by solving the last one, we obtain the following fact.
Theorem 2.
Assume that, for the λ-model given by (5), the condition (7) is satisfied. Then, the following statements hold:
(i)
If
C 2 B < 1 2 1 + 8 k + 1 k 1 2 1 ,
then the disordered phase is unique;
(ii)
If
C 2 B > 1 2 1 + 8 k + 1 k 1 2 1 ,
then the phase transition occurs.

4. Three-Indexed Markov Chains of the Disordered Phase

A tree-indexed Markov chain is defined as follows. Suppose we are given a tree with vertices set V, and a probability measure ν and a transition matrix P = ( P i j ) i , j Φ on the single-site space, which is the finite set Φ = { 1 , 2 , , q } here. We can obtain a tree-indexed Markov chain X : V Φ by choosing X ( x 0 ) according to ν and choosing X ν , for each vertex v x 0 , using the transition probabilities given the value of its parent, independently of everything else (see Definition 12.2 in [6] for a detailed definition).
Now, let us consider the λ -model given by (5) with condition (7). Then, the model has the disordered phase, which corresponds to a solution ( 1 , 1 ) of (4). Thus, the transition stochastic matrix is given by
P = 1 2 B + C 2 C 1 B A B C 2 B A B C 1 .
It is easy to calculate that the matrix P has three eigenvalues: 1 and
α 1 = C 1 A 2 B + C 2 , α 2 = C 2 B 2 B + C 2 .
Using (7), one can see that
α 1 2 α 2 2 = 1 ( 2 B + C 2 ) 2 ( C 1 A ) 2 ( C 2 B ) 2 = 1 ( 2 B + C 2 ) 2 ( C 1 A C 2 + B ) ( C 1 A + C 2 B ) = 4 ( B A ) ( C 1 B ) ( 2 B + C 2 ) 2 .

4.1. Conditions of Non-Extremality

In this subsection, we are going to find the regions of the parameters, the disordered phase is not extreme in the set of all Gibbs measures (including the non-translation invariant ones).
It is known that a sufficient condition (Kesten–Stigum condition [26]) for the non-extremality of a Gibbs measure μ corresponding to the matrix P on the Cayley tree of order k 1 is that k | α m a x | 2 > 1 , where | α m a x | is the second largest (in absolute value) eigenvalue of P [22,26]. Furthermore, we are going to employ this condition for the non-extremity of the disordered phase.
Let us consider
α max = max { | α 1 | , | α 2 | } .
Through the use of (17), we have
α max = | α 1 | , i f ( B A ) ( C 1 B ) 0 | α 2 | , i f ( B A ) ( C 1 B ) < 0 ,
Hence, by checking the non-extremality condition, we arrive at the following result.
Theorem 3.
Assume that, for the λ-model given by (5), the condition (7) is satisfied. Suppose that one of the following conditions is held:
(i)
if ( B A ) ( C 1 B ) 0 and
| C 1 A | 2 B + C 2 > 1 k
(ii)
if ( B A ) ( C 1 B ) < 0 and
| C 2 B | 2 B + C 2 > 1 k ,
then the disordered phase is not extreme.

4.2. Conditions for Extremality

From the previous subsection, we infer the non-extremality conditions for the disordered phase. However, in the present subsection, we are going to find sufficient conditions for its extremality (or non-reconstructability in information-theoretic language [8,14,15,30]).
If, from the tree Γ k , one removes an arbitrary edge x 0 , x 1 = l L , then it is divided into two components Γ x 0 k and Γ x 1 k , each of which is called a semi-infinite Cayley tree or Cayley subtree.
Let us first give some necessary definitions from [30]. We consider finite complete subtrees T that are initial points of the Cayley tree Γ x 0 k . The boundary T of a subtree T consists of the neighbors which are on Γ x 0 k T . We identify subgraphs of T with their vertex sets and write E ( A ) for the edges within a subset A and A .
Following [30], there are two key ingredients which are the quantities κ and γ . Both of them are properties of the collection of Gibbs measures { μ T τ } , where the boundary condition τ is fixed and T ranges over all initial finite complete subtrees of Γ x 0 k . For a given subtree T of Γ x 0 k and a vertex x T , we write T x for the (maximal) subtree of T rooted at x. When x is not the root of T , let μ T x s denote the (finite-volume) Gibbs measure in which the parent of x has its spin fixed to s and the configuration on the bottom boundary of T x (i.e., on T x { parentof x } ) is specified by τ .
For two measures μ 1 and μ 2 on Ω , μ 1 μ 2 x denotes the variation distance between the projections of μ 1 and μ 2 onto the spin at x, i.e.,
μ 1 μ 2 x = 1 2 i { 1 , 2 , 3 } μ 1 ( σ ( x ) = i ) μ 2 ( σ ( x ) = i ) .
Let η x , s be the configuration η with the spin at x set to s .
Following [30], the quantities κ ( μ ) and κ ( μ ) are defined by
κ ( μ ) = sup x Γ k max x , s , s μ T x s μ T x s x ,
γ ( μ ) = sup A Γ k max μ A η y , s μ A η y , s x ,
where the maximum is taken over all boundary conditions η , all sites y A , all neighbors x A of y and all spins s , s { 1 , 2 , 3 } .
It is known that a sufficient condition for the extremality of the translation-invariant Gibbs measure is k κ ( μ ) γ ( μ ) < 1 [30] (Theorem 9.3).
In what follows, the measure μ is taken as the disordered phase; therefore, κ ( μ ) and γ ( μ ) are denoted by κ and γ .
Note that κ has the particularly simple form
κ ( μ ) = 1 2 max u { 1 , 2 , 3 } P i u P j u .
Hence, from (16), one has
κ = 1 2 ( 2 B + C 2 ) max | C 1 B | + | C 2 B | + | A B | , 2 | C 1 A |
We shall calculate γ .
γ = max μ A η y , 1 μ A η y , 2 x , μ A η y , 1 μ A η y , 3 x , μ A η y , 2 μ A η y , 3 x ,
where
μ A η y , i μ A η y , i x = 1 2 s { 1 , 2 , 3 } | μ A η y , 1 ( σ ( x ) = s ) μ A η y , 2 ( σ ( x ) = s ) | = 1 2 | P i , 1 P j , 1 | + | P i , 2 P j , 2 | + | P i , 3 P j , 3 | = 1 2 ( 2 B + C 2 ) | C 1 B | + | C 2 B | + | A B |
Hence, γ = κ . Hence, the extremality condition reduces to k κ 2 < 1 . By (18), we have the following result.
Theorem 4.
Assume that, for the λ-model given by (5), the condition (7) is satisfied. Then, the following statements hold:
(i)
If | C 1 B | + | C 2 B | + | A B | > 2 | C 1 A | and
| C 1 B | + | C 2 B | + | A B | 2 B + C 2 < 2 k ,
then the disordered phase is extreme.
(ii)
If | C 1 B | + | C 2 B | + | A B | 2 | C 1 A | and
| C 1 A | 2 B + C 2 < 1 k ,
then the disordered phase is extreme.
Remark 4.
We point out that if A = B , then by (7) we infer that C 1 = C 2 , which by Remark 1 the model reduces to the Potts model. The conditions of the extremality of the disordered phase of this model has been investigated in [8,14,29,31]. Such a condition from Theorem 4 is given as follows
| C 1 A | 2 A + C 1 < 1 k .
Due to Theorem 2, if
C 2 B < 1 2 1 + 8 k + 1 k 1 2 1
then the disordered phase is unique, and so it is extreme. Hence, we are interested in its extremality in the case of
C 2 B > 1 2 1 + 8 k + 1 k 1 2 1 .
where the phase transition exists. The last condition results in C 2 > B (if k 2 ).
Now, let us consider several other possibilities for the values of A , B , C 1 , C 2 .
Case I. Assume that B > A ; then, due to (7), one has C 1 C 2 = B A , which implies C 1 > C 2 > B > A . Then, ( B A ) ( C 1 B ) > 0 , which, from Theorem 3, means that if
C 1 A 2 B + C 2 > 1 k ,
the disordered phase is not extreme.
On the other hand, we have
| C 1 B | + | C 2 B | + | A B | = C 1 B + C 2 B + B A = B A + C 2 + C 2 + B A = 2 ( C 2 A )
which, together with
C 2 A < C 1 A
and (ii) Theorem 4, implies that the disordered phase is extreme if
C 1 A 2 B + C 2 < 1 k .
The last condition can be rewritten as follows by using (7)
C 1 A 2 B + C 2 = B 2 A + C 2 2 B + C 2 = C 2 / B 2 τ + 1 2 + C 2 / B < 1 k
where τ = A B . Hence, we obtain
C 2 B < ( 2 τ 1 ) k + 2 k 1 .
Therefore, one has the following result.
Theorem 5.
Assume that for the λ-model given by (5), the condition (7) is satisfied and C 2 > B > A . Then, the disordered phase is extreme if and only if
C 2 B < ( 2 τ 1 ) k + 2 k 1 ,
where τ = A B .
Case II. Assume that A > B ; then, we have C 1 < C 2 . However, this case has five subcases. We are going to consider all of them one by one.
Subcase (a). Let us suppose that C 1 < B < C 2 < A . Then, ( B A ) ( C 1 B ) > 0 , which from Theorem 3 means that if
A C 1 2 B + C 2 > 1 k
the disordered phase is not extreme.
On the other hand, we have
| C 1 B | + | C 2 B | + | A B | = B C 1 + C 2 B + A B = C 2 C 1 + A B = 2 ( A B ) .
Due to our assumption, we have B < C 1 , which yields A B < A C 1 ; therefore, from (ii) Theorem 4, we infer that the disordered phase is extreme if
A C 1 2 B + C 2 < 1 k .
Consequently, through (19), we obtain the following result:
Theorem 6.
Assume that, for the λ-model given by (5), the condition (7) is satisfied and C 1 < B < C 2 < A . Then, the disordered phase is extreme if and only if
A C 1 2 B + C 2 < 1 k .
Subcase (b). Let us suppose that C 1 < B < A < C 2 . Then, using the same argument, we obtain the same result as Theorem 6.
Subcase (c). Let us suppose that B < C 1 < C 2 < A . Then, ( B A ) ( C 1 B ) < 0 , which from Theorem 3 means that if
C 2 B 2 B + C 2 > 1 k ,
then the disordered phase is not extreme, which implies
C 2 B > k + 2 k 1 .
It is easy to find that
| C 1 B | + | C 2 B | + | A B | = 2 ( C 2 B ) .
Then, by using (7), one has
2 ( C 2 B ) 2 | C 1 A | = 2 ( C 2 B A + C 1 ) = 2 ( C 2 B A + B A + C 2 ) = 4 ( C 2 A ) < 0 .
This means that | C 2 B | < | C 1 A | which, due to (ii) Theorem 4, implies that the disordered phase is extreme if
A C 1 2 B + C 2 < 1 k .
This yields
C 2 B > ( 2 τ 1 ) k 2 k + 1 ,
where τ = A B .
Now, comparing (21) and the last one, we infer the following result:
Theorem 7.
Assume that for the λ-model given by (5), the condition (7) is satisfied and B < C 1 < C 2 < A . If
( 2 τ 1 ) k 2 k + 1 < C 2 B < k + 2 k 1 ,
the disordered phase is extreme. Here, as before, τ = A B .
Subcase (d). Let us suppose that B < C 1 < A < C 2 . Then, ( B A ) ( C 1 B ) < 0 , which from Theorem 3 means that if
C 2 B 2 B + C 2 > 1 k ,
the disordered phase is not extreme (21).
We have
| C 1 B | + | C 2 B | + | A B | = 2 ( C 2 B ) .
Then, by means of (7), one finds
| C 2 B | > | C 1 A |
which, due to (i) Theorem 4, results in the disordered phase being extreme if
C 2 B 2 B + C 2 < 1 k .
Hence, by (21), we obtain the following fact.
Theorem 8.
Assume that for the λ-model given by (5), the condition (7) is satisfied and B < C 1 < A < C 2 . Then, the disordered phase is extreme if and only if
C 2 B < k + 2 k 1 .
Subcase (e). Let us suppose that B < A < C 1 < C 2 . Then, using the same argument as subcase (d), we obtain the same result as Theorem 8.

Funding

The present work is supported by the UAEU UPAR Grant No. G00003447.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Acknowledgments

The author expresses thanks for support via the UAEU UPAR Grant No. G00003447.

Conflicts of Interest

The author declares that he has no conflict of interest.

References

  1. Cover, T.M.; Thomas, J.A. Elements of Information Theory; John Wiley and Sons: Hoboken, NJ, USA, 1991. [Google Scholar]
  2. Cavender, J. Taxonomy with condence. Math. BioSci. 1978, 40, 271–280. [Google Scholar] [CrossRef]
  3. Steel, M.; Charleston, M. Five surprising properties of parsimoniously colored trees. Bull. Math. Biol. 1995, 57, 367–375. [Google Scholar] [CrossRef]
  4. Preston, C. Gibbs States on Countable Sets; Cambridge University Press: London, UK, 1974. [Google Scholar]
  5. Spitzer, F. Markov random fields on an infinite tree. Ann. Probab. 1975, 3, 387–394. [Google Scholar] [CrossRef]
  6. Georgii, H.O. Gibbs Measures and Phase Transitions; Walter de Gruyter: Berlin, Germany, 2011. [Google Scholar]
  7. Sinai, Y.G. Theory of Phase Transitions: Rigorous Results; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
  8. Mossel, E. Survey: Information Flow on Trees. Graphs, morphisms and statistical physics. In DIMACS Series Discrete Mathematics and Theoretical Computer Science 63; American Mathematical Society: Providence, RI, USA, 2004; pp. 155–170. [Google Scholar]
  9. Bleher, P.M. Extremity of the disordered phase in the Ising model on the Bethe lattice. Commun. Math. Phys. 1990, 128, 411–419. [Google Scholar] [CrossRef]
  10. Evans, W.; Kenyon, C.; Peres, Y.; Schulman, L.J. Broadcasting on trees and the Ising Model. Ann. Appl. Probab. 2000, 10, 410–433. [Google Scholar] [CrossRef]
  11. Ioffe, D. A note on the extremality of the disordered state for the Ising model on the Bethe lattice. Lett. Math. Phys. 1996, 37, 137–143. [Google Scholar] [CrossRef]
  12. Wu, F.Y. The Potts model. Rev. Mod. Phys. 1982, 54, 235–268. [Google Scholar] [CrossRef]
  13. Baxter, R.J. Exactly Solved Models in Statistical Mechanics; Academic Press: New York, NY, USA, 1982. [Google Scholar]
  14. Mossel, E.; Peres, Y. Information ow on trees. Ann. Appl. Probab. 2003, 13, 817–844. [Google Scholar] [CrossRef]
  15. Sly, A. Reconstruction for the Potts model. Ann. Probab. 2011, 39, 1365–1406. [Google Scholar] [CrossRef]
  16. Ganikhodjaev, N.N. On pure phases of the three-state ferromagnetic Potts model on the second order Bethe lattice. Theor. Math. Phys. 1990, 85, 1125–1134. [Google Scholar] [CrossRef]
  17. Külske, C.; Rozikov, U.A. Fuzzy transformations and extremaity of Gibbs measures for the Potts model on a Cayley tree. Random Struct. Algorithms 2017, 50, 636–678. [Google Scholar] [CrossRef] [Green Version]
  18. Rozikov, U.A. Gibbs measures of Potts model on Cayley trees: A survey and applications. Rev. Math. Phys. 2021, 33, 2130007. [Google Scholar] [CrossRef]
  19. Mukhamedov, F. On factor associated with the unordered phase of λ-model on a Cayley tree. Rep. Math. Phys. 2004, 53, 1–18. [Google Scholar] [CrossRef]
  20. Rozikov, U.A. Description of limit Gibbs measures for λ-models on Bethe lattices. Sib. Math. J. 1998, 39, 427–435. [Google Scholar] [CrossRef]
  21. Kissel, S.; Külske, C.; Rozikov, U.A. Hard-core and soft-core Widom-Rowlinson models on Cayley trees. J. Stat. Mech. 2019, 2019, 043204. [Google Scholar] [CrossRef] [Green Version]
  22. Külske, C.; Rozikov, U.A. Extremality of translation-invariant phases for three-state SOS-model on the binary tree. J. Stat. Phys. 2015, 160, 659–680. [Google Scholar] [CrossRef]
  23. Rahmatullaev, M.M.; Rasulova, M.A. Extremality of translation-invariant Gibbs measures for the Potts-SOS model on the Cayley tree. J. Stat. Mech. 2021, 073201. [Google Scholar] [CrossRef]
  24. Mukhamedov, F.; Pah, C.H.; Jamil, H. Ground states and phase transition of the λ-model on the Cayley tree. Theor. Math. Phys. 2018, 193, 304–319. [Google Scholar] [CrossRef]
  25. Mukhamedov, F.; Pah, C.H.; Jamil, H.; Rahmatullaev, M. On ground states and phase Transition for λ-model with the competing Potts interactions on Cayley trees. Phys. A 2020, 549, 124184. [Google Scholar] [CrossRef]
  26. Kesten, H.; Stigum, B.P. Additional limit theorem for indecomposable multi-dimensional Galton-Watson processes. Ann. Math. Stat. 1966, 37, 1461–1481. [Google Scholar]
  27. Rozikov, U.A. Gibbs Measures on Cayley Trees; World Scientific: Singapore, 2013. [Google Scholar]
  28. Rozikov, U.A.; Suhov, Y.M. Gibbs measures for SOS models on Cayley tree. Infin. Dimens. Anal. Quantum Probab. Relat. Top. 2006, 9, 471–488. [Google Scholar] [CrossRef] [Green Version]
  29. Mossel, E. Reconstruction on trees: Beating the second eigenvalue. Ann. Appl. Probab. 2001, 11, 285–300. [Google Scholar] [CrossRef]
  30. Martinelli, F.; Sinclair, A.; Weitz, D. Fast mixing for independent sets, coloring and other models on trees. Random Struct. Algoritms 2007, 31, 134–172. [Google Scholar] [CrossRef] [Green Version]
  31. Rozikov, U.A.; Khakimov, R.R.M.; Khaidarov, F.K. Extremality of the Translation-Invariant Gibbs Measures for the Potts Model on the Cayley Tree. Theor. Math. Phys. 2018, 196, 1043–1058. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Mukhamedov, F. Extremality of Disordered Phase of λ-Model on Cayley Trees. Algorithms 2022, 15, 18. https://doi.org/10.3390/a15010018

AMA Style

Mukhamedov F. Extremality of Disordered Phase of λ-Model on Cayley Trees. Algorithms. 2022; 15(1):18. https://doi.org/10.3390/a15010018

Chicago/Turabian Style

Mukhamedov, Farrukh. 2022. "Extremality of Disordered Phase of λ-Model on Cayley Trees" Algorithms 15, no. 1: 18. https://doi.org/10.3390/a15010018

APA Style

Mukhamedov, F. (2022). Extremality of Disordered Phase of λ-Model on Cayley Trees. Algorithms, 15(1), 18. https://doi.org/10.3390/a15010018

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop