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.

Revtex, 12 pages with 2 figures

References in corpus (1)

• Graphical Representations for Ising Systems in External Fields

Cited by in corpus (15)

• On the path integral representation for quantum spin models and its application to the quantum cavity method and to Monte Carlo simulations
• New algorithm and results for the three-dimensional random field Ising Model
• Critical behavior of the three-dimensional bond-diluted Ising spin glass: Finite-size scaling functions and Universality
• Cluster representations and the Wolff algorithm in arbitrary external fields
• Graphical Representations for Ising Systems in External Fields
• The Percolation Signature of the Spin Glass Transition
• Cluster update and recognition
• Cluster Percolation in the Two-Dimensional Ising Spin Glass
• Percolation of Fortuin-Kasteleyn clusters for the random-bond Ising model
• A variance reduced estimator of the connected two-point function in the presence of a broken Z_2 symmetry
• Thermal critical behavior and universality aspects of the three-dimensional random-field Ising model
• Massively parallel simulations for disordered systems
• Cluster percolation in the three-dimensional $\pm J$ random-bond Ising model
• Critical dynamics of two-replica cluster algorithms
• The interface tension in the improved Blume-Capel model