Ising Model
Sites on a lattice with
C.f. Quantum mechanics
In our thermodynamic models, we can transition between a gas and a liquid without a phase transition… how? The ising model elucidates how.
Often consider nearest neighbor interaction only:
Suppose
Suppose
Solve
Let
The high temperature has more symmetry than the low temperature since rotating perspective around the lattice looks the same at high temperature rather than at low temperature where rotating can be distinguished. High-temperature has the same symmetry as the Hamiltonian.
Heat Capacity, |
||
Magnetization, \(T\to T_C, T | ||
As you get lower temperature, regions of same spins start to appear.
1D
2D
3D
4D+
Exact solution:
1D. No transition
2D.
3D. For Ferromagnets. Fe:
3D.
4D+.
Higher spin models are called Potts models.
Approximate Solutions for Low Temperature
Low Temperature is when we have the majority of occupations in the ground state, elementary exitation, or really close.
For a 1D ground state, all the spins being aligned,
2 aligned states,
For a 2D system.
Consider a domain wall with some boundary through the middle region.
For edge cases, the energy difference is
For
A similar approach to calculating the Helmholtz free energy,
C.f. QM: Variational derivation of Mean Field Theory, MFT.
Then,
So, if you don’t have a total probability distribution, or not have one for one part, then you can compute an upper bound with what you do have.
Use independent particles (spin).
Improve MF approach, general idea: cluster approximation(s). Given a system, get a small ’core’ with a good ’exact’ solution. Solve surroundings in average way.
Can do this with dimensions, DMFT-Dynamical Mean Field Theory.
Example: Bethe Approximation.
1 spin. In MFT we have everything else as an averge. If we have a lattice we can model it with
Setup for Next Time
Exact solutions:
- Open chain:
. . So we get lots of products.
Since we have an open chain, you can start at the first or last chain,
To avoid loops,
Transfer Matrix Solution of One-Dimension Ising Model
Consider the transfer matrix solution to 1D ising model. For a ring arrangement.
Symmetrizing this
For
From the board:
So,
Calculate ensemble averages with a computer.
Monte Carlo
Ising model with
If we choose states randomly, we tend to not get our ensemble average since most states are roughly zero magnetization. As we get more samples, we get a narrower peak around zero and it will start to converge to zero magnetization. With the heatbath method we no longer need to calculate the probability (boltzman factor and normalization) distribution for random samples.
Heat Bath MC
Pick a spin in the lattice
4 | 4 |
2 | 3 |
0 | 2 |
-2 | 1 |
-4 | 0 |
Compute energy of spin
Set spin
Record
Repeat
Keep track of
Monte Carlo
Sampling: Estimate of
Choose configuration
Markov Chain
Definition: Sequence of configurations generated by a Markov step.
Definition of a Markov step: Generates configuration based on the previous step only, not any prior. No memory effects.
We can describe a Markov step by
, i.e. the system must go somewhere.- Accesibility Condition: for a given configuration you must be able to get any other configuration in a finite number of steps
- Detailed Balance:
. So, . For a Boltzman distribution (MB statistics), .
Let
Formulation in terms of vectors and matrices.
Proving the second one first, suppose
Proving the first one.
Suppose
Metropolis Monte Carlo
Situation: identical to heat-bath MC.
We can get the transition probability from probability distribution of initial and final states.
- Pick random spin
- Count how many neighbors are the same as the picked spin
Make a list
Number of spins after Number of spins before -4 8J 0 4 -2 4J 1 3 0 0 2 2 2 -4J 3 1 4 -8J 4 0 Metropolis Choice:
then we will flip the spin, otherwise flip with probability .Showing detailed balance: Case 1. \(E_{-}
Note: If you want to simulate a high-temperature system then it is best to use another algorithm (see Galuber) since this will lead to always flipping a random spin.
Markovian System that does not obey Detailed Balance
COMPUTATIONAL PROBLEM.
Assume we have 1000 indistinguishable bacteria, 500 green and 500 red. Every hour:
- Every bacteria divides
- Colorblind predator eats exactly 1000 bacteria
1001 possible states (0-1000 of one color).
Stationary state: 1/2 0 of 1 color and 1/2 1000 of 1 color,