Markov Chain Monte Carlo Method without Detailed Balance

Abstract

We present a specific algorithm that generally satisfies the balance condition without imposing the detailed balance in the Markov chain Monte Carlo. In our algorithm, the average rejection rate is minimized, and even reduced to zero in many relevant cases. The absence of the detailed balance also introduces a net stochastic flow in a configuration space, which further boosts up the convergence. We demonstrate that the autocorrelation time of the Potts model becomes more than 6 times shorter than that by the conventional Metropolis algorithm. Based on the same concept, a bounce-free worm algorithm for generic quantum spin models is formulated as well.

5 pages, 5 figures

References in corpus (2)

• The ALPS project release 1.3: open source software for strongly correlated systems
• Generalized Directed Loop Method for Quantum Monte Carlo Simulations

Cited by in corpus (8)

• Bridging lattice-scale physics and continuum field theory with quantum Monte Carlo simulations
• Hybridization expansion Monte Carlo simulation of multi-orbital quantum impurity problems: matrix product formalism and improved Monte Carlo sampling
• Generation of ice states through deep reinforcement learning
• Mass-scaling replica-exchange molecular dynamics optimizes computational resources with simpler algorithm
• Anomalous diffusion analysis of the lifting events in the event-chain Monte Carlo for the classical XY models
• Incommensurate Short-Range Order in $S=1$ Triangular Lattice Ising Antiferromagnet
• Magnetization process of the S = 1/2 two-leg organic spin-ladder compound BIP-BNO
• Flow Decomposition Reveals Dynamical Structure of Markov Process