Abstract
The Wolff algorithm is now accepted as the best cluster-flipping Monte Carlo algorithm for beating ``critical slowing down.'' We show how this method can yield incorrect answers due to subtle correlations in ``high quality'' random number generators.
Keywords
Affiliated Institutions
Related Publications
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Probabilistic inference is an attractive approach to uncertain reasoning and empirical learning in artificial intelligence. Computational difficulties arise, however, because pr...
Application of the Monte Carlo Method to the Lattice-Gas Model. I. Two-Dimensional Triangular Lattice
The Monte Carlo numerical method for obtaining statistical mechanical averages in the petite canonical ensemble has been applied to the two-dimensional triangular lattice-gas mo...
A comparison of Bayesian and likelihood-based methods for fitting multilevel models
We use simulation studies, whose design is realistic for educational and medical\nresearch (as well as other fields of inquiry), to compare Bayesian and likelihood-based\nmethod...
Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
Summary The paper proposes Metropolis adjusted Langevin and Hamiltonian Monte Carlo sampling methods defined on the Riemann manifold to resolve the shortcomings of existing Mont...
The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo
Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) algorithm that avoids the random walk behavior and sensitivity to correlated parameters that plague many MCMC ...
Publication Info
- Year
- 1992
- Type
- article
- Volume
- 69
- Issue
- 23
- Pages
- 3382-3384
- Citations
- 423
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1103/physrevlett.69.3382