On the equivalence of the Ising model with a vertex problem?
ثبت نشده
چکیده
The planar Ising model in an external magnetic field and with multi-spin interactions is shown to be equivalent to a vertex problem. The equivalence can be extended to higher spins and higher dimensions. In a recent paper Malakis (1979) reported the proof of an equivalence between a certain staggered vertex model and a zero-field Ising model. The equivalence has since been extended (Malakis 1980) to a wider class of vertex problems on the square lattice. The purpose of this Letter is to point out that the result of Malakis (1979) is not new and, in fact, can be easily derived in a very general form to include the Ising model with non-zero magnetic field as well as other lattices. It can also be extended to higher spins and higher dimensions. In view of the rather elaborate effort required in Malakis' proof, it appears desirable to report on this development. It was first noted by Wu and Lin (1975) that the square lattice Ising model in a non-zero magnetic field is reducible to a staggered vertex model. This equivalence, of which the result of Malakis (1979) is a special case, has also been reported in Wu (1978). The derivation given by Wu and Lin (1975) is very simple. We now explore its extensions. Consider an even planar graph (or lattice) G which has an even number of edges incident at each vertex. Examples are the square, KagomC and triangular lattices. Since the faces of G are bipartite, we may shade one set of the faces as shown in figure 1. Consider next an Ising model whose spins are located at the shaded faces of G and whose interactions, including external magnetic field and possibly multi-spin interactions, are decomposable into sums over the vertices of G. Specifically, let v1 . . . , (+k be the spins surrounding a site of G. Then the Ising Hamiltonian 2 takes the form Under this circumstance, we have the following equivalence: the Ising model (1) is equivalent to a vertex model on G. The proof of this equivalence, which also serves to define the vertex model, is extremely simple. For a given spin configuration in the Ising model, encircle the (shaded) faces 'r Supported in part by NSF Grant No DMR 78-18808. 0305-4470/80/090303 + 03$01.50 @ 1980 The Institute of Physics L303 L304 Letter to the Editor
منابع مشابه
Symmetric Vertex Models on Planar Random Graphs
We discuss a 4-vertex model on an ensemble of 3-valent (Φ) planar random graphs, which has the effect of coupling the vertex model to 2D quantum gravity. The regular lattice equivalent of the model is the symmetric 8-vertex model on the honeycomb lattice, which can be mapped on to an Ising model in field, as was originally shown by Wu et.al. using generalised weak graph transformation technique...
متن کاملMagnetic Properties and Phase Transitions in a Spin-1 Random Transverse Ising Model on Simple Cubic Lattice
Within the effective-field theory with correlations (EFT), a transverse random field spin-1 Ising model on the simple cubic (z=6) lattice is studied. The phase diagrams, the behavior of critical points, transverse magnetization, internal energy, magnetic specific heat are obtained numerically and discussed for different values of p the concentration of the random transverse field.
متن کاملMagnetic Properties in a Spin-1 Random Transverse Ising Model on Square Lattice
In this paper we investigate the effect of a random transverse field, distributed according to a trimodal distribution, on the phase diagram and magnetic properties of a two-dimensional lattice (square with z=4), ferromagnetic Ising system consisting of magnetic atoms with spin-1. This study is done using the effectivefield theory (EFT) with correlations method. The equations are derived using...
متن کاملEight - vertex model and Ising model in a non - zero magnetic field : honeycomb lattice
The known equivalence of the honeycomb eight-vertex model with an Ising model in a non-zero magnetic field is derived via a direct mapping. Compared with a previous derivation which uses the generalised weak-graph transformation, the new method is simpler and more direct, and can be extended to other considerations. The eight-vertex model on the honeycomb lattice is a general lattice model play...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001