Related papers: Critical Loop Gases and the Worm Algorithm

We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…

Using a cluster-flipping Monte Carlo algorithm combined with a generalization of the histogram reweighting scheme of Ferrenberg and Swendsen, we have studied the equilibrium properties of the thermal random-field Ising model on a cubic…

The effect of different move sets on the folding kinetics of the Monte Carlo simulations is analysed based on the conformation-network and the temperature-dependent folding kinetics. A new scheme of implementing Metropolis algorithm is…

The critical behaviour of many spin models can be equivalently formulated as percolation of specific site-bond clusters. In the presence of an external magnetic field, such clusters remain well-defined and lead to a percolation transition,…

Properties of the self-adjusted Monte Carlo algorithm applied to 2d Ising ferromagnet are studied numerically. The endogenous feedback form expressed in terms of the instant running averages is suggested in order to generate a biased random…

Any spanning tree in a loopy interaction graph can be used for communicating the effect of the loopy interactions by introducing messages that are passed along the edges in the spanning tree. This defines an exact mapping of the problem on…

The development of Monte Carlo algorithms for generating gauge field configurations with dynamical fermions and methods for extracting the most information from ensembles are summarised.

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 consider recent progress in algorithms for generating gauge field configurations that include the dynamical effects of light fermions. We survey what has been achieved in recent state-of-the-art computations, and examine the trade-offs…

Hysteresis is studied for a two-dimensional, spin-1/2, nearest-neighbor, kinetic Ising ferromagnet in an oscillating field, using Monte Carlo simulations and analytical theory. Attention is focused on large systems and strong field…

The probability distribution of the order parameter is exploited in order to obtain the criticality of magnetic systems. Monte Carlo simulations have been employed by using single spin flip Metropolis algorithm aided by finite-size scaling…

We propose a Monte Carlo method which performs a random walk in energy space using cluster-like collective updates. By imposing that bond probabilities depend continuously on the microcanonical temperature, we obtain dynamic exponents close…

We review the development of update schemes for quantum lattice models simulated using world line quantum Monte Carlo algorithms. Starting from the Suzuki-Trotter mapping we discuss limitations of local update algorithms and highlight the…

The pivot algorithm is the most efficient known method for sampling polymer configurations for self-avoiding walks and related models. Here we introduce two recent improvements to an efficient binary tree implementation of the pivot…

We present a worm sampling method for calculating one- and two-particle Green's functions using continuous-time quantum Monte Carlo simulations in the hybridization expansion (CT-HYB). Instead of measuring Green's functions by removing…

We discuss recent algorithmic improvements in simulating finite temperature QCD on a lattice. In particular, the Rational Hybrid Monte Carlo(RHMC) algorithm is employed to generate lattice configurations for 2+1 flavor QCD. Unlike the…

Scattering processes are fundamental for understanding the structure of matter, yet simulating their real-time dynamics remains challenging for classical computers. Quantum computing and quantum-inspired methods offer a promising avenue for…

We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…

Monte Carlo simulations using entropic sampling to estimate the number of configurations of a given energy are a valuable alternative to traditional methods. We introduce {\it tomographic} entropic sampling, a scheme which uses multiple…

State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered…