Abstract
Simple criteria for convergence of Monte Carlo algorithms not necessarily requiring detailed balance for any specified transition probability are derived and it is shown that it is possible to view the algorithm as a superimposition of a Brownian motion on configurational space coupled to the transition probabilities. As such, the error contributions due to a particular Monte Carlo algorithm and the integration limits in configuration space must be distinguished from those due to the nonuniform sampling of the Brownian motion, and criteria related to the number of steps required to distinguish these errors are provided for the simplest cases involving one dimension and symmetrical probability distributions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. W. Wood and F. R. Barker,J. Chem. Phys. 27(3), 720 (1957).
M. H. Kalos and P. A. Whitlock,Monte Carlo Methods, Vol. I: Basics (Wiley New York, 1986), esp. Section 3.7, p. 73.
A. A. BarkerAust. J. Phys. 18:119 (1964).
M. Katori and N. Konno,J. Magn. Magn. Mat. 104–107(1):267 (1992).
D. W. Heermann,Computer Simulation Methods in Theoretical Physics (Springer-Verlag, Berlin, 1986), esp. Eqs. (4.28) and (4.35).
Y. A. Razanov,Probability Theory: A Concise Course (Dover New York, 1969), p. 64.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jesudason, C.G. Note on Monte Carlo methods without necessary detailed balance. J Stat Phys 82, 1207–1211 (1996). https://doi.org/10.1007/BF02179809
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02179809