Content deleted Content added
m Set upright of Fig |
m →References: HTTP to HTTPS for Brown University |
||
(13 intermediate revisions by 7 users not shown) | |||
Line 3:
{{Statistical mechanics|cTopic=Models}}
The '''Ising model''' (or '''Lenz–Ising model'''), named after the physicists [[Ernst Ising]] and [[Wilhelm Lenz]], is a [[mathematical models in physics|mathematical model]] of [[ferromagnetism]] in [[statistical mechanics]]. The model consists of [[discrete variables]] that represent [[Nuclear magnetic moment|magnetic dipole moments of atomic "spins"]] that can be in one of two states (+1 or −1). The spins are arranged in a [[Graph (abstract data type)|graph]], usually a [[lattice (group)|lattice]] (where the local structure repeats periodically in all directions), allowing each spin to interact with its neighbors. Neighboring spins that agree have a lower energy than those that disagree; the system tends to the lowest energy but heat disturbs this tendency, thus creating the possibility of different structural phases
The Ising model was invented by the physicist {{harvs|txt|authorlink=Wilhelm Lenz|first=Wilhelm|last=Lenz|year=1920}}, who gave it as a problem to his student Ernst Ising. The one-dimensional Ising model was solved by {{harvtxt|Ising|1925}} alone in his 1924 thesis;<ref>[http://www.hs-augsburg.de/~harsch/anglica/Chronology/20thC/Ising/isi_fm00.html Ernst Ising, ''Contribution to the Theory of Ferromagnetism'']</ref> 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 {{harvs|txt|authorlink=Lars Onsager|first=Lars |last=Onsager|year=1944}}. It is usually solved by a [[Transfer-matrix method (statistical mechanics)|transfer-matrix method]], although there exists a very simple approach relating the model to a non-interacting fermionic [[quantum field theory]].<ref>{{Cite journal |last1=Samuel |first1=Stuart|date=1980 |title=The use of anticommuting variable integrals in statistical mechanics. I. The computation of partition functions|url=https://doi.org/10.1063/1.524404 |journal=Journal of Mathematical Physics |language=en |volume=21|issue=12 |pages= 2806–2814 |doi=10.1063/1.524404|url-access=subscription }}</ref>
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 {{harvtxt|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 {{pslink|Ising model|applications|nopage=y}}.
Line 18:
<math display="block">H(\sigma) = -\sum_{\langle ij\rangle} J_{ij} \sigma_i \sigma_j - \mu \sum_j h_j \sigma_j,</math>
where the first sum is over pairs of adjacent spins (every pair is counted once). The notation <math>\langle ij\rangle</math> indicates that sites <math>i</math> and <math>j</math> are nearest neighbors. The [[magnetic moment]] is given by <math>\mu</math>. 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.<ref>See {{harvtxt|Baierlein|1999}}, Chapter 16.</ref> 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]] <math>\beta\geq0</math>: <math display="block">P_\beta(\sigma) = \frac{e^{-\beta H(\sigma)}}{Z_\beta},</math>
Line 68 ⟶ 70:
For the Ising model without an external field on a graph G, the Hamiltonian becomes the following sum over the graph edges E(G)
:<math>H(\sigma) = -\sum_{ij\in E(G)} J_{ij}\sigma_i\sigma_j</math>.
Here each vertex i of the graph is a spin site that takes a spin value <math>\sigma_i = \pm 1 </math>. A given spin configuration <math>\sigma</math> partitions the set of vertices <math>V(G)</math> into two <math>\sigma</math>-depended subsets, those with spin up <math>V^+</math> and those with spin down <math>V^-</math>. We denote by <math>\delta(V^+)</math> the <math>\sigma</math>-depended set of edges that connects the two complementary vertex subsets <math>V^+</math> and <math>V^-</math>. The ''size'' <math>\left|\delta(V^+)\right|</math> of the cut <math>\delta(V^+)</math> to [[bipartite graph|bipartite]] the weighted undirected graph G can be defined as
Line 131 ⟶ 133:
==== Simon-Lieb inequality ====
The Simon-Lieb inequality<ref>{{Cite journal |last=Simon |first=Barry |date=1980-10-01 |title=Correlation inequalities and the decay of correlations in ferromagnets |url=https://doi.org/10.1007/BF01982711 |journal=Communications in Mathematical Physics |language=en |volume=77 |issue=2 |pages=111–126 |doi=10.1007/BF01982711 |bibcode=1980CMaPh..77..111S |s2cid=17543488 |issn=1432-0916|url-access=subscription }}</ref> states that for any set <math>S</math> disconnecting <math>x</math> from <math>y</math> (e.g. the boundary of a box with <math>x</math> being inside the box and <math>y</math> being outside),
<math display="block">\langle \sigma_x \sigma_y \rangle \leq \sum_{z\in S} \langle \sigma_x \sigma_z \rangle \langle \sigma_z \sigma_y \rangle.</math>
Line 142 ⟶ 144:
==Historical significance==
While the laws of chemical bonding made it clear to nineteenth century chemists that atoms were real, among physicists the debate continued well into the early twentieth century. Atomists, notably [[James Clerk Maxwell]] and [[Ludwig Boltzmann]], applied Hamilton's formulation of Newton's laws to large systems, and found that the [[statistical mechanics|statistical behavior]] of the atoms correctly describes room temperature gases. But classical statistical mechanics did not account for all of the properties of liquids and solids, nor of gases at low temperature.
Once modern [[quantum mechanics]] was formulated, atomism was no longer in conflict with experiment, but this did not lead to a universal acceptance of statistical mechanics, which went beyond atomism. [[Josiah Willard Gibbs]] had given a complete formalism to reproduce the laws of thermodynamics from the laws of mechanics. But many faulty arguments survived from the 19th century, when statistical mechanics was considered dubious. The lapses in intuition mostly stemmed from the fact that the limit of an infinite statistical system has many [[Zero–one law|zero-one laws]] which are absent in finite systems: an infinitesimal change in a parameter can lead to big differences in the overall, aggregate behavior
===No phase transitions in finite volume===
Line 168:
<math display="block">M = \frac{1}{N} \sum_{i=1}^N \sigma_i.</math>
A bogus argument analogous to the argument in the last section now establishes that the ''average'' magnetization in the Ising model is always zero.
# Every configuration of spins has equal energy to the configuration with all spins flipped.
# So for every configuration with magnetization ''M'' there is a configuration with magnetization −''M'' with equal probability.
Line 247:
=== Artificial neural network ===
{{Main|Hopfield network}}
Ising model was instrumental in the development of the [[Hopfield network]]. The original Ising model is a model for equilibrium. [[Roy J. Glauber]] in 1963 studied the Ising model evolving in time, as a process towards thermal equilibrium ([[Glauber dynamics]]), adding in the component of time.<ref name=":222">{{cite journal |last1=Glauber |first1=Roy J. |date=February 1963 |title=Roy J. Glauber "Time-Dependent Statistics of the Ising Model" |url=https://aip.scitation.org/doi/abs/10.1063/1.1703954 |journal=Journal of Mathematical Physics |volume=4 |issue=2 |pages=294–307 |doi=10.1063/1.1703954 |access-date=2021-03-21|url-access=subscription }}</ref> (Kaoru Nakano, 1971)<ref name="Nakano1971">{{cite book |last1=Nakano |first1=Kaoru |title=Pattern Recognition and Machine Learning |date=1971 |isbn=978-1-4615-7568-9 |pages=172–186 |chapter=Learning Process in a Model of Associative Memory |doi=10.1007/978-1-4615-7566-5_15}}</ref><ref name="Nakano1972">{{cite journal |last1=Nakano |first1=Kaoru |date=1972 |title=Associatron-A Model of Associative Memory |journal=IEEE Transactions on Systems, Man, and Cybernetics |volume=SMC-2 |issue=3 |pages=380–388 |doi=10.1109/TSMC.1972.4309133}}</ref> and ([[Shun'ichi Amari]], 1972),<ref name="Amari19722">{{cite journal |last1=Amari |first1=Shun-Ichi |date=1972 |title=Learning patterns and pattern sequences by self-organizing nets of threshold elements |journal=IEEE Transactions |volume=C |issue=21 |pages=1197–1206}}</ref> proposed to modify the weights of an Ising model by [[Hebbian theory|Hebbian learning]] rule as a model of associative memory. The same idea was published by ({{ill|William A. Little (physicist)|lt=William A. Little|de|William A. Little}}, 1974),<ref name="little74">{{cite journal |last=Little |first=W. A. |year=1974 |title=The Existence of Persistent States in the Brain |journal=Mathematical Biosciences |volume=19 |issue=1–2 |pages=101–120 |doi=10.1016/0025-5564(74)90031-5}}</ref> who was cited by Hopfield in his 1982 paper.
The [[Spin glass#Sherrington–Kirkpatrick model|Sherrington–Kirkpatrick model]] of spin glass, published in 1975,<ref>{{Cite journal |last1=Sherrington |first1=David |last2=Kirkpatrick |first2=Scott |date=1975-12-29 |title=Solvable Model of a Spin-Glass |url=https://link.aps.org/doi/10.1103/PhysRevLett.35.1792 |journal=Physical Review Letters |volume=35 |issue=26 |pages=1792–1796 |bibcode=1975PhRvL..35.1792S |doi=10.1103/PhysRevLett.35.1792 |issn=0031-9007|url-access=subscription }}</ref> is the Hopfield network with random initialization. Sherrington and Kirkpatrick found that it is highly likely for the energy function of the SK model to have many local minima. In the 1982 paper, Hopfield applied this recently developed theory to study the Hopfield network with binary activation functions.<ref name="Hopfield1982">{{cite journal |last1=Hopfield |first1=J. J. |date=1982 |title=Neural networks and physical systems with emergent collective computational abilities |journal=Proceedings of the National Academy of Sciences |volume=79 |issue=8 |pages=2554–2558 |bibcode=1982PNAS...79.2554H |doi=10.1073/pnas.79.8.2554 |pmc=346238 |pmid=6953413 |doi-access=free}}</ref> In a 1984 paper he extended this to continuous activation functions.<ref name=":03">{{cite journal |last1=Hopfield |first1=J. J. |date=1984 |title=Neurons with graded response have collective computational properties like those of two-state neurons |journal=Proceedings of the National Academy of Sciences |volume=81 |issue=10 |pages=3088–3092 |bibcode=1984PNAS...81.3088H |doi=10.1073/pnas.81.10.3088 |pmc=345226 |pmid=6587342 |doi-access=free}}</ref> It became a standard model for the study of neural networks through statistical mechanics.<ref>{{Cite book |last1=Engel |first1=A. |title=Statistical mechanics of learning |last2=Broeck |first2=C. van den |date=2001 |publisher=Cambridge University Press |isbn=978-0-521-77307-2 |___location=Cambridge, UK; New York, NY}}</ref><ref>{{Cite journal |last1=Seung |first1=H. S. |last2=Sompolinsky |first2=H. |last3=Tishby |first3=N. |date=1992-04-01 |title=Statistical mechanics of learning from examples |url=https://journals.aps.org/pra/abstract/10.1103/PhysRevA.45.6056 |journal=Physical Review A |volume=45 |issue=8 |pages=6056–6091 |bibcode=1992PhRvA..45.6056S |doi=10.1103/PhysRevA.45.6056 |pmid=9907706|url-access=subscription }}</ref>
===Sea ice===
Line 258:
[[File:Cayley Tree Branch with Branching Ratio = 2.jpg|thumb|An Open Cayley Tree or Branch with Branching Ratio = 2 and k Generations]]
In order to investigate an Ising model with potential relevance for large (e.g. with <math>10^4</math> or <math>10^5</math> interactions per node) neural nets, at the suggestion of Krizan in 1979, {{harvtxt|Barth|1981}} obtained the exact analytical expression for the free energy of the Ising model on the closed [[Cayley tree]] (with an arbitrarily large branching ratio) for a zero-external magnetic field (in the thermodynamic limit) by applying the methodologies of {{harvtxt|Glasser|1970}} and {{harvtxt|Jellito|1979}}
<math display="block">-\beta f = \ln 2 + \frac{2\gamma}{(\gamma+1)} \ln (\cosh J) + \frac{\gamma(\gamma-1)}{(\gamma+1)} \sum_{i=2}^z\frac{1}{\gamma^i}\ln J_i (\tau) </math>
Line 307:
The [[Metropolis–Hastings algorithm]] is the most commonly used Monte Carlo algorithm to calculate Ising model estimations.<ref name="Newman" /> The algorithm first chooses ''selection probabilities'' ''g''(μ, ν), which represent the probability that state ν is selected by the algorithm out of all states, given that one is in state μ. It then uses acceptance probabilities ''A''(μ, ν) so that [[detailed balance]] is satisfied. If the new state ν is accepted, then we move to that state and repeat with selecting a new state and deciding to accept it. If ν is not accepted then we stay in μ. This process is repeated until some stopping criterion is met, which for the Ising model is often when the lattice becomes [[ferromagnetic]], meaning all of the sites point in the same direction.<ref name="Newman" />
When implementing the algorithm, one must ensure that ''g''(μ, ν) is selected such that [[ergodicity]] is met. In [[thermal equilibrium]] a system's energy only fluctuates within a small range.<ref name="Newman" /> This is the motivation behind the concept of '''single-spin-flip dynamics''',<ref name="pre0">{{cite journal|url= http://journals.aps.org/pre/abstract/10.1103/PhysRevE.90.032141|title= M. Suzen "Effective ergodicity in single-spin-flip dynamics"|journal= Physical Review E|date= 29 September 2014|volume= 90|issue= 3|page= 032141|doi= 10.1103/PhysRevE.90.032141|language=en-US|access-date=2022-08-09|last1= Süzen|first1= Mehmet|pmid= 25314429|arxiv= 1405.4497|bibcode= 2014PhRvE..90c2141S|s2cid= 118355454}}</ref> which states that in each transition, we will only change one of the spin sites on the lattice.<ref name="Newman" /> Furthermore, by using single- spin-flip dynamics, one can get from any state to any other state by flipping each site that differs between the two states one at a time. The maximum amount of change between the energy of the present state, ''H''<sub>μ</sub> and any possible new state's energy ''H''<sub>ν</sub> (using single-spin-flip dynamics) is 2''J'' between the spin we choose to "flip" to move to the new state and that spin's neighbor.<ref name="Newman" /> Thus, in a 1D Ising model, where each site has two neighbors (left and right), the maximum difference in energy would be 4''J''. Let ''c'' represent the ''lattice coordination number''; the number of nearest neighbors that any lattice site has. We assume that all sites have the same number of neighbors due to [[periodic boundary conditions]].<ref name="Newman" /> It is important to note that the Metropolis–Hastings algorithm does not perform well around the critical point due to critical slowing down. Other techniques such as multigrid methods, Niedermayer's algorithm, [[Swendsen–Wang algorithm]], or the [[Wolff algorithm]] are required in order to resolve the model near the critical point; a requirement for determining the critical exponents of the system.
Specifically for the Ising model and using single-spin-flip dynamics, one can establish the following. Since there are ''L'' total sites on the lattice, using single-spin-flip as the only way we transition to another state, we can see that there are a total of ''L'' new states ν from our present state μ. The algorithm assumes that the selection probabilities are equal to the ''L'' states: ''g''(μ, ν) = 1/''L''. [[Detailed balance]] tells us that the following equation must hold:
Line 448:
==== Renormalization ====
When there is no external field, we can derive a functional equation that <math>f(\beta, 0) = f(\beta)</math> satisfies using renormalization.<ref>{{Cite journal |last1=Maris |first1=Humphrey J. |last2=Kadanoff |first2=Leo P. |date=June 1978 |title=Teaching the renormalization group |url=https://pubs.aip.org/aapt/ajp/article/46/6/652-657/1045608 |journal=American Journal of Physics |language=en |volume=46 |issue=6 |pages=652–657 |doi=10.1119/1.11224 |bibcode=1978AmJPh..46..652M |issn=0002-9505|url-access=subscription }}</ref> Specifically, let <math>Z_N(\beta, J)</math> be the partition function with <math>N</math> sites. Now we have:<math display="block">Z_N(\beta, J) = \sum_{\sigma} e^{K \sigma_2(\sigma_1 + \sigma_3)}e^{K \sigma_4(\sigma_3 + \sigma_5)}\cdots</math>where <math>K := \beta J</math>. We sum over each of <math>\sigma_2, \sigma_4, \cdots</math>, to obtain<math display="block">Z_N(\beta, J) = \sum_{\sigma} (2\cosh(K(\sigma_1 + \sigma_3))) \cdot (2\cosh(K(\sigma_3 + \sigma_5))) \cdots</math>Now, since the cosh function is even, we can solve <math>Ae^{K'\sigma_1\sigma_3} = 2\cosh(K(\sigma_1+\sigma_3))</math> as <math display="inline">A = 2\sqrt{\cosh(2K)}, K' = \frac 12 \ln\cosh(2K)</math>. Now we have a self-similarity relation:<math display="block">\frac 1N \ln Z_N(K) = \frac 12 \ln\left(2\sqrt{\cosh(2K)}\right) + \frac 12 \frac{1}{N/2} \ln Z_{N/2}(K')</math>Taking the limit, we obtain<math display="block">f(\beta) = \frac 12 \ln\left(2\sqrt{\cosh(2K)}\right) + \frac 12 f(\beta')</math>where <math>\beta' J = \frac 12 \ln\cosh(2\beta J)</math>.
When <math>\beta</math> is small, we have <math>f(\beta)\approx \ln 2</math>, so we can numerically evaluate <math>f(\beta)</math> by iterating the functional equation until <math>K</math> is small.
Line 454:
=== Two dimensions ===
==== Onsager's exact solution ====
Line 472 ⟶ 471:
When the interaction energies <math>J_1</math>, <math>J_2</math> are both negative, the Ising model becomes an antiferromagnet. Since the square lattice is bi-partite, it is invariant under this change when the magnetic field <math>h=0</math>, so the free energy and critical temperature are the same for the antiferromagnetic case. For the triangular lattice, which is not bi-partite, the ferromagnetic and antiferromagnetic Ising model behave notably differently. Specifically, around a triangle, it is impossible to make all 3 spin-pairs antiparallel, so the antiferromagnetic Ising model cannot reach the minimal energy state. This is an example of [[geometric frustration]].
===== Onsager's formula for spontaneous magnetization =====
Line 564 ⟶ 496:
=== Four dimensions and above ===
{{main article|High-dimensional Ising model}}
In any dimension, the Ising model can be productively described by a locally varying [[mean field theory|mean field]]. The field is defined as the average spin value over a large region, but not so large so as to include the entire system. The field still has slow variations from point to point, as the averaging volume moves. These fluctuations in the field are described by a continuum field theory in the infinite system limit. The accuracy of this approximation improves as the dimension becomes larger. A deeper understanding of how the Ising model behaves, going beyond mean-field approximations, can be achieved using [[renormalization group]] methods.
==See also==
{{div col|colwidth=25em}}
* [[ANNNI model]]
* [[Binder parameter]]
* [[Boltzmann machine]]
* [[Construction of an irreducible Markov chain in the Ising model]]
* [[Geometrical frustration]]
* [[
* [[
* [[Kuramoto model]]
* [[Maximal evenness]]
* [[Order operator]]
* [[
* [[t-J model]]
* [[
* [[
{{div col end}}
==Footnotes==
Line 924 ⟶ 522:
==References==
{{Refbegin|30em}}
*{{Citation | last1=Barth | first1=P. F. |author-link1=Peter F. Barth | year=1981 | title= Cooperativity and the Transition Behavior of Large Neural Nets | pages=1–118 | journal= Master of Science Thesis | publisher= University of Vermont | ___location= Burlington |oclc=8231704 }}
*{{Citation | last1=Baxter | first1=Rodney J. | title=Exactly solved models in statistical mechanics | url=https://physics.anu.edu.au/theophys/baxter_book.php | publisher=Academic Press Inc. [Harcourt Brace Jovanovich Publishers] | ___location=London | isbn=978-0-12-083180-7 | mr=690578 | year=1982 }}
Line 941 ⟶ 539:
* {{Citation | last = Lenz | first = W. | author-link = Wilhelm Lenz | year = 1920 | title = Beiträge zum Verständnis der magnetischen Eigenschaften in festen Körpern | journal = Physikalische Zeitschrift | volume = 21 | pages = 613–615 }}
* Barry M. McCoy and Tai Tsun Wu (1973), ''The Two-Dimensional Ising Model''. Harvard University Press, Cambridge Massachusetts, {{ISBN|0-674-91440-6}}
*{{Citation | last1=Montroll | first1=Elliott W. | last2=Potts | first2=Renfrey B. | last3=Ward | first3=John C. | author-link3=John Clive Ward | title=Correlations and spontaneous magnetization of the two-dimensional Ising model | url=http://link.aip.org/link/?JMAPAQ%2F4%2F308%2F1 | doi=10.1063/1.1703955 | mr=0148406 | year=1963 | journal=[[Journal of Mathematical Physics]] | issn=0022-2488 | volume=4 | pages=308–322 | bibcode=1963JMP.....4..308M | issue=2 | url-status=dead | archive-url=https://archive.today/20130112095848/http://link.aip.org/link/?JMAPAQ/4/308/1 | archive-date=2013-01-12 | access-date=2009-10-25 | url-access=subscription }}
*{{Citation | last1=Onsager | first1=Lars | author-link1= Lars Onsager|title=Crystal statistics. I. A two-dimensional model with an order-disorder transition | doi=10.1103/PhysRev.65.117 | mr=0010315 | year=1944 | journal= Physical Review | series = Series II | volume=65 | pages=117–149|bibcode = 1944PhRv...65..117O | issue=3–4 }}
*{{Citation |last=Onsager |first=Lars |author-link=Lars Onsager|title=Discussion|journal=Supplemento al Nuovo Cimento | volume=6|page=261|year=1949}}
* John Palmer (2007), ''Planar Ising Correlations''. Birkhäuser, Boston, {{ISBN|978-0-8176-4248-8}}.
*{{Citation | last1=Istrail | first1=Sorin | title=Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing | chapter-url=
*{{Citation | last1=Yang | first1=C. N. | author-link1=C. N. Yang| title=The spontaneous magnetization of a two-dimensional Ising model | doi=10.1103/PhysRev.85.808 | mr=0051740 | year=1952 | journal=Physical Review | series = Series II | volume=85 | pages=808–816|bibcode = 1952PhRv...85..808Y | issue=5 }}
*{{Citation | last1=Glasser | first1=M. L. | year=1970 | title= Exact Partition Function for the Two-Dimensional Ising Model | journal=American Journal of Physics | volume=38 | issue=8 | pages=1033–1036 | doi=10.1119/1.1976530 | bibcode=1970AmJPh..38.1033G }}
Line 965 ⟶ 563:
* [http://ibiblio.org/e-notes/Perc/contents.htm Phase transitions on lattices]
* [http://www.sandia.gov/media/NewsRel/NR2000/ising.htm Three-dimensional proof for Ising Model impossible, Sandia researcher claims]
* [http://isingspinwebgl.com Interactive Monte Carlo simulation of the Ising, XY and Heisenberg models with 3D graphics (requires WebGL compatible browser)]
* [https://github.com/AmazaspShumik/BayesianML-MCMC/blob/master/Gibbs%20Ising%20Model/GibbsIsingModel.m Ising Model code ], [https://github.com/AmazaspShumik/BayesianML-MCMC/blob/master/Gibbs%20Ising%20Model/imageDenoisingExample.m image denoising example with Ising Model]
* [http://www.damtp.cam.ac.uk/user/tong/statphys/five.pdf David Tong's Lecture Notes ] provide a good introduction
|