Reducing rejection exponentially improves Markov chain Monte Carlo sampling
From MaRDI portal
Publication:6140171
DOI10.1016/j.physa.2023.129368arXiv2208.03935OpenAlexW4388672943MaRDI QIDQ6140171
Publication date: 19 January 2024
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.03935
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Irreversible Monte Carlo algorithms for efficient sampling
- Three-dimensional 3-state Potts model revisited with new techniques
- Order-\(n\) cluster Monte Carlo method for spin systems with long-range interactions
- Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields
- Monte Carlo methods beyond detailed balance
- Non-reversible Monte Carlo simulations of spin models
- Optimum Monte-Carlo sampling using Markov chains
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- On the Optimal Transition Matrix for Markov Chain Monte Carlo Sampling
- Equation of State Calculations by Fast Computing Machines
- Geometric Allocation Approach for Transition Kernel of Markov Chain
- A Guide to Monte Carlo Simulations in Statistical Physics
This page was built for publication: Reducing rejection exponentially improves Markov chain Monte Carlo sampling