English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this work we present a theoretical analysis of the convergence of theWang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] which was introducedyears ago to calculate the density of states in statistical models. We studythe dynamical behavior of the error in the calculation of the density ofstates.We conclude that the source of the saturation of the error is due to thedecreasing variations of the refinement parameter. To overcome this limitation,we present an analytical treatment in which the refinement parameter is scaleddown as a power law instead of exponentially. An extension of the analysis tothe N-fold way variation of the method is also discussed.Comment: 7 pages, 5 figure

Wang-Landau algorithm: A theoretical analysis of the saturation of the error