International Journal of Modern Physics C

CLUSTER MONTE CARLO STUDY OF THE QUANTUM XY MODEL IN TWO DIMENSIONS

Naoki Kawashima, Mark Jarrell, James E. Gubernatis

Published Jun 1, 1996• 3 citations

Abstract

The recent generalization of the Fortuin-Kasteleyn percolation representation and the Swendsen-Wang (SW) cluster algorithm is reviewed. The new representation yields cluster algorithm for the XYZ model with arbitrary magnitude of spins, with arbitrary anisotropies, and in any dimensions. The new algorithm often reduces computational autocorrelation times by several orders of magnitude. By using the new algorithm together with methods of Bayesian statistical inference, we obtained the dynamical structure factor S (k, ω) for the S =1/2 XY model in two dimensions.

DOI: 10.1142/s0129183196000387

Related papers

Virtual bond percolation for Ising cluster dynamics

Richard C. Brower, Pablo Tamayo

The Fortuin-Kasteleyn mapping between the Ising model and the site-bond correlated percolation model is shown to be only one of an infinite class of exact mappings. These new cluster representations are a result of "renormalized" percolation rules correlated to entire blocks of spins. For example these rules allow for percolation on "virtual" bonds between spins not present in the underlying Hamiltonian. As a consequence we can define new random cluster theories each with its own Monte Carlo cluster dynamics that exactly reproduce the Ising model. By tuning parameters on the critical percolation surface, it is demonstrated numerically that cluster algorithms can be formulated for the 2-d and 3-d Ising model that have smaller autocorrelations than the original Swendsen-Wang algorithm.

arXiv:hep-lat/9206007Physica A Statistical Mechanics and its ApplicationsApr 1, 19939 citations

Efficient simulation of the random-cluster model

Eren Metin Elçi, Martin Weigel

The simulation of spin models close to critical points of continuous phase transitions is heavily impeded by the occurrence of critical slowing down. A number of cluster algorithms, usually based on the Fortuin-Kasteleyn representation of the Potts model, and suitable generalizations for continuous-spin models have been used to increase simulation efficiency. The first algorithm making use of this representation, suggested by Sweeny in 1983, has not found widespread adoption due to problems in its implementation. However, it has been recently shown that it is indeed more efficient in reducing critical slowing down than the more well-known algorithm due to Swendsen and Wang. Here, we present an efficient implementation of Sweeny's approach for the random-cluster model using recent algorithmic advances in dynamic connectivity algorithms.

arXiv:1307.6647Physical Review ESep 16, 201317 citations

Cluster algorithms with empahsis on quantum spin systems

James E. Gubernatis, Naoki Kawashima

The purpose of this lecture is to discuss in detail the generalized approach of Kawashima and Gubernatis for the construction of cluster algorithms. We first present a brief refresher on the Monte Carlo method, describe the Swendsen-Wang algorithm, show how this algorithm follows from the Fortuin-Kastelyn transformation, and re=interpret this transformation in a form which is the basis of the generalized approach. We then derive the essential equations of the generalized approach. This derivation is remarkably simple if done from the viewpoint of probability theory, and the essential assumptions will be clearly stated. These assumptions are implicit in all useful cluster algorithms of which we are aware. They lead to a quite different perspective on cluster algorithms than found in the seminal works and in Ising model applications. Next, we illustrate how the generalized approach leads to a cluster algorithm for world-line quantum Monte Carlo simulations of Heisenberg models with S = 1/2. More succinctly, we also discuss the generalization of the Fortuin- Kasetelyn transformation to higher spin models and illustrate the essential steps for a S = 1 Heisenberg model. Finally, we summarize how to go beyond S = 1 to a general spin, XYZ model.

Oct 6, 19950 citations

Single-cluster dynamics for the random-cluster model

Youjin Deng, Xiaofeng Qian, Henk W. J. Blöte

We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer q, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents z(exp)=0.07 (1), 0.521 (7), and 1.007 (9) for q=2, 3, and 4, respectively. For noninteger q, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.

arXiv:0907.1711Physical Review ESep 30, 20095 citations

Comparison of cluster algorithms for two-dimensional Potts models

CLIVE F. BAILLIE, Paul David Coddington

We have measured the dynamical critical exponent z for the Swendsen-Wang and the Wolff cluster update algorithms, as well as a number of variants of these algorithms, for the q=2 and q=3 Potts models in two dimensions. We find that although the autocorrelation times differ considerably between algorithms, the critical exponents are the same. For q=2, we find that although the data are better fitted by a logarithmic increase in the autocorrelation time with lattice size, they are also consistent with a power law with exponent z\ensuremath{\approxeq}0.25, especially if there are non-negligible corrections to scaling.

Physical review. B, Condensed matterMay 1, 199174 citations

Dynamic Critical Behavior of Percolation Observables in the 2d Ising Model

Wanderson Gonçalves Wanzeller, G. Krein, T. Mendes

Abstract. We present preliminary results of our numerical study of the critical dynamics of percolation observables for the two-dimensional Ising model. We consider the (Monte-Carlo) short-time evolution of the system obtained with a local heat-bath method and with the global Swendsen-Wang algorithm. In both cases, we find qualitatively different dynamic behaviors for the magnetization and Ω, the order parameter of the percolation transition. This may have implications for the recent attempts to describe the dynamics of the QCD phase transition using cluster observables.

Jan 1, 20062 citations