Monte Carlo simulations: Hidden errors from ‘‘good’’ random number generators
- 7 December 1992
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 69 (23) , 3382-3384
- https://doi.org/10.1103/physrevlett.69.3382
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
This publication has 9 references indexed in Scilit:
- Critical behavior of the three-dimensional Ising model: A high-resolution Monte Carlo studyPhysical Review B, 1991
- Statistical and systematic errors in Monte Carlo samplingJournal of Statistical Physics, 1991
- A random number generator for PC'sComputer Physics Communications, 1990
- Collective Monte Carlo Updating for Spin SystemsPhysical Review Letters, 1989
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987
- Finite-size scaling in the three-dimensional Ising modelPhysical Review B, 1985
- A very fast shift-register sequence random number generatorJournal of Computational Physics, 1981
- Bounded and Inhomogeneous Ising Models. I. Specific-Heat Anomaly of a Finite LatticePhysical Review B, 1969
- RANDOM NUMBERS FALL MAINLY IN THE PLANESProceedings of the National Academy of Sciences, 1968