Monte Carlo sampling for stochastic weight functions
arXiv:1612.06131 · doi:10.1073/pnas.1620497114
Abstract
Conventional Monte Carlo simulations are stochastic in the sense that the acceptance of a trial move is decided by comparing a computed acceptance probability with a random number, uniformly distributed between 0 and 1. Here we consider the case that the weight determining the acceptance probability itself is fluctuating. This situation is common in many numerical studies. We show that it is possible to construct a rigorous Monte Carlo algorithm that visits points in state space with a probability proportional to their average weight. The same approach has the potential to transform the methodology of a certain class of high-throughput experiments or the analysis of noisy datasets.
arXiv comment7 pages, 4 figures
References in corpus (10)
- Statistically optimal analysis of samples from multiple equilibrium states
- Simulated Tempering: A New Monte Carlo Scheme
- Strict Detailed Balance is Unnecessary in Monte Carlo Simulation
- Numerical calculation of granular entropy
- The Penalty Method for Random Walks with Uncertain Energies
- Parallel Excluded Volume Tempering for Polymer Melts
- Direct determination of the size of basins of attraction of jammed solids
- Turning intractable counting into sampling: computing the configurational entropy of three-dimensional jammed packings
- Numerical test of the Edwards conjecture shows that all packings are equally probable at jamming
- Structural analysis of high-dimensional basins of attraction
Cited by in corpus (5)
- When you can't count, sample! Computable entropies beyond equilibrium from basin volumes
- A Simple Algorithm for Scalable Monte Carlo Inference
- Numerical method for computing the free energy of glasses
- Effect of Interlayer Stacking on the Electronic Properties of 1-TaS
- Fluctuation Distributions of Energy Minima in Complex Landscapes