Related papers: Embedding Z(3) in SU(3)
We study a generalized clock model on the simple cubic lattice. The parameter of the model can be tuned such that the amplitude of the leading correction to scaling vanishes. In the main part of the study we simulate the model with $Z_8$…
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…
In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable…
A new algorithm for simulating compact U(1) lattice gauge theory in three dimensions is presented which is based on global changes in the configuration space. We show that this algorithm provides an effective way to extract partition…
We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the {\em loop algorithm}. The basic steps in constructing a…
We generalize the rejection-free event-chain Monte Carlo algorithm from many particle systems with pairwise interactions to systems with arbitrary three- or many-particle interactions. We introduce generalized lifting probabilities between…
We develop an extended framework for the hybrid Monte Carlo (HMC) algorithm in lattice gauge theory by embedding the $SU(N)$ group into the space of general complex matrices,$M_N(\mathbb{C})$. Auxiliary directions will be completely…
Monte Carlo algorithms, like the Swendsen-Wang and invaded-cluster, sample the Ising and Potts models asymptotically faster than single-spin Glauber dynamics do. Here, we generalize both algorithms to sample Potts lattice gauge theory by…
We consider dynamically constrained Monte-Carlo dynamics and show that this leads to the generation of long ranged effective interactions. This allows us to construct a local algorithm for the simulation of charged systems without ever…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…
Monte Carlo simulation using a cluster algorithm is used to compute the scaling part of the free energy for a three dimensional O(4) spin model. The results are relevant for analysis of lattice studies of high temperature QCD.
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 study the role of large clusters of center vortices in producing confinement in 3D Z(2) gauge theory. First, we modify each configuration of a Monte Carlo-generated ensemble in the confined phase by removing the largest cluster of center…
We describe an algorithm for the Rosenbluth Monte Carlo enumeration of clusters and lattice animals. The method may also be used to calculate associated properties such as moments or perimeter multiplicities of the clusters. The new scheme…
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,…
We construct an efficient cluster algorithm for ferromagnetic SU(N)-symmetric quantum spin systems. Such systems provide a new regularization for CP(N-1) models in the framework of D-theory, which is an alternative non-perturbative approach…
Finite mixture modelling is a popular method in the field of clustering and is beneficial largely due to its soft cluster membership probabilities. A common method for fitting finite mixture models is to employ spectral clustering, which…
The spin 3/2 fermion models with contact interactions have a {\it generic} SO(5) symmetry without any fine-tuning of parameters. Its physical consequences are discussed in both the continuum and lattice models. A Monte-Carlo algorithm free…
A new approximation hierarchy, called the LPSUB$m$ scheme, is described for the coupled cluster method (CCM). It is applicable to systems defined on a regular spatial lattice. We then apply it to two well-studied prototypical (spin-1/2…
We describe a generalized scheme for the probability-changing cluster (PCC) algorithm, based on the study of the finite-size scaling property of the correlation ratio, the ratio of the correlation functions with different distances. We…