0% found this document useful (0 votes)
17 views2 pages

Listaising 2024

The document discusses several exercises related to path counting and the Ising model. Exercise I involves computing the cardinality of sets of non-backtracking paths on a lattice, and uses this to define generating functions related to vertical, horizontal edges in paths. Exercise II considers the Ising model on an infinite tree, proves properties of the partition function and magnetization, and analyzes the behavior of the model in different temperature regimes.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views2 pages

Listaising 2024

The document discusses several exercises related to path counting and the Ising model. Exercise I involves computing the cardinality of sets of non-backtracking paths on a lattice, and uses this to define generating functions related to vertical, horizontal edges in paths. Exercise II considers the Ising model on an infinite tree, proves properties of the partition function and magnetization, and analyzes the behavior of the model in different temperature regimes.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Exercise I: Back to walk counting, with an application in mind

Consider SN to be the set of non-backtracking path on Z2 starting from 0

SN := {(Sn )N
n=0 : S0 = 0, ∀n ∈ J1, N K : Sn ∼ Sn−1 , ∀n ∈ J2, N K, Sn 6= Sn−2 },
S∞
and define S := N =0 SN (S0 is a singleton which just contains the walk ending at 0 after 0 steps).

(1) Compute the cardinality of SN for any N > 0 and deduce from it the value (possibly infinite), for
each u ≥ 0 of X
F (u) := u|S| ,
S∈S

where |S| is the lenth of S (that is the value of N such that S ∈ SN ).

Let V (S) and H(S) be the number of vertical edges and horizontal edges used by S

V (S) := #{n ∈ J1, |S|K, Sn − Sn−1 = (0, ±1)},


H(S) := #{n ∈ J1, |S|K, Sn − Sn−1 = (±1, 0)}

(2) Given u, v > 0 compute the value of


X
G(u, v) := uV (S) v H(S) . (0.1)
S∈S

In particular give a necessary and sufficient condition on u and v to have G(u, v) < ∞.
Given Λ ⊂ Z2 we define
EΛv := {{x, y} ⊂ Z2 : {x, y} ∩ Λ 6= ∅ and x − y = (0, ±1)},
(0.2)
EΛh := {{x, y} ⊂ Z2 : {x, y} ∩ Λ 6= ∅ and x − y = (±1, 0)},

Given α, β > 0, adopting the convention that σx = +1 if x ∈


/ Λ, we define the anisotropic Ising model on
Λ with + boundary condition as the probability measure defined by ΩΛ by

1 α
P
{x,y}∈E v σx σy +β
P
σx σy
µ+
Λ,α,β (σ) := + e Λ {x,y}∈E h
Λ ,
ZΛ,α,β
P P
+
X α {x,y}∈E v σx σy +β {x,y}∈E h
σx σy
with ZΛ,α,β := e Λ Λ .
σ∈ΩΛ

(3) Adapting Peierls contour argument, show that

µ+
Λ,α,β (σ0 = −1) ≤ δ(α, β)

where δ(α, β) satisfies, for any α > 0,

lim δ(α, β) = 0.
β→∞

(this establishes in particular the non-uniqueness of Gibbs States for the anisotropic Ising model,
for β ≥ βc (α) where the threshold βc (α) is finite for every α > 0)

Hint: Start by deriving a bound for the the probability of a fixed contour γ to appear in the dual
graph, and use the previous question to control the probability of having a contour enclosing the
origin.
(4) (? ?) Using the current representation for the Ising model show that for any α > 0 there exists
β0 (α) such that for all β ≤ β0
lim hσ0 i+
Λ,α,β = 0.
|Λ|↑Zd

uV (S) v H(S) when S runs


P
Hint: Use a result about connected graph and try to bound from above S
over the set of walks that uses at most twice each edge in Zd .

Exercise II: The Ising model on a tree


Given d ≥ 2, consider T̃d be the infinite tree in which all vertices have degree d + 1 except the root
which has degree d. We let 0 denote the root. For x ∈ T̃d , we let |x| denote its distance from the root,
and consider Bn := {x ∈ T̃d : |x| ≤ n}, to be the ball of radius n centered on the root. We consider
Ωn := {−1, 1}Bn , and, given β ≥ 0 and h ∈ R consider the Ising model on T̃d with + boundary condition.
P P
β {x,y}⊂Bn σx σy + x∈Bn σx (h+d1{|x|=n} )
1
µ+
n,β,h (σ) := + e x∼y (0.3)
Zn,β
We admit that the measure µ+
n,β,h satisfies FKG and GKS (when h ≥ 0).

(1) Prove that


 d
+ +
Zn+1,β,h ≤ 2edβ cosh(h) Zn,β,h

and deduce from it that


1 +
F + (β, h) = lim log Zn,β
n→∞ |Bn |

exists.
+
(2) Setting m+ +
n (β, h) := hσ0 in,β,h show that mn (β, h) is decreasing in n and hence converges to a limit
+
m (β, h) when β → ∞.

(4) For h and β fixed, we define ϕ : [−1, 1] → [−1, 1] by

eh (1 + tanh(β)u)e−h (1tanh(β)u)
ϕ(u) := (0.4)
eh (1 + tanh(β)u) + e−h (1tanh(β)u

Show that
m+ +
n+1 (β, h) := ϕ(mn (β, h))

and
m+
0 (β, h) = ϕ(1).

(5) Deduce from the previous question that m+ (β, 0) > 0 if and only if d tanh(β) > 1.
(6) Letting m− (β, h) > 0 denote the limiting magnetization at the root for the model with − condition,
deduce from question (4) that there exists β0 > 0 such that m+ (β, h) = m− (β, h) for β ∈ [0, β0 )
and that for any h ∈ R
lim m+ (β, h) = − lim m− (β, h) = 1
β→∞ β→∞
+ −
(so that in particular m (β, h) and m (β, h) differ at low temperature).

You might also like