Geometric Allocation Approaches in Markov Chain Monte Carlo

Abstract

The Markov chain Monte Carlo method is a versatile tool in statistical physics to evaluate multi-dimensional integrals numerically. For the method to work effectively, we must consider the following key issues: the choice of ensemble, the selection of candidate states, the optimization of transition kernel, algorithm for choosing a configuration according to the transition probabilities. We show that the unconventional approaches based on the geometric allocation of probabilities or weights can improve the dynamics and scaling of the Monte Carlo simulation in several aspects. Particularly, the approach using the irreversible kernel can reduce or sometimes completely eliminate the rejection of trial move in the Markov chain. We also discuss how the space-time interchange technique together with Walker's method of aliases can reduce the computational time especially for the case where the number of candidates is large, such as models with long-range interactions.

10pages, 4 figures

References in corpus (4)

• Markov Chain Monte Carlo Method without Detailed Balance
• Accelerating diffusions
• Order-N Cluster Monte Carlo Method for Spin Systems with Long-range Interactions
• Dynamics of the One-Dimensional Ising Model without Detailed Balance Condition

Cited by in corpus (14)

• Upper and Lower Critical Decay Exponents of Ising Ferromagnets with Long-range Interaction
• Eigenvalue analysis of an irreversible random walk with skew detailed balance conditions
• Efficient Irreversible Monte Carlo samplers
• Thermodynamic Casimir Effect in Films: the Exchange Cluster Algorithm
• Two- and three-point functions at criticality: Monte Carlo simulations of the improved three-dimensional Blume-Capel model
• DSQSS: Discrete Space Quantum Systems Solver
• Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk
• A variance reduced estimator of the connected two-point function in the presence of a broken Z_2 symmetry
• Control of probability flow in Markov chain Monte Carlo -- Nonreversibility and lifting
• Lifted directed-worm algorithm
• Reducing rejection exponentially improves Markov chain Monte Carlo sampling
• Stochastic parameter optimization analysis of dynamical quantum critical phenomena in long-range transverse-field Ising chain
• Fast algorithm for generating random bit strings and multispin coding for directed percolation
• The interface tension in the improved Blume-Capel model