Related papers: Simulating the All-Order Strong Coupling Expansion…
We prove rapid mixing of the Prokofiev-Svistunov (or worm) algorithm for the zero-field ferromagnetic Ising model, on all finite graphs and at all temperatures. As a corollary, we show how to rigorously construct simple and efficient…
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 design an irreversible worm algorithm for the zero-field ferromagnetic Ising model by using the lifting technique. We study the dynamic critical behavior of an energy estimator on both the complete graph and toroidal grids, and compare…
We present a dual geometrical worm algorithm for two-dimensional Ising models. The existence of such dual algorithms was first pointed out by Prokof'ev and Svistunov \cite{ProkofevClassical}. The algorithm is defined on the dual lattice and…
We prove rapid mixing of the worm process for the zero-field ferromagnetic Ising model, on all finite connected graphs, and at all temperatures. As a corollary, we obtain a fully-polynomial randomized approximation scheme for the Ising…
We develop a method to improve on the statistical errors for higher moments using machine learning techniques. We present here results for the dual representation of the Ising model with an external field, derived via the high temperature…
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…
We apply and test the recently proposed "extended scaling" scheme in an analysis of the magnetic susceptibility of Ising systems above the upper critical dimension. The data are obtained by Monte Carlo simulations using both the…
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…
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…
The loop gas approach to lattice field theory provides an alternative, geometrical description in terms of fluctuating loops. Statistical ensembles of random loops can be efficiently generated by Monte Carlo simulations using the worm…
Nonreversible Markov chains can outperform reversible chains in the Markov chain Monte Carlo method. Lifting is a versatile approach to introducing net stochastic flow in state space and constructing a nonreversible Markov chain. We present…
An equilibrium random surface multistep height model proposed in [Abraham and Newman, EPL, 86, 16002 (2009)] is studied using a variant of the worm algorithm. In one limit, the model reduces to the two-dimensional Ising model in the height…
The lattice regularized Schwinger model for one fermion flavor and in the strong coupling limit is studied through its equivalent representation as a restricted 8-vertex model. The Monte Carlo simulation on lattices with torus-topology is…
We study the dynamic critical behavior of the worm algorithm for the two- and three-dimensional Ising models, by Monte Carlo simulation. The autocorrelation functions exhibit an unusual three-time-scale behavior. As a practical matter, the…
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…
We report lattice simulations of $\phi^4_2$ and $O(N)\,\phi^4$ models, performed by means of a Monte Carlo method based on the all-order strong coupling expansion (worm algorithm). The investigation of the non-perturbative features of the…
The two-dimensional Ising model is studied by performing computer simulations with one of the Monte Carlo algorithms - the worm algorithm. The critical temperature T_C of the phase transition is calculated by the usage of 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…