Related papers: Critical Loop Gases and the Worm Algorithm

We present a novel technique for the determination of the topological susceptibility (related to the variance of the distribution of global topological charge) from lattice gauge theory simulations, based on maximum-likelihood analysis of…

Lorentz lattice gases (LLGs) are discrete-time transport models in which a point particle moves ballistically between lattice sites and is scattered by randomly placed, quenched local scatterers such as ``rotators'' or ``mirrors.'' Despite…

Quantum Monte Carlo algorithms based on a world-line representation such as the worm algorithm and the directed loop algorithm are among the most powerful numerical techniques for the simulation of non-frustrated spin models and of bosonic…

We compute the generating functions of a O(n) model (loop gas model) on a random lattice of any topology. On the disc and the cylinder, they were already known, and here we compute all the other topologies. We find that the generating…

The CP(N-1) model in 2D is an interesting toy model for 4D QCD as it possesses confinement, asymptotic freedom and a non-trivial vacuum structure. Due to the lower dimensionality and the absence of fermions, the computational cost for…

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…

A cluster update (the ``operator-loop'') is developed within the framework of a numerically exact quantum Monte Carlo method based on the power series expansion of exp(-BH) (stochastic series expansion). The method is generally applicable…

The class of random-cluster models is a unification of a variety of stochastic processes of significance for probability and statistical physics, including percolation, Ising, and Potts models; in addition, their study has impact on the…

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…

We perform Monte-Carlo measurements of two and three point functions of charged operators in the critical O(2) model in 3 dimensions. Our results are compatible with the predictions of the large charge superfluid effective field theory. To…

We discuss the inclusion of fermionic loops contributions in Numerical Stochastic Perturbation Theory for Lattice Gauge Theories. We show how the algorithm implementation is in principle straightforward and report on the status of the…

A detailed description is provided of a new Worm Algorithm, enabling the accurate computation of thermodynamic properties of quantum many-body systems in continuous space, at finite temperature. The algorithm is formulated within the…

In lattice quantum field theory studies, parameters defining the lattice theory must be tuned toward criticality to access continuum physics. Commonly used Markov chain Monte Carlo (MCMC) methods suffer from critical slowing down in this…

We study the behaviour of the monopole at finite temperature in the (2+1)-dimensional lattice gauge theory dual to the percolation model; by exploiting the correspondences to statistical systems, we possess powerful tools to evaluate the…

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…

World-line quantum Monte Carlo methods are reviewed with an emphasis on breakthroughs made in recent years. In particular, three algorithms -- the loop algorithm, the worm algorithm, and the directed-loop algorithm -- for updating…

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…

Simulations of strongly interacting lattice field theories are typically performed using Markov chain Monte Carlo algorithms. Therefore estimators of statistical errors must incorporate the effect of autocorrelations by integrating the…

We present a new Monte Carlo algorithm that produces results of high accuracy with reduced simulational effort. Independent random walks are performed (concurrently or serially) in different, restricted ranges of energy, and the resultant…

The jump-walking Monte-Carlo algorithm is revisited and updated to study the equilibrium properties of systems exhibiting quasi-ergodicity. It is designed for a single processing thread as opposed to currently predominant algorithms for…