相关论文: Cluster Algorithms For Anisotropic Quantum Spin Mo…

The two-component cold atom systems with anisotropic hopping amplitudes can be phenomenologically described by a two-dimensional Ising-XY coupled model with spatial anisotropy. At low temperatures, theoretical predictions [Phys. Rev. A 72,…

In online clustering problems, there is often a large amount of uncertainty over possible cluster assignments that cannot be resolved until more data are observed. This difficulty is compounded when clusters follow complex distributions, as…

We present a novel, generally applicable Monte Carlo algorithm for the simulation of fluid systems. Geometric transformations are used to identify clusters of particles in such a manner that every cluster move is accepted, irrespective of…

A continuous time cluster algorithm for two-level systems coupled to a dissipative bosonic bath is presented and applied to the sub-ohmic spin-Boson model. When the power s of the spectral function J(w) \propto w^s is smaller than 1/2, the…

In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…

A general scheme for devising efficient cluster dynamics proposed in a previous letter [Phys.Rev.Lett. 72, 1541 (1994)] is extensively discussed. In particular the strong connection among equilibrium properties of clusters and dynamic…

Time series clustering is an essential machine learning task with applications in many disciplines. While the majority of the methods focus on time series taking values on the real line, very few works consider time series defined on the…

Monte Carlo simulations are performed for the S = 1/2 XY and ferro- and antiferromagnetic Heisenberg model in two dimensions using the loop algorithm. Thermodynamic properties of all these models are investigated in wide temperature range.…

A cluster algorithm is presented for the simulation of the q-state Potts models in which the number of spins is conserved in each state. The algorithm constructs Fortuin-Kasteleyn cluster configurations from spin configurations, in a way…

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…

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…

Monte Carlo simulations have boosted the numerical study of several different physical systems and in particular, the canonical ensemble has been especially useful because of the existence of easy and efficient relaxation algorithms…

Coupled cluster theory is a vital cornerstone of electronic structure theory and is being applied to ever-larger systems. Stochastic approaches to quantum chemistry have grown in importance and offer compelling advantages over traditional…

Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for…

We demonstrate that the ``worm'' algorithm allows very effective and precise quantum Monte Carlo (QMC) simulations of spin systems in a magnetic field, and its auto-correlation time is rather insensitive to the value of H at low…

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 develop a biased Monte Carlo algorithm to measure probabilities of rare events in cluster-cluster aggregation for arbitrary collision kernels. Given a trajectory with a fixed number of collisions, the algorithm modifies both the waiting…

We discuss a new Monte Carlo algorithm for the simulation of complex fluids. This algorithm employs geometric operations to identify clusters of particles that can be moved in a rejection-free way. It is demonstrated that this geometric…

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 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,…