Related papers: Cluster Monte Carlo and dynamical scaling for long…
Within a general cluster framework, we discuss the loop-algorithm, a new type of cluster algorithm that reduces critical slowing down in vertex models and in quantum spin systems. We cover the example of the 6-vertex model in detail. For…
We report on the development of two dual worm constructions that lead to cluster algorithms for efficient and ergodic Monte Carlo simulations of frustrated Ising models with arbitrary two-spin interactions that extend up to third-neighbours…
We simulate single and multiple Ising models coupled to 2-d gravity using both the Swendsen-Wang and Wolff algorithms to update the spins. We study the integrated autocorrelation time and find that there is considerable critical slowing…
The cluster algorithm in the fully frustrated Ising model on the square lattice is essentially different from the ones used in other systems. Thus its better understanding is particularly important for finding new lines of development.…
We show that addition of Metropolis single spin-flips to the Wolff cluster flipping Monte Carlo procedure leads to a dramatic {\bf increase} in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the…
We introduce a Monte Carlo method, as a modification of existing cluster algorithms, which allows simulations directly on systems of infinite size, and for quantum models also at beta=infinity. All two-point functions can be obtained,…
Microscopic models of flocking and swarming takes in account large numbers of interacting individ- uals. Numerical resolution of large flocks implies huge computational costs. Typically for $N$ interacting individuals we have a cost of…
We study the spacial and temporal multiscale properties of complex systems. We present accelerated algorithms for dilute spin glasses and display explicitly their relation to the effective dynamics of specific collective degrees of freedom…
We consider a new formulation of the stochastic coupled cluster method in terms of the similarity transformed Hamiltonian. We show that improvement in the granularity with which the wavefunction is represented results in a reduction in the…
We present an extensive analysis of systematic deviations in Wolff cluster simulations of the critical Ising model, using random numbers generated by binary shift registers. We investigate how these deviations depend on the lattice size,…
We review the local Monte Carlo dynamics and Swendsen-Wang cluster algorithm. We introduce and analyze a new Monte Carlo dynamics known as transitional Monte Carlo. The transitional Monte Carlo algorithm samples energy probability…
We present an algorithm for Monte Carlo simulations of a nearest-neighbor spin ice model based on its cluster representation. To assess its performance, we estimate a relaxation time, and find that, in contrast to the Metropolis algorithm,…
To minimise systematic errors in Monte Carlo simulations of charged particles, long range electrostatic interactions have to be calculated accurately and efficiently. Standard approaches, such as Ewald summation or the naive application of…
We propose a cluster simulation algorithm for statistical ensembles with fixed order parameter. We use the tethered ensemble, which features Helmholtz's effective potential rather than Gibbs's free energy, and in which canonical averages…
We report the results of simulations of the Lebwohl-Lasher model of the nematic-isotropic transition using a new cluster Monte Carlo algorithm. The algorithm is a modification of the Wolff algorithm for spin systems, and greatly reduces…
Large deviations for additive path functionals of stochastic processes have attracted significant research interest, in particular in the context of stochastic particle systems and statistical physics. Efficient numerical `cloning'…
We formulate a novel technique for the detection of functional clusters in discrete event data. The advantage of this algorithm is that no prior knowledge of the number of functional groups is needed, as our procedure progressively combines…
A cluster Monte Carlo algorithm for the Ashkin-Teller (AT) model is constructed according to the guidelines of a general scheme for such algorithms. Its dynamical behaviour is tested for the square lattice AT model. We perform simulations…
Quantum spin systems with strong geometric restrictions give rise to rich quantum phases such as valence bond solids and spin liquid states. However, the geometric restrictions often hamper the application of sophisticated numerical…
Various kinetic Monte Carlo algorithms become inefficient when some of the population sizes in a system are large, which gives rise to a large number of reaction events per unit time. Here, we present a new acceleration algorithm based on…