The discussion focuses on implementing Wolff's algorithm for the Ising model in a 2-D lattice using FORTRAN. Key steps in the algorithm include randomly selecting a site, checking neighboring sites against a probability condition to form a cluster, and flipping the spins of all sites in the cluster. Participants confirm that only one cluster is processed at a time, and neighbors that initially fail the probability check can still be added later through different sites. This iterative process continues until no new sites are added to the cluster.
PREREQUISITESResearchers, physicists, and programmers interested in computational physics, particularly those working on simulations of the Ising model and cluster algorithms in FORTRAN.
deco said:Hi, I have the problema of implementing wolff's algorithm for ising model in 2-D lattice.
Has anyone ever done this algorithm in FORTRAN ?
I have questions of how to join the clusters.
Alexandre
ChaosCon343 said:The way I understand it, you only have one cluster at a time when using Wolff's algorithm. So in each iteration, you:
- Choose a site in your lattice at random
- Check all the neighbors of that site -- if the neighbors pass a probability condition, add them to the cluster.
- Check all the neighbors of the sites that just got added to the cluster. Repeat the probability proceedure.
- Continue until no sites get added to the cluster.
- Flip the spin of every site in the cluster.
Note that a neighbor that previously failed the probability check can get added to the cluster as a neighbor of a different site.