Related papers: Critical Loop Gases and the Worm Algorithm

We study a class of loop models, parameterized by a continuously varying loop fugacity n, on the hydrogen-peroxide lattice, which is a three-dimensional cubic lattice of coordination number 3. For integer n > 0, these loop models provide…

An efficient algorithm is presented to simulate the O(N) loop model on the square lattice for arbitrary values of $N>0$. The scheme combines the worm algorithm with a new data structure to resolve both the problem of loop crossings and the…

We present a Markov-chain Monte Carlo algorithm of "worm"type that correctly simulates the O(n) loop model on any (finite and connected) bipartite cubic graph, for any real n>0, and any edge weight, including the fully-packed limit of…

We give an overview on recently accomplished successful generalizations of `worm' or loop gas simulation methods to O(N) and CP(N-1) sigma models and to simple fermion models. Beside the advantage of (practically) eliminated critical…

Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…

We exactly rewrite the Z(2) lattice gauge theory with standard plaquette action as a random surface model equivalent to the untruncated set of its strong coupling graphs. By extending the worm approach applied to spin models we simulate…

We apply a worm algorithm to simulate the quantum transverse-field Ising model in a path-integral representation of which the expansion basis is taken as the spin component along the external-field direction. In such a representation, a…

We study the critical region of the $O(2)\,\phi^4$ theory by means of Monte Carlo simulations on the lattice. In particular we determine the ratio $\Delta\langle\phi^2\rangle_c/g$ in order to estimate the first correction to the critical…

We present a Markov-chain Monte Carlo algorithm of worm type that correctly simulates the fully-packed loop model on the honeycomb lattice, and we prove that it is ergodic and has uniform stationary distribution. The fully-packed loop model…

The self-organized Monte Carlo simulations of 2D Ising ferromagnet on the square lattice are performed. The essence of devised simulation method is the artificial dynamics consisting of the single-spin-flip algorithm of Metropolis…

We derive the improved estimators for general interactions and employ these for the continuous-time quantum Monte Carlo method. Using a worm algorithm we show how measuring higher-ordered correlators leads to an improved high-frequency…

We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path integral representation of the partition function. The code can deal with…

Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating…

We investigate in some detail an alternative simulation strategy for lattice field theory based on the so-called worm algorithm introduced by Prokof'ev and Svistunov in 2001. It amounts to stochastically simulating the strong coupling…

The worm algorithm is a versatile technique in the Markov chain Monte Carlo method for both classical and quantum systems. The algorithm substantially alleviates critical slowing down and reduces the dynamic critical exponents of various…

The Fermi gas at unitarity is a particularly interesting system of cold atoms, being dilute and strongly interacting at the same time. It can be studied non-perturbatively with Monte Carlo methods, like the recently developed worm…

We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient…

We consider Monte Carlo algorithms for the simulation of charged lattice gases with purely local dynamics. We study the mobility of particles as a function of temperature and show that the poor mobility of particles at low temperatures is…

We study the fractal geometry of O($n$) loop configurations in two dimensions by means of scaling and a Monte Carlo method, and compare the results with predictions based on the Coulomb gas technique. The Monte Carlo algorithm is applicable…

A review of the Loop Algorithm, its generalizations, and its relation to some other Monte Carlo techniques is given. The loop algorithm is a Quantum Monte Carlo procedure which employs nonlocal changes of worldline configurations,…