Related papers: A comparison of cluster algorithms for the bond-di…
Many spin systems affected by critical slowing down can be efficiently simulated using cluster algorithms. Where such systems have long-range interactions, suitable formulations can additionally bring down the computational effort for each…
We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at $q=2$ is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic…
Monte Carlo simulations of the 1D Ising model with ferromagnetic interactions decaying with distance $r$ as $1/r^{1+\sigma}$ are performed by applying the Swendsen-Wang cluster algorithm with cumulative probabilities. The critical behavior…
We present the GPU calculation with the common unified device architecture (CUDA) for the Wolff single-cluster algorithm of the Ising model. Proposing an algorithm for a quasi-block synchronization, we realize the Wolff single-cluster Monte…
We study the correlation length of the two-dimensional Ising spin glass with a Gaussian distribution of interactions, using an efficient Monte Carlo algorithm proposed by Houdayer, that allows larger sizes and lower temperatures to be…
Using extensive Monte Carlo simulations we study aging properties of two disordered systems quenched below their critical point, namely the two-dimensional random-bond Ising model and the three-dimensional Edwards-Anderson Ising spin glass…
While the 3d Ising model has defied analytic solution, various numerical methods like Monte Carlo, MCRG and series expansion have provided precise information about the phase transition. Using Monte Carlo simulation that employs the Wolff…
In this work we have calculated the dynamic critical exponent $z$ for 2-, 3- and 4-dimensional Ising models using the Wolff's algorithm through dynamic finite size scaling. We have studied time evolution of the average cluster size, the…
Wang-Landau simulations offer the possibility to integrate explicitly over a collective coordinate and stochastically over the remainder of configuration space. We propose to choose the so-called "slow mode", which is responsible for large…
We present cluster Monte Carlo algorithms for the $XYZ$ quantum spin models. In the special case of $S=1/2$, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study the $S=1/2$ $XY$ model in…
The effect of the correlations in the diluteness pattern in the systems with non-integral dimensionality, on $\nu=\frac{4}{5}$ superdiffusion process is considered in this paper. These spatial correlations have proved to be very effective…
Inspired by the multicanonical approach to simulations of first-order phase transitions we propose for $q$-state Potts models a combination of cluster updates with reweighting of the bond configurations in the…
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 non-integer values $q>1$. Its results…
An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…
A comparison between single-cluster and single-spin algorithms is made for the Ising model in 2 and 3 dimensions. We compare the amount of computer time needed to achieve a given level of statistical accuracy, rather than the speed in terms…
We simulated the fourier transform of the correlation function of the Ising model in two and three dimensions using a single cluster algorithm with improved estimators. The simulations are in agreement with series expansion and the…
We discuss the development of cluster algorithms from the viewpoint of probability theory and not from the usual viewpoint of a particular model. By using the perspective of probability theory, we detail the nature of a cluster algorithm,…
We investigate and contrast, via the Wang-Landau (WL) algorithm, the effects of quenched bond randomness on the self-averaging properties of two Ising spin models in 2d. The random bond version of the superantiferromagnetic (SAF) square…
The method for calculation of the correlation functions of the Ising-type systems with short-range interaction and with arbitrary value of spin is developed within cluster approximation. For the Ising model (spin $S^z=\pm1$) the expressions…