Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Modern Physics C

CLUSTER METHODS FOR ISING SYSTEMS WITH FIELDS

Jonathan L. Machta

Published Dec 1, 1999• 3 citations
Publisher

Abstract

Efficient cluster algorithms for Ising systems with fields are described. Cluster are grown between two replicas of the system in the same field. As is the case for other successful cluster approaches, the critical point of the spin system coincides with the percolation threshold of the clusters. Applications are discussed.
DOI
10.1142/s0129183199001200

Related papers

Graphical representations and cluster algorithms for critical points with fields

Oliver Redner, Jonathan L. Machta, L. Chayes

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.

arXiv:cond-mat/9802063•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Sep 1, 1998•30 citations

Fixed-cluster acceleration algorithm for spin systems

Tanniemola B. Liverpool, Sharon C. Glotzer

A recently introduced cluster acceleration algorithm for spin models [J. Machta et al., Phys. Rev. Lett. 75, 2792 (1995)] based on invasion percolation is generalized to temperatures away from the critical point using concepts of random bond percolation. The generalized algorithm is equivalent to an "optimized" version of the Swendsen-Wang cluster algorithm [R. H. Swendsen and J. S. Wang, Phys. Rev. Lett. 58, 86 (1987)], and we demonstrate its success and speed at all temperatures for the $d=2$ Ising model. We argue that the previously discussed connection to self-organized criticality may be viewed as one limit of the fixed-cluster algorithm.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•May 1, 1996•15 citations

Invaded Cluster Algorithm for Equilibrium Critical Points

Jonathan L. Machta, Y. S. Choi, A. Lücke +2 more

A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical temperature and other observables in the critical region. The method is illustrated for the two- and three-dimensional Ising models. The algorithm equilibrates spin configurations much faster than the closely related Swendsen-Wang algorithm.

arXiv:cond-mat/9507094•Physical Review Letters•Oct 9, 1995•77 citations

AN IMPROVEMENT IN SELF-CONSISTENT CLUSTER METHOD FOR DETERMINING THE CRITICAL POINT IN ISING SPIN SYSTEM

Zheng Rui-lun, ZHAO FU-CHUAN, XIONG GUO-MING +1 more

We show the equivalence between the self-consistent cluster method (SCM) and the modified cluster field method (MCFM). Based on the SCM and MCFM, we propose a new method to- calculate critical points of Ising spin system, the method is demonstrated on the two-dimension square lattice.

Acta Physica Sinica•Jan 1, 1997•0 citations

ISING CLUSTER FRAGMENTATION AT THE CRITICAL POINT

Muyoung Heo, Mookyung Cheon, Iksoo Chang +1 more

The scaling law of Edwards et al., for cluster fragmentation of critical percolation clusters is not confirmed by analogous Monte Carlo simulations at the Curie point of the two-dimensional Ising model.

International Journal of Modern Physics C•Sep 1, 1999•2 citations

Critical clusters and efficient dynamics for frustrated spin models

V. Cataudella, Giancarlo Franzese, Mario Nicodemi +2 more

A general method to find, in a systematic way, efficient Monte Carlo cluster dynamics among the vast class of dynamics introduced by Kandel et al. [Phys. Rev. Lett. 65, 941 (1990)] is proposed. The method is successfully applied to a class of frustrated two-dimensional Ising systems. In the case of the fully frustrated model, we also find the intriguing result that critical clusters consist of self-avoiding walk at the \ensuremath{\theta} point.

Physical Review Letters•Mar 7, 1994•45 citations
A recently introduced cluster acceleration algorithm for spin models [J. Machta et al., Phys. Rev. Lett. 75, 2792 (1995)] based on invasion percolation is generalized to temperatures away from the critical point using concepts of random bond percolation. The generalized algorithm is equivalent to an "optimized" version of the Swendsen-Wang cluster algorithm [R. H. Swendsen and J. S. Wang, Phys. Rev. Lett. 58, 86 (1987)], and we demonstrate its success and speed at all temperatures for the d=2d=2d=2 Ising model. We argue that the previously discussed connection to self-organized criticality may be viewed as one limit of the fixed-cluster algorithm.