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

World Scientific series in 20th century physics

CLUSTER ALGORITHM SPECIAL PURPOSE PROCESSOR

A. L. Talapov, Щур Лев Николаевич, V. B. Andreǐchenko, Vl.S. Dotsenko

Published Aug 1, 1996• 0 citations
Publisher

Abstract

We describe a Special Purpose Processor, realizing the Wolff algorithm in hardware, which is fast enough to study the critical behaviour of 2D Ising-like systems containing more than one million spins. The processor has been checked to produce correct results for a pure Ising model and for Ising model with random bonds. Its data also agree with the Nishimori exact results for spin glass. Only minor changes of the SPP design are necessary to increase the dimensionality and to take into account more complex systems such as Potts models.

DOI
10.1142/9789814317344_0029

Related papers

CLUSTER ALGORITHM SPECIAL PURPOSE PROCESSOR

A. L. Talapov, Щур Лев Николаевич, V. B. Andreǐchenko +1 more

We describe a Special Purpose Processor, realizing the Wolff algorithm in hardware, which is fast enough to study the critical behaviour of 2D Ising-like systems containing more than one million spins. The processor has been checked to produce correct results for a pure Ising model and for Ising model with random bonds. Its data also agree with the Nishimori exact results for spin glass. Only minor changes of the SPP design are necessary to increase the dimensionality and to take into account more complex systems such as Potts models.

Modern Physics Letters B•Aug 10, 1992•5 citations

THE CLUSTER PROCESSOR: NEW RESULTS

Henk W. J. Blöte, Щур Лев Николаевич, ANDREI L. TALAPOV

We present a progress report on the Cluster Processor, a special-purpose computer system for the Wolff simulation of the three-dimensional Ising model, including an analysis of simulation results obtained thus far. These results allow, within narrow error margins, a determination of the parameters describing the phase transition of the simple-cubic Ising model and its universality class. For an improved determination of the correction-to-scaling exponent, we include Monte Carlo data for systems with nearest-neighbor and third-neighbor interactions in the analysis.

arXiv:cond-mat/9912005•International Journal of Modern Physics C•Sep 1, 1999•81 citations

The critical region of the random-bond Ising model

A. L. Talapov, Щур Лев Николаевич

We describe results of the cluster algorithm special purpose processor simulations of the 2D Ising model with impurity bonds. We use large lattices with up to 10 6 spins to define critical temperature regions where both finite-size corrections and corrections to scaling are small. High-accuracy data unambiguously show an increase in the magnetization and magnetic susceptibility effective exponents beta and gamma , caused by impurities. The Mand chi -singularities become sharper, while the specific heat singularity is smoothed.

arXiv:hep-lat/9404011•Journal of Physics Condensed Matter•Oct 3, 1994•26 citations

The magnetization of the 3D Ising model

A. L. Talapov, Henk W. J. Blöte

We present highly accurate Monte Carlo results for simple cubic Ising lattices containing up to spins. These results were obtained by means of the Cluster Processor, a newly built special-purpose computer for the Wolff cluster simulation of the 3D Ising model. We find that the spontaneous magnetization M(t) is accurately described by , where , in a wide temperature range 0.0005 < t < 0.26. Any corrections to scaling with higher powers of t could not be resolved from our data, which implies that they are very small. The magnetization exponent is determined as . An analysis of the magnetization distribution near criticality yields a new determination of the critical point: , with a standard deviation of .

arXiv:cond-mat/9603013•Journal of Physics A Mathematical and General•Sep 7, 1996•202 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•7 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•4 citations
We describe a Special Purpose Processor, realizing the Wolff algorithm in hardware, which is fast enough to study the critical behaviour of 2D Ising-like systems containing more than one million spins. The processor has been checked to produce correct results for a pure Ising model and for Ising model with random bonds. Its data also agree with the Nishimori exact results for spin glass. Only minor changes of the SPP design are necessary to increase the dimensionality and to take into account more complex systems such as Potts models.
We describe a Special Purpose Processor, realizing the Wolff algorithm in hardware, which is fast enough to study the critical behaviour of 2D Ising-like systems containing more than one million spins. The processor has been checked to produce correct results for a pure Ising model and for Ising model with random bonds. Its data also agree with the Nishimori exact results for spin glass. Only minor changes of the SPP design are necessary to increase the dimensionality and to take into account more complex systems such as Potts models.
We present a progress report on the Cluster Processor, a special-purpose computer system for the Wolff simulation of the three-dimensional Ising model, including an analysis of simulation results obtained thus far. These results allow, within narrow error margins, a determination of the parameters describing the phase transition of the simple-cubic Ising model and its universality class. For an improved determination of the correction-to-scaling exponent, we include Monte Carlo data for systems with nearest-neighbor and third-neighbor interactions in the analysis.
We describe results of the cluster algorithm special purpose processor simulations of the 2D Ising model with impurity bonds. We use large lattices with up to 10 6 spins to define critical temperature regions where both finite-size corrections and corrections to scaling are small. High-accuracy data unambiguously show an increase in the magnetization and magnetic susceptibility effective exponents beta and gamma , caused by impurities. The Mand chi -singularities become sharper, while the specific heat singularity is smoothed.
We present highly accurate Monte Carlo results for simple cubic Ising lattices containing up to spins. These results were obtained by means of the Cluster Processor, a newly built special-purpose computer for the Wolff cluster simulation of the 3D Ising model. We find that the spontaneous magnetization M(t) is accurately described by , where , in a wide temperature range 0.0005 < t < 0.26. Any corrections to scaling with higher powers of t could not be resolved from our data, which implies that they are very small. The magnetization exponent is determined as . An analysis of the magnetization distribution near criticality yields a new determination of the critical point: , with a standard deviation of .
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).
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.