arXiv:cond-mat/0701672AbstractReferencesReviewsResources
Fast Algorithm to Calculate Density of States
R. E. Belardinelli, V. D. Pereyra
Published 2007-01-26, updated 2007-12-29Version 2
An algorithm to calculate the density of states, based on the well-known Wang-Landau method, is introduced. Independent random walks are performed in different restricted ranges of energy, and the resultant density of states is modified by a function of time, F(t)=1/t, for large time. As a consequence, the calculated density of state, gm(E,t), approaches asymptotically the exact value gex(E) as 1/sqrt(t), avoiding the saturation of the error. It is also shown that the growth of the interface of the energy histogram belongs to the random deposition universality class.
Comments: 5 pages, 5 figures
Categories: cond-mat.stat-mech
Related articles: Most relevant | Search more
arXiv:cond-mat/9801102 (Published 1998-01-12)
A fast algorithm for backbones
arXiv:2208.00067 [cond-mat.stat-mech] (Published 2022-07-29)
Statistical properties of sites visited by independent random walks
arXiv:cond-mat/0309508 (Published 2003-09-22)
Fast algorithm for detecting community structure in networks