Potts model

In statistical mechanics, the Potts model, a generalization of the Ising model, is a model of interacting spins on a crystalline lattice. By studying the Potts model, one may gain insight into the behaviour of ferromagnets and certain other phenomena of solid-state physics. The strength of the Potts model is not so much that it models these physical systems well; it is rather that the one-dimensional case is exactly solvable, and that it has a rich mathematical formulation that has been studied extensively.

The model is named after Renfrey Potts, who described the model near the end of his 1951 Ph.D. thesis. The model was related to the "planar Potts" or "clock model", which was suggested to him by his advisor, Cyril Domb. The four-state planar Potts model is sometimes known as the Ashkin–Teller model, after Julius Ashkin and Edward Teller, who considered an equivalent model in 1943.

The Potts model is related to, and generalized by, several other models, including the XY model, the Heisenberg model and the N-vector model. The infinite-range Potts model is known as the Kac model. When the spins are taken to interact in a non-Abelian manner, the model is related to the flux tube model, which is used to discuss confinement in quantum chromodynamics. Generalizations of the Potts model have also been used to model grain growth in metals and coarsening in foams. A further generalization of these methods by James Glazier and Francois Graner, known as the cellular Potts model, has been used to simulate static and kinetic phenomena in foam and biological morphogenesis.

Physical description

The Potts model consists of spins that are placed on a lattice; the lattice is usually taken to be a two-dimensional rectangular Euclidean lattice, but is often generalized to other dimensions or other lattices. Domb originally suggested that the spin take one of q possible values, distributed uniformly about the circle, at angles

\theta_n = \frac{2\pi n}{q},

where n = 1, ..., q and that the interaction Hamiltonian be given by

H_c = J_c\sum_{(i,j)} \cos \left( \theta_{s_i} - \theta_{s_j} \right)

with the sum running over the nearest neighbor pairs (i, j) over all lattice sites. The site colors s_i take on values in {1, ..., q}. Here, J_c is a coupling constant, determining the interaction strength. This model is now known as the vector Potts model or the clock model. Potts provided the location in two dimensions of the phase transition, for q = 3 and 4. In the limit as q → ∞, this becomes the XY model.

What is now known as the standard Potts model was suggested by Potts in the course of his study above, and uses a simpler Hamiltonian, given by:

H_p = -J_p \sum_{(i,j)}\delta(s_i,s_j) \,

where δ(s_i, s_j) is the Kronecker delta, which equals one whenever s_i = s_j and zero otherwise.

The q=2 standard Potts model is equivalent to the Ising model and the 2-state vector Potts model, with J_p = −2J_c. The q = 3 standard Potts model is equivalent to the three-state vector Potts model, with J_p = −(3/2)J_c.

A common generalization is to introduce an external "magnetic field" term h, and moving the parameters inside the sums and allowing them to vary across the model:

\beta H_g = - \beta \sum_{(i,j)}J_{ij} \delta(s_i,s_j) - \sum_i h_i s_i \,

where β = 1/kT the inverse temperature, k the Boltzmann constant and T the temperature. The summation may run over more distant neighbors on the lattice, or may in fact be an infinite-range force.

Different papers may adopt slightly different conventions, which can alter H and the associated partition function by additive or multiplicative constants.

Discussion

Despite its simplicity as a model of a physical system, the Potts model is useful as a model system for the study of phase transitions. For example, two dimensional lattices with J > 0 exhibit a first order transition if q > 4. When q ≤ 4 a continuous transition is observed, as in the Ising model where q = 2. Further use is found through the model's relation to percolation problems and the Tutte and chromatic polynomials found in combinatorics.

The model has a close relation to the Fortuin-Kasteleyn random cluster model, another model in statistical mechanics. Understanding this relationship has helped develop efficient Markov chain Monte Carlo methods for numerical exploration of the model at small q.

For integer values of q, q ≥ 3, the model displays the phenomenon of 'interfacial adsorption' with intriguing critical wetting properties when fixing opposite boundaries in two different states.

Measure theoretic description

The one dimensional Potts model may be expressed in terms of a subshift of finite type, and thus gains access to all of the mathematical techniques associated with this formalism. In particular, it can be solved exactly using the techniques of transfer operators. (However, Ernst Ising used combinatorial methods to solve the Ising model, which is the "ancestor" of the Potts model, in his 1924 PhD thesis). This section develops the mathematical formalism, based on measure theory, behind this solution.

