Related papers: Generalized cluster algorithms for Potts lattice g…
The dynamic behavior of cluster algorithms is analyzed in the classical mean field limit. Rigorous analytical results below $T_c$ establish that the dynamic exponent has the value $z_{sw}=1$ for the Swendsen-Wang algorithm and $z_{uw}=0$…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
We consider spin systems on the integer lattice graph $\mathbb{Z}^d$ with nearest-neighbor interactions. We develop a combinatorial framework for establishing that exponential decay with distance of spin correlations, specifically the…
Generalizing the mapping between the Potts model with nearest neighbor interaction and six vertex model, we build a family of "fused Potts models" related to the spin $k/2$ ${\rm U}_{q}{\rm su}(2)$ invariant vertex model and quantum spin…
Starting from a Cluster Variational Method, and inspired by the correctness of the paramagnetic Ansatz (at high temperatures in general, and at any temperature in the 2D Edwards-Anderson model) we propose a novel message passing algorithm…
Bridging algorithms are global Monte Carlo moves which allow for an efficient sampling of single polymer chains. In this manuscript we discuss the adaptation of three bridging algorithms from lattice to continuum models, and give details on…
I present a cluster Monte Carlo algorithm that gives direct access to the interface free energy of Ising models. The basic idea is to simulate an ensemble that consists of both configurations with periodic and with antiperiodic boundary…
We show that addition of Metropolis single spin-flips to the Wolff cluster flipping Monte Carlo procedure leads to a dramatic {\bf increase} in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the…
We present the GPU calculation with the common unified device architecture (CUDA) for the Swendsen-Wang multi-cluster algorithm of two-dimensional classical spin systems. We adjust the two connected component labeling algorithms recently…
We propose a formally valid machine-learning-assisted global proposal mechanism for Monte Carlo sampling in lattice gauge theory. The construction is based on a coupling-flow update on the SU(2) lattice-link manifold, in which active links…
Variational minimization of tensor network states enables the exploration of low energy states of lattice gauge theories. However, the exact numerical evaluation of high-dimensional tensor network states remains challenging in general. In…
We present a consensus Monte Carlo algorithm that scales existing Bayesian nonparametric models for clustering and feature allocation to big data. The algorithm is valid for any prior on random subsets such as partitions and latent feature…
We present a novel Monte Carlo algorithm which enhances equilibrization of low-temperature simulations and allows sampling of configurations over a large range of energies. The method is based on a non-Boltzmann probability weight factor…
A cluster algorithm is presented for the $Z_2$ Kalb-Ramond plaquette model in four dimensions which dramatically reduces critical slowing. The critical exponent $z$ is reduced from $ z>2$ (standard Metropolis algorithm) to $z= 0.32\pm0.06$.…
Quantum annealing with the D-Wave Advantage system in the random Ising model on a cubic lattice is simulated using a three-dimensional (3D) tensor network. The Hamiltonian is driven across a quantum phase transition from a paramagnetic…
The standard Potts model is investigated in the framework of nonextensive statistical mechanics. We performed Monte Carlo simulations on two-dimensional lattices with linear sizes ranging from 16 to 64 using the Metropolis algorithm, where…
In this paper we propose a Monte Carlo method for generating finite-domain marginals of critical distributions of statistical models in infinite volume. The algorithm corrects the problem of the long-range effects of boundaries associated…
We calculate the mean link in Landau gauge for Wilson and improved SU(3) anisotropic gauge actions, using two loop perturbation theory and Monte Carlo simulation employing an accelerated Langevin algorithm. Twisted boundary conditions are…
A versatile and numerically inexpensive method is presented allowing the accurate calculation of phase diagrams for bosonic lattice models. By treating clusters within the Gutzwiller theory, a surprisingly good description of quantum…
The influence of random site dilution on the critical properties of the two-dimensional Ising model on a square lattice was explored by Monte Carlo simulations with the Wang-Landau sampling. The lattice linear size was $L = 20-120$ and the…