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

arXiv:cond-mat/9709317 · Physical review. B, Condensed matter

Single-cluster algorithm for the site-bond-correlated Ising model

Paulo R. A. Campos, Roberto Nicolau Onody

Published Dec 1, 1997• 4 citations
arXivHTMLPDF

Abstract

We extend the Wolff algorithm to include correlated spin interactions in diluted magnetic systems. This algorithm is applied to study the site-bond-correlated Ising model on a two-dimensional square lattice. We use a finite-size scaling procedure to obtain the phase diagram in the temperature-concentration space. We also have verified that the autocorrelation time diminishes in the presence of dilution and correlation, showing that the Wolff algorithm performs even better in such situations.

DOI
10.1103/physrevb.56.14529

Related papers

Critical Dynamics Behavior of the Wolff Algorithm in the Site-Bond-Correlated Ising Model

Paulo R. A. Campos, Roberto Nicolau Onody

Here we apply the Wolff single-cluster algorithm to the site-bond-correlated Ising model and study its critical dynamical behavior. We have verified that the autocorrelation time diminishes in the presence of dilution and correlation, showing that the Wolff algorithm performs even better in such situations. The critical dynamical exponents are also estimated.

International Journal of Modern Physics C•Sep 1, 1998•0 citations

Comparison of cluster algorithms for the bond-diluted Ising model

Arnold H. Kole, G. T. Barkema, Lars Fritz

Monte Carlo cluster algorithms are popular for their efficiency in studying the Ising model near its critical temperature. We might expect that this efficiency extends to the bond-diluted Ising model. We show, however, that this is not always the case by comparing how the correlation times τ_{w} and τ_{sw} of the Wolff and Swendsen-Wang cluster algorithms scale as a function of the system size L when applied to the two-dimensional bond-diluted Ising model. We demonstrate that the Wolff algorithm suffers from a much longer correlation time than in the pure Ising model, caused by isolated (groups of) spins which are infrequently visited by the algorithm. With a simple argument we prove that these cause the correlation time τ_{w} to be bounded from below by L^{z_{w}} with a dynamical exponent z_{w}=γ/ν≈1.75 for a bond concentration p<1. Furthermore, we numerically show that this lower bound is actually taken for several values of p in the range 0.5<p<1. Moreover, we show that the Swendsen-Wang algorithm does not suffer from the same problem. Consequently, it has a much shorter correlation time, shorter than in the pure Ising model even. Numerically at p=0.6, we find that its dynamical exponent is z_{sw}=0.09(4).

arXiv:2107.08534•Physical review. E•Jan 31, 2022•4 citations

The influence of the Wolff cluster structure on the determination of the critical dynamic exponent

Paulo R. A. Campos, N.G.F. Demedeiros, Roberto Nicolau Onody

Recently we reported some interesting features of the Wolff algorithm behaviour when applied to the site-bond-correlated Ising model. Our main results were that a stronger correlation diminishes the autocorrelation time but it does not change or affect the critical dynamic exponent. In this work, we analyse the Wolff cluster structure and how it varies with the spatial correlation. The fractal dimensions are determined for several values of the magnetic atom concentration and spatial correlation, giving an estimation of the Wolff critical dynamic exponent.

Philosophical Magazine Letters•Jul 1, 1999•0 citations

Critical dynamics of cluster algorithms in the random-bond Ising model

Ulvi Kanbur, Zeynep Demir Vatansever

In the present work, we present an extensive Monte Carlo simulation study on the dynamical properties of the two-dimensional random-bond Ising model. The correlation time τ of the Swendsen-Wang and Wolff cluster algorithms is calculated at the critical point. The dynamic critical exponent z of both algorithms is also measured by using the numerical data for several lattice sizes up to L=512. It is found for both algorithms that the autocorrelation time decreases considerably and the critical slowing-down effect reduces upon the introduction of bond disorder. Additionally, simulations with the Metropolis algorithm are performed, and the critical slowing-down effect is observed to be more pronounced in the presence of disorder, confirming the previous findings in the literature. Moreover, the existence of the non-self-averaging property of the model is demonstrated by calculating the scaled form of the standard deviation of autocorrelation times. Finally, the critical exponent ratio of the magnetic susceptibility is estimated by using the average cluster size of the Wolff algorithm.

Physical review. E•Feb 28, 2024•2 citations