While the example below is developed for the one-dimensional case, many of the arguments, and almost all of the notation, generalizes easily to any number of dimensions. Some of the formalism is also broad enough to handle related models, such as the XY model, the Heisenberg model and the N-vector model.

Topology of the space of states

Let Q = {1, ..., q} be a finite set of symbols, and let

Q^\mathbf{Z}=\{ s=(\ldots,s_{-1},s_0,s_1,\ldots) : s_k \in Q \; \forall k \in \mathbf{Z} \}

be the set of all bi-infinite strings of values from the set Q. This set is called a full shift. For defining the Potts model, either this whole space, or a certain subset of it, a subshift of finite type, may be used. Shifts get this name because there exists a natural operator on this space, the shift operator τ : Q^Z → Q^Z, acting as

\tau (s)_k = s_{k+1}

This set has a natural product topology; the base for this topology are the cylinder sets

C_m[\xi_0, \ldots, \xi_k]= \{s \in Q^\mathbf{Z} : s_m = \xi_0, \ldots ,s_{m+k} = \xi_k \}

that is, the set of all possible strings where k+1 spins match up exactly to a given, specific set of values ξ₀, ..., ξ_k. Explicit representations for the cylinder sets can be gotten by noting that the string of values corresponds to a q-adic number, and thus, intuitively, the product topology resembles that of the real number line.

Interaction energy

The interaction between the spins is then given by a continuous function V : Q^Z → R on this topology. Any continuous function will do; for example

V(s) = -J\delta(s_0,s_1)

will be seen to describe the interaction between nearest neighbors. Of course, different functions give different interactions; so a function of s₀, s₁ and s₂ will describe a next-nearest neighbor interaction. A function V gives interaction energy between a set of spins; it is not the Hamiltonian, but is used to build it. The argument to the function V is an element s ∈ Q^Z, that is, an infinite string of spins. In the above example, the function V just picked out two spins out of the infinite string: the values s₀ and s₁. In general, the function V may depend on some or all of the spins; currently, only those that depend on a finite number are exactly solvable.

Define the function H_n : Q^Z → R as

H_n(s)= \sum_{k=0}^n V(\tau^k s)

This function can be seen to consist of two parts: the self-energy of a configuration [s₀, s₁, ..., s_n] of spins, plus the interaction energy of this set and all the other spins in the lattice. The n → ∞ limit of this function is the Hamiltonian of the system; for finite n, these are sometimes called the finite state Hamiltonians.

Partition function and measure

The corresponding finite-state partition function is given by

Z_n(V) = \sum_{s_0,\ldots,s_n \in Q} \exp(-\beta H_n(C_0[s_0,s_1,\ldots,s_n]))

with C₀ being the cylinder sets defined above. Here, β = 1/kT, where k is Boltzmann's constant, and T is the temperature. It is very common in mathematical treatments to set β = 1, as it is easily regained by rescaling the interaction energy. This partition function is written as a function of the interaction V to emphasize that it is only a function of the interaction, and not of any specific configuration of spins. The partition function, together with the Hamiltonian, are used to define a measure on the Borel σ-algebra in the following way: The measure of a cylinder set, i.e. an element of the base, is given by

\mu (C_k[s_0,s_1,\ldots,s_n]) = \frac{1}{Z_n(V)} \exp(-\beta H_n (C_k[s_0,s_1,\ldots,s_n]))

One can then extend by countable additivity to the full σ-algebra. This measure is a probability measure; it gives the likelihood of a given configuration occurring in the configuration space Q^Z. By endowing the configuration space with a probability measure built from a Hamiltonian in this way, the configuration space turns into a canonical ensemble.

Most thermodynamic properties can be expressed directly in terms of the partition function. Thus, for example, the Helmholtz free energy is given by

A_n(V)=-kT \log Z_n(V)

Another important related quantity is the topological pressure, defined as

P(V) = \lim_{n\to\infty} \frac{1}{n} \log Z_n(V)

which will show up as the logarithm of the leading eigenvalue of the transfer operator of the solution.

