Related papers: Lifted Worm Algorithm for the Ising Model
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…
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…
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…
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 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…
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 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 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…
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 apply a new updating algorithm scheme to investigate the critical behavior of the two-dimensional ferromagnetic Ising model on a triangular lattice with nearest neighbour interactions. The transition is examined by generating accurate…
We present a new family of zero-field Ising models over $N$ binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components and subsets of at most three vertices into a tree. The polynomial-time algorithm of…
We investigate the extension of the Prokof'ev-Svistunov worm algorithm to Wilson lattice fermions in an external scalar field. We effectively simulate by Monte Carlo the graphs contributing to the hopping expansion of the two-point function…
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…
The exact solution of the Ising model on the complete graph (CG) provides an important, though mean-field, insight for the theory of continuous phase transitions. Besides the original spin, the Ising model can be formulated in the…
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 new family of zero-field Ising models over N binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components along with subsets of at most three vertices into a tree. The polynomial time algorithm…
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 Prokof'ev Svistunov worm algorithm was originally developed for models with nearest neighbor interactions that in a high temperature expansion are mapped to systems of closed loops. In this work we present the surface worm algorithm…
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…
To perform any meaningful optimization task, power distribution operators need to know the topology and line impedances of their electric networks. Nevertheless, distribution grids currently lack a comprehensive metering infrastructure.…