相关论文: Parallel Invaded Cluster Algorithm for the Ising M…

The invaded cluster algorithm, a new method for simulating phase transitions, is described in detail. Theoretical, albeit nonrigorous, justification of the method is presented and the algorithm is applied to Potts models in two and three…

The invaded cluster algorithm is used to study the XY model in two and three dimensions up to sizes 2000^2 and 120^3 respectively. A soft spin O(2) model, in the same universality class as the 3D XY model, is also studied. The static…

We demonstrate that the invaded cluster algorithm, recently introduced by Machta et al, is a fast and reliable tool for determining the critical temperature and the magnetic critical exponent of periodic and aperiodic ferromagnetic Ising…

Simulations of the two-dimensional Ising and 3-state Potts models at their critical points are performed using the invaded cluster (IC) algorithm. It is argued that observables measured on a sub-lattice of size l should exhibit a crossover…

A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical…

This paper is devoted to computational algorithms designed to describe the classical Ising magnet in some specific cases when an additional macroscopic restriction in form of constant charge density exists in the system. We developed and…

The Invaded Cluster (IC) dynamics introduced by Machta et al. [Phys. Rev. Lett. 75 2792 (1995)] is extended to the fully frustrated Ising model on a square lattice. The properties of the dynamics which exhibits numerical evidence of…

We present highly accurate Monte Carlo results for simple cubic Ising lattices containing up to $256^3$ spins. These results were obtained by means of the Cluster Processor, a newly built special-purpose computer for the Wolff cluster…

We present a detailed study of the Equilibriumlike invaded cluster algorithm (EIC), recently proposed as an extension of the invaded cluster (IC) algorithm, designed to drive the system to criticality while still preserving the equilibrium…

A cluster weight Ising model is proposed by introducing an additional cluster weight in the partition function of the traditional Ising model. It is equivalent to the O($n$) loop model or $n$-component face cubic loop model on the…

In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel tempering algorithm with cluster updates and an…

We present an algorithm for cluster dynamics to efficiently simulate large systems on MIMD parallel computers with large numbers of processors. The method divides physical space into rectangular cells which are assigned to processors and…

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 cluster algorithm formulated in continuous (imaginary) time is presented for Ising models in a transverse field. It works directly with an infinite number of time-slices in the imaginary time direction, avoiding the necessity to take this…

A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields. Critical points are associated with the percolation threshold of the graphical…

We propose an extension of the nonequilibrium invaded cluster (IC) algorithm, which reestablishes a correct scaling of fluctuations at criticality and also self-adjusts to the critical temperature. We show that by introducing a single…

Analog Ising machines (IMs) occupy an increasingly prominent area of computer architecture research, offering high-quality and low latency/energy solutions to intractable computing tasks. However, IMs have a fixed capacity, with little to…

We propose a computational methodology based on a hierarchical cluster growth process to solve spin-3/2 Ising models efficiently. The method circumvents the exponential complexity (\(4^{N}\)) of the canonical ensemble partition function by…

The mixed spin 3- spin 3/2 Ising model has been simulated using cooling algorithm on cellular automaton (CA). The simulations have been made in the interval -6<=D<=6 for J=1 for the square lattices with periodic boundary conditions. The…

The dynamic critical behavior of the two-replica cluster algorithm is studied. Several versions of the algorithm are applied to the two-dimensional, square lattice Ising model with a staggered field. The dynamic exponent for the full…