The influence of the Wolff's cluster structure on the determination of the critical dynamic exponent

Paulo R. A. Campos, N. G. F. de Medeiros, Roberto Nicolau Onody

Recently we reported some interesting features of the Wolff's algorithm behavior when applied to the site-bond-correlated Ising model.Our main results were that a stronger correlation diminishes the autocorrelation time but it does not change or affectthe critical dynamic exponent.In this paper, we analyse the Wolff's cluster structure and how it varies with the spatial correlation. The fractal dimensions are determined for several values of the magnetic atoms concentration and spacial correlation, giving an estimative of the critical dynamic exponent.

arXiv:cond-mat/9908151•Aug 10, 1999•0 citations

Random site-bond diluted system in the Ising model

Zhen‐Ya Li, Chuan‐Zhang Yang

In this paper, a random site-bond diluted Ising system on the square lattice is studied by the use of annealed model solutions of the corresponding decoration problem. The critical temperature and magnetization as functions of site and bond concentrations are calculated.

Philosophical Magazine B•Dec 1, 1985•2 citations
We extend the Wolff algorithm to include correlated spin interactions in diluted magnetic systems. This algorithm is applied to study the site-bond-correlated Ising model on a two-dimensional square lattice. We use a finite-size scaling procedure to obtain the phase diagram in the temperature-concentration space. We also have verified that the autocorrelation time diminishes in the presence of dilution and correlation, showing that the Wolff algorithm performs even better in such situations.
Monte Carlo cluster algorithms are popular for their efficiency in studying the Ising model near its critical temperature. We might expect that this efficiency extends to the bond-diluted Ising model. We show, however, that this is not always the case by comparing how the correlation times τ_{w} and τ_{sw} of the Wolff and Swendsen-Wang cluster algorithms scale as a function of the system size L when applied to the two-dimensional bond-diluted Ising model. We demonstrate that the Wolff algorithm suffers from a much longer correlation time than in the pure Ising model, caused by isolated (groups of) spins which are infrequently visited by the algorithm. With a simple argument we prove that these cause the correlation time τ_{w} to be bounded from below by L^{z_{w}} with a dynamical exponent z_{w}=γ/ν≈1.75 for a bond concentration p<1. Furthermore, we numerically show that this lower bound is actually taken for several values of p in the range 0.5<p<1. Moreover, we show that the Swendsen-Wang algorithm does not suffer from the same problem. Consequently, it has a much shorter correlation time, shorter than in the pure Ising model even. Numerically at p=0.6, we find that its dynamical exponent is z_{sw}=0.09(4).
Recently we reported some interesting features of the Wolff algorithm behaviour when applied to the site-bond-correlated Ising model. Our main results were that a stronger correlation diminishes the autocorrelation time but it does not change or affect the critical dynamic exponent. In this work, we analyse the Wolff cluster structure and how it varies with the spatial correlation. The fractal dimensions are determined for several values of the magnetic atom concentration and spatial correlation, giving an estimation of the Wolff critical dynamic exponent.
In the present work, we present an extensive Monte Carlo simulation study on the dynamical properties of the two-dimensional random-bond Ising model. The correlation time τ of the Swendsen-Wang and Wolff cluster algorithms is calculated at the critical point. The dynamic critical exponent z of both algorithms is also measured by using the numerical data for several lattice sizes up to L=512. It is found for both algorithms that the autocorrelation time decreases considerably and the critical slowing-down effect reduces upon the introduction of bond disorder. Additionally, simulations with the Metropolis algorithm are performed, and the critical slowing-down effect is observed to be more pronounced in the presence of disorder, confirming the previous findings in the literature. Moreover, the existence of the non-self-averaging property of the model is demonstrated by calculating the scaled form of the standard deviation of autocorrelation times. Finally, the critical exponent ratio of the magnetic susceptibility is estimated by using the average cluster size of the Wolff algorithm.
Recently we reported some interesting features of the Wolff's algorithm behavior when applied to the site-bond-correlated Ising model.Our main results were that a stronger correlation diminishes the autocorrelation time but it does not change or affectthe critical dynamic exponent.In this paper, we analyse the Wolff's cluster structure and how it varies with the spatial correlation. The fractal dimensions are determined for several values of the magnetic atoms concentration and spacial correlation, giving an estimative of the critical dynamic exponent.