Related papers: A worm algorithm for the fully-packed loop model
Fully packed loop models describe the statistics of closely packed nested polygons on the square lattice. Many exact results can be obtained for these models, even for finite geometries, using their close relationship to alternating-sign…
We introduce a generalized worldline model where the partition function is a sum over configurations of a conserved flux on a d-dimensional lattice. The weights for the configurations of the corresponding worldlines have factors living on…
The continuous imaginary-time quantum Monte Carlo method with the worm update algorithm is applied to explore the ground state properties of the spin-1/2 Heisenberg model with antiferromagnetic (AF) coupling $J>0$ and ferromagnetic (F)…
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…
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 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…
Highly frustrated spin systems represent a central and challenging problem in condensed mater physics. To this problem, we introduce an algorithm based on mixed projected entangled pair states (m-PEPS), which is a novel type of tensor…
We demonstrate that the ``worm'' algorithm allows very effective and precise quantum Monte Carlo (QMC) simulations of spin systems in a magnetic field, and its auto-correlation time is rather insensitive to the value of H at low…
The Hubbard model is an important tool to understand the electrical properties of various materials. More specifically, on the honeycomb lattice it is used to describe graphene predicting a quantum phase transition from a semimetal to a…
We present a lattice Monte Carlo algorithm based on the one originally proposed by Maggs and Rossetto for simulating electrostatic interactions in inhomogeneous dielectric media. The original algorithm is known to produce attractive…
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…
We apply the event-chain Monte Carlo algorithm to the three-dimensional ferromagnetic Heisenberg model. The algorithm is rejection-free and also realizes an irreversible Markov chain that satisfies global balance. The autocorrelation…
We present an adaptive algorithm which optimizes the statistical-mechanical ensemble in a generalized broad-histogram Monte Carlo simulation to maximize the system's rate of round trips in total energy. The scaling of the mean round-trip…
We present a study of the bend angle distribution of semiflexible polymers of short and intermediate lengths within the wormlike chain model. This enables us to calculate the elastic response of a stiff molecule to a bending moment. Our…
We study a classical Ising model on the honeycomb lattice with local two-body interactions and present strong evidence that at low temperature it realizes a higher-rank Coulomb liquid with fracton excitations. We show that the excitations…
While one-dimensional Markov processes are well understood, going to higher dimensions there are only a few analytically solved Ising-like models, in practice requiring to use relatively costly, uncontrollable and inaccurate Monte-Carlo…
We modified the recently proposed multicanonical MC algorithm for the case of a magnetic field driven order--order phase transition. We test this {\it multimagnetic} Monte Carlo algorithm for the D=2 Ising model at $\beta=0.5$ and simulate…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
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 study the attractive fermionic Hubbard model on a honeycomb lattice using determinantal quantum Monte Carlo simulations. By increasing the interaction strength U (relative to the hopping parameter t) at half-filling and zero temperature,…