Lably
Skip to content

Ising model

Mathematical model of ferromagnetism in statistical mechanics

  • 35 min read
  • 6 chapters

Related on Lably

Through Ferromagnetism, Phase transition and Graph (discrete mathematics)

The Ising model was invented by the physicist Wilhelm Lenz (1920), who gave it as a problem to his student Ernst Ising. The one-dimensional Ising model was solved by Ising (1925) alone in his 1924 thesis; it has no phase transition. The two-dimensional square-lattice Ising model is much harder and was only given an analytic description much later, by Lars Onsager (1944). It is usually solved by a transfer-matrix method, although there exists a very simple approach relating the model to a non-interacting fermionic quantum field theory.

In dimensions greater than four, the phase transition of the Ising model is described by mean-field theory. The Ising model for greater dimensions was also explored with respect to various tree topologies in the late 1970s, culminating in an exact solution of the zero-field, time-independent Barth (1981) model for closed Cayley trees of arbitrary branching ratio, and thereby, arbitrarily large dimensionality within tree branches. The solution to this model exhibited a new, unusual phase transition behavior, along with non-vanishing long-range and nearest-neighbor spin-spin correlations, deemed relevant to large neural networks as one of its possible applications.

The Ising problem without an external field can be equivalently formulated as a graph maximum cut (Max-Cut) problem that can be solved via combinatorial optimization.

Definition

Consider a set Λ of lattice sites, each with a set of adjacent sites (e.g. a graph) forming a d-dimensional lattice. For each lattice site k∈Λ there is a discrete variable σk such that σk∈{−1,+1}, representing the site's spin. A spin configuration, σ={σk}k∈Λ is an assignment of spin value to each lattice site.

For any two adjacent sites i,j∈Λ there is an interaction Jij. Also a site j∈Λ has an external magnetic field hj interacting with it. The energy of a configuration σ is given by the Hamiltonian function

H(σ)=−∑⟨ij⟩Jijσiσj−μ∑jhjσj,

where the first sum is over pairs of adjacent spins (every pair is counted once). The notation ⟨ij⟩ indicates that sites i and j are nearest neighbors. The magnetic moment is given by μ. Note that the sign in the second term of the Hamiltonian above should actually be positive because the electron's magnetic moment is antiparallel to its spin, but the negative term is used conventionally. The Ising Hamiltonian is an example of a pseudo-Boolean function; tools from the analysis of Boolean functions can be applied to describe and study it.

The configuration probability is given by the Boltzmann distribution with inverse temperature β≥0:

Pβ(σ)=e−βH(σ)Zβ,

where β=1/(kBT), and the normalization constant

Zβ=∑σe−βH(σ)

is the partition function. For a function f of the spins ("observable"), one denotes by

⟨f⟩β=∑σf(σ)Pβ(σ)

the expectation (mean) value of f.

The configuration probabilities Pβ(σ) represent the probability that (in equilibrium) the system is in a state with configuration σ.

Discussion

The minus sign on each term of the Hamiltonian function H(σ) is conventional. Using this sign convention, Ising models can be classified according to the sign of the interaction: if, for a pair i, j

The system is called ferromagnetic or antiferromagnetic if all interactions are ferromagnetic or all are antiferromagnetic. The original Ising models were ferromagnetic, and it is still often assumed that "Ising model" means a ferromagnetic Ising model.

In a ferromagnetic Ising model, spins desire to be aligned: the configurations in which adjacent spins are of the same sign have higher probability. In an antiferromagnetic model, adjacent spins tend to have opposite signs.

The sign convention of H(σ) also explains how a spin site j interacts with the external field. Namely, the spin site wants to line up with the external field. If:

  • hj>0, the spin site j desires to line up in the positive direction,
  • hj<0, the spin site j desires to line up in the negative direction,
  • hj=0, there is no external influence on the spin site.

Simplifications

Ising models are often examined without an external field interacting with the lattice, that is, h = 0 for all j in the lattice Λ. Using this simplification, the Hamiltonian becomes

H(σ)=−∑⟨ij⟩Jijσiσj.

When the external field is zero everywhere, h = 0, the Ising model is symmetric under switching the value of the spin in all the lattice sites; a nonzero field breaks this symmetry.

Another common simplification is to assume that all of the nearest neighbors ⟨ij⟩ have the same interaction strength. Then we can set Jij = J for all pairs i, j in Λ. In this case the Hamiltonian is further simplified to

H(σ)=−J∑⟨ij⟩σiσj.

Connection to graph maximum cut

A subset S of the vertex set V(G) of a weighted undirected graph G determines a cut of the graph G into S and its complementary subset G\S. The size of the cut is the sum of the weights of the edges between S and G\S. A maximum cut size is at least the size of any other cut, varying S.

For the Ising model without an external field on a graph G, the Hamiltonian becomes the following sum over the graph edges E(G)

H(σ)=−∑ij∈E(G)Jijσiσj.

Here each vertex i of the graph is a spin site that takes a spin value σi=±1. A given spin configuration σ partitions the set of vertices V(G) into two σ-depended subsets, those with spin up V+ and those with spin down V−. We denote by δ(V+) the σ-depended set of edges that connects the two complementary vertex subsets V+ and V−. The size |δ(V+)| of the cut δ(V+) to bipartite the weighted undirected graph G can be defined as

|δ(V+)|=12∑ij∈δ(V+)Wij,

where Wij denotes a weight of the edge ij and the scaling 1/2 is introduced to compensate for double counting the same weights Wij=Wji.

The identities

H(σ)=−∑ij∈E(V+)Jij−∑ij∈E(V−)Jij+∑ij∈δ(V+)Jij=−∑ij∈E(G)Jij+2∑ij∈δ(V+)Jij,

where the total sum in the first term does not depend on σ, imply that minimizing H(σ) in σ is equivalent to minimizing ∑ij∈δ(V+)Jij. Defining the edge weight Wij=−Jij thus turns the Ising problem without an external field into a graph Max-Cut problem maximizing the cut size |δ(V+)|, which is related to the Ising Hamiltonian as follows,

H(σ)=∑ij∈E(G)Wij−4|δ(V+)|.

Questions

A significant number of statistical questions to ask about this model are in the limit of large numbers of spins:

  • In a typical configuration, are most of the spins +1 or −1, or are they split equally?
  • If a spin at any given position i is 1, what is the probability that the spin at position j is also 1?
  • If β is changed, is there a phase transition?
  • On a lattice Λ, what is the fractal dimension of the shape of a large cluster of +1 spins?

Sign in to keep reading

5 more chapters are free with a Lably account.

More in Physics