Glauber dynamics
In statistical physics, Glauber dynamics[1] is a way to simulate the Ising model (a model of magnetism) on a computer. It is a type of Markov Chain Monte Carlo algorithm.[2]
The algorithm[]
In the Ising model, we have say N particles that can spin up (+1) or down (-1). Say the particles are on a 2D grid. We label each with an x and y coordinate. Glauber's algorithm becomes:[3]
- Choose a particle at random.
- Sum its four neighboring spins. .
- Compute the change in energy if the spin x, y were to flip. This is (see the Hamiltonian for the Ising model).
- Flip the spin with probability where T is the temperature.
- Display the new grid. Repeat the above N times.
History[]
The algorithm is named after Roy J. Glauber.[2]
Related pages[]
- Metropolis algorithm
- Ising model
- Monte Carlo algorithm
- Simulated annealing
References[]
- ^ "Roy J. Glauber "Time‐Dependent Statistics of the Ising Model"". Retrieved 2021-03-21.
- ^ a b "Glauber's dynamics | bit-player". Retrieved 2019-07-21.
- ^ "Jean-Charles Walter, Gerard Barkema "An introduction to Monte Carlo methods" | arxiv.org". Retrieved 2021-02-19.
Categories:
- Monte Carlo methods
- Spin models