arXiv · cond-mat/9802063
Graphical representations and cluster algorithms for critical points with fields
Abstract
A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields. Critical points are associated with the percolation threshold of the graphical representation. Results from numerical simulations of the Ising model in a staggered field are presented. The dynamic exponent for the algorithm is measured to be less than 0.5.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Oliver Redner, Jon Machta, Lincoln Chayes. 1998-07-01. Graphical representations and cluster algorithms for critical points with fields. https://doi.org/10.1103/physreve.58.2749
Cite the original work for its findings. Save a collection to share your selection of sources.