Free field solution

The simplest model is the model where there is no interaction at all, and so V = c and H_n = c (with c constant and independent of any spin configuration). The partition function becomes

Z_n(c) = e^{-c\beta} \sum_{s_0,\ldots,s_n \in Q} 1

If all states are allowed, that is, the underlying set of states is given by a full shift, then the sum may be trivially evaluated as

Z_n(c) = e^{-c\beta} q^{n+1}

If neighboring spins are only allowed in certain specific configurations, then the state space is given by a subshift of finite type. The partition function may then be written as

Z_n(c) = e^{-c\beta} |\mbox{Fix}\, \tau^n| = e^{-c\beta} \mbox{Tr} A^n

where card is the cardinality or count of a set, and Fix is the set of fixed points of the iterated shift function:

\mbox{Fix}\, \tau^n = \{ s \in Q^\mathbf{Z} : \tau^n s = s \}

The q × q matrix A is the adjacency matrix specifying which neighboring spin values are allowed.

Interacting model

The simplest case of the interacting model is the Ising model, where the spin can only take on one of two values, s_n ∈ {−1, 1} and only nearest neighbor spins interact. The interaction potential is given by

V(\sigma) = -J_p s_0 s_1\,

This potential can be captured in a 2 × 2 matrix with matrix elements

M_{\sigma \sigma'} = \exp \left( \beta J_p \sigma \sigma' \right)

with the index σ, σ′ ∈ {−1, 1}. The partition function is then given by

Z_n(V) = \mbox{Tr}\, M^n

The general solution for an arbitrary number of spins, and an arbitrary finite-range interaction, is given by the same general form. In this case, the precise expression for the matrix M is a bit more complex.

The goal of solving a model such as the Potts model is to give an exact closed-form expression for the partition function and an expression for the Gibbs states or equilibrium states in the limit of n → ∞, the thermodynamic limit.

The Potts model in signal and image processing

The Potts model has applications in signal reconstruction. Assume that we are given noisy observation of a piecewise constant signal g in Rⁿ. To recover g from the noisy observation vector f in Rⁿ, one seeks a minimizer of the corresponding inverse problem, the L^p-Potts functional P_γ(u) which is defined by

P_\gamma(u) = \gamma \| \nabla u \|_0 + \| u-f\|_p^p = \gamma \# \{ i : u_i \neq u_{i+1} \} + \sum_{i=1}^n |u_i - f_i|^p

The jump penalty $\| \nabla u \|_0$ forces piecewise constant solutions and the data term $\| u-f\|_p^p$ couples the minimizing candidate u to the data f. The parameter γ > 0 controls the tradeoff between regularity and data fidelity. There are fast algorithms for the exact minimization of the L¹ and the L²-Potts functional (Friedrich, Kempe, Liebscher, Winkler, 2008).

In image processing, the Potts functional is related to the segmentation problem. However, in two dimensions the problem is NP-hard (Boykov, Veksler, Zabih, 2001).

References

Ashkin, Julius; Teller, Edward (1943). "Statistics of Two-Dimensional Lattices With Four Components". Phys. Rev. 64 (5–6): 178–184. Bibcode:1943PhRv...64..178A. doi:10.1103/PhysRev.64.178.
Graner, François; Glazier, James A. (1992). "Simulation of Biological Cell Sorting Using a Two-Dimensional Extended Potts Model". Phys. Rev. Lett. 69 (13): 2013–2016. Bibcode:1992PhRvL..69.2013G. doi:10.1103/PhysRevLett.69.2013.
Potts, Renfrey B. (1952). "Some Generalized Order-Disorder Transformations". Mathematical Proceedings 48 (1): 106–109. Bibcode:1952PCPS...48..106P. doi:10.1017/S0305004100027419.
Wu, Fa-Yueh (1982). "The Potts model". Rev. Mod. Phys. 54 (1): 235–268. Bibcode:1982RvMP...54..235W. doi:10.1103/RevModPhys.54.235.
Friedrich, F.; et., al. (2008). "Complexity Penalized M-Estimation". Journal of Computational and Graphical Statistics 64 (5–6): 201–224.
Boykov, Y.; et., al. (2001). "Fast approximate energy minimization via graph cuts". Pattern Analysis and Machine Intelligence, IEEE Transactions on: 1222–1239.
Selke, Walter; Huse, David A. (1983). "Interfacial adsorption in planar Potts models". Zeitschrift für Physik B 50 (2): 113–116. Bibcode:1983ZPhyB..50..113S. doi:10.1007/BF01304093.

