Graphical representations and cluster algorithms for critical points with fields
- 1 September 1998
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 58 (3) , 2749-2752
- https://doi.org/10.1103/physreve.58.2749
Abstract
A two-replica graphical representation and associated cluster algorithm are described that are 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. For this case, the dynamic exponent for the algorithm is measured to be less than 0.5.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Monte Carlo study of the random-field Ising modelPhysical Review E, 1996
- General cluster Monte Carlo dynamicsPhysical Review B, 1991
- Cluster Monte Carlo algorithms for random Ising modelsPhysica A: Statistical Mechanics and its Applications, 1991
- Cluster Monte Carlo algorithmsPhysica A: Statistical Mechanics and its Applications, 1990
- Collective Monte Carlo Updating for Spin SystemsPhysical Review Letters, 1989
- Low-temperature properties of theIsing spin glass in two dimensionsPhysical Review B, 1988
- Discontinuity of the magnetization in one-dimensional 1/ x?y 2 Ising and Potts modelsJournal of Statistical Physics, 1988
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987
- Replica Monte Carlo Simulation of Spin-GlassesPhysical Review Letters, 1986
- Clusters and Ising critical droplets: a renormalisation group approachJournal of Physics A: General Physics, 1980