Dual Monte Carlo and cluster algorithms

Journal Article · Wed Feb 01 04:00:00 EST 1995 · Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics; (United States)

DOI:https://doi.org/10.1103/PhysRevE.51.1547· OSTI ID:6640151

Kawashima, N; Gubernatis, J E ^[1]

---

1. Center for Nonlinear Studies and Theoretical Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States)

We discuss the development of cluster algorithms from the viewpoint of probability theory and not from the usual viewpoint of a particular model. From the viewpoint of probability theory, we detail the nature of a cluster algorithm, make explicit the assumptions embodied in all clusters of which we are aware, and define the construction of free-cluster algorithms. We also illustrate these procedures by rederiving the Swendsen-Wang algorithm, presenting the details of the loop algorithm for a worldline simulation of a quantum [ital S]=1/2 model, and proposing a free-cluster version of the Swendsen-Wang replica method for the random Ising model. How the principle of maximum entropy might be used to aid the construction of cluster algorithms is also discussed.

• OSTI ID: 6640151
• Journal Information: Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics; (United States), Journal Name: Physical Review. E, Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics; (United States) Vol. 51:2; ISSN 1063-651X; ISSN PLEEE8
• Country of Publication: United States
• Language: English

Related Subjects

661300* -- Other Aspects of Physical Science-- (1992-)
71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
ALGORITHMS
CALCULATION METHODS
COMPUTERIZED SIMULATION
CRYSTAL MODELS
DETAILED BALANCE PRINCIPLE
EQUILIBRIUM
INVARIANCE PRINCIPLES
ISING MODEL
MATHEMATICAL LOGIC
MATHEMATICAL MODELS
MONTE CARLO METHOD
PROBABILITY
SIMULATION
T INVARIANCE