External links

Haggard, Gary; Pearce, David J.; Royle, Gordon. "Code for efficiently computing Tutte, Chromatic and Flow Polynomials".

Stochastic processes

Discrete time	Bernoulli process Branching process Chinese restaurant process Galton–Watson process Independent and identically distributed random variables Markov chain Moran process Random walk Loop-erased Self-avoiding

Continuous time	Bessel process Birth–death process Brownian motion Bridge Excursion Fractional Geometric Meander Cauchy process Contact process Continuous-time random walk Cox process Diffusion process Empirical process Feller process Fleming–Viot process Gamma process Hunt process Interacting particle systems Itô diffusion Itô process Jump diffusion Jump process Lévy process Local time Markov additive process McKean–Vlasov process Ornstein–Uhlenbeck process Poisson process Compound Non-homogeneous Point process Schramm–Loewner evolution Semimartingale Sigma-martingale Stable process Superprocess Telegraph process Variance gamma process Wiener process Wiener sausage

Both	Branching process Gaussian process Hidden Markov model (HMM) Markov process Martingale Differences Local Sub- Super- Random dynamical system Regenerative process Renewal process White noise

Fields and other	Dirichlet process Gaussian random field Gibbs measure Hopfield model Ising model Potts model Boolean network Markov random field Percolation Pitman–Yor process Point process Cox Poisson Random field Random graph

Time series models	Autoregressive conditional heteroskedasticity (ARCH) model Autoregressive integrated moving average (ARIMA) model Autoregressive (AR) model Autoregressive–moving-average (ARMA) model Generalized autoregressive conditional heteroskedasticity (GARCH) model Moving-average (MA) model

Financial models	Black–Derman–Toy Black–Karasinski Black–Scholes Chen Constant elasticity of variance (CEV) Cox–Ingersoll–Ross (CIR) Garman–Kohlhagen Heath–Jarrow–Morton (HJM) Heston Ho–Lee Hull–White LIBOR market Rendleman–Bartter SABR volatility Vašíček Wilkie

Actuarial models	Bühlmann Cramér–Lundberg Risk process Sparre–Anderson

Queueing models	Bulk Fluid Generalized queueing network M/G/1 M/M/1 M/M/c

Properties	Càdlàg paths Continuous Continuous paths Ergodic Exchangeable Feller-continuous Gauss–Markov Markov Mixing Piecewise deterministic Predictable Progressively measurable Self-similar Stationary Time-reversible

Limit theorems	Central limit theorem Donsker's theorem Doob's martingale convergence theorems Ergodic theorem Fisher–Tippett–Gnedenko theorem Large deviation principle Law of large numbers (weak/strong) Law of the iterated logarithm Maximal ergodic theorem Sanov's theorem

Inequalities	Burkholder–Davis–Gundy Doob's martingale Kunita–Watanabe

Tools	Cameron–Martin formula Convergence of random variables Doléans-Dade exponential Doob decomposition theorem Doob–Meyer decomposition theorem Doob's optional stopping theorem Dynkin's formula Feynman–Kac formula Filtration Girsanov theorem Infinitesimal generator Itô integral Itô's lemma Kolmogorov continuity theorem Kolmogorov extension theorem Lévy–Prokhorov metric Malliavin calculus Martingale representation theorem Optional stopping theorem Prokhorov's theorem Quadratic variation Reflection principle Skorokhod integral Skorokhod's representation theorem Skorokhod space Snell envelope Stochastic differential equation Tanaka Stopping time Stratonovich integral Uniform integrability Usual hypotheses Wiener space Classical Abstract

Disciplines	Actuarial mathematics Econometrics Ergodic theory Extreme value theory (EVT) Large deviations theory Mathematical finance Mathematical statistics Probability theory Queueing theory Renewal theory Ruin theory Statistics Stochastic analysis Time series analysis Machine learning

List of topics Category

This article is issued from Wikipedia - version of the Friday, April 29, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.