Related papers: Cluster simulations of loop models on two-dimensio…
The phase diagram of the O(n) model, in particular the special case $n=0$, is studied by means of transfer-matrix calculations on the loop representation of the O(n) model. The model is defined on the square lattice; the loops are allowed…
We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices with up to 80,000 sites which are linked together according to the Voronoi/Delaunay prescription. In one set of…
We have simulated the three-dimensional Heisenberg model on simple cubic lattices, using the single-cluster Monte Carlo update algorithm. The expected pronounced reduction of critical slowing down at the phase transition is verified. This…
An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…
Probabilistic clustering models (or equivalently, mixture models) are basic building blocks in countless statistical models and involve latent random variables over discrete spaces. For these models, posterior inference methods can be…
An overview is given over the recently developed and now widely used Monte Carlo algorithms with reduced or eliminated critical slowing down. The basic techniques are overrelaxation, cluster algorithms and multigrid methods. With these…
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…
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…
For $n\in [-2,2]$ the $O(n)$ model on a random lattice has critical points to which a scaling behaviour characteristic of 2D gravity interacting with conformal matter fields with $c\in [-\infty,1]$ can be associated. Previously we have…
We solve the O(n) model, defined in terms of self- and mutually avoiding loops coexisting with voids, on a 3-simplex fractal lattice, using an exact real space renormalization group technique. As the density of voids is decreased, the model…
We study a percolation problem based on critical loop configurations of the O($n$) loop model on the honeycomb lattice. We define dual clusters as groups of sites on the dual triangular lattice that are not separated by a loop, and…
We study a model of dilute oriented loops on the square lattice, where each loop is compatible with a fixed, alternating orientation of the lattice edges. This implies that loop strands are not allowed to go straight at vertices, and…
We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents $\nu$ and…
We show that coarse graining arguments invented for the analysis of multi-spin systems on a randomly triangulated surface apply also to the O(n) model on a random lattice. These arguments imply that if the model has a critical point with…
A relation between the average length of loops and their free energy is obtained for a variety of O(n)-type models on two-dimensional lattices, by extending to finite temperatures a calculation due to Kast. We show that the (number)…
We present the loop algorithm, a new type of cluster algorithm that we recently introduced for the F model. Using the framework of Kandel and Domany, we show how to GENERALIZE the algorithm to the arrow flip symmetric 6 vertex model. We…
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 introduce linear probing hashing schemes that construct a hash table of size $n$, with constant load factor $\alpha$, on which the worst-case unsuccessful search time is asymptotically almost surely $O(\log \log n)$. The schemes employ…
The O(n) loop model on the honeycomb lattice with mixed ordinary and special boundary conditions is solved exactly by means of the Bethe ansatz. The calculation of the dominant finite-size corrections to the eigenspectrum yields the mixed…
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…