arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.6880math.PRmath.STstat.TH
收藏

Wang-Landau算法的收敛性

Convergence of the Wang-Landau algorithm

Gersende Fort, Benjamin Jourdain, Estelle Kuhn, Tony Lelièvre, Gabriel Stoltz

摘要:

我们分析了Wang-Landau算法的收敛性。该采样方法属于一般自适应重要性采样策略,其使用沿着所选反应坐标的自由能作为偏差。这类算法对于提高马尔可夫链蒙特卡罗算法在亚稳态时的采样性能是很有帮助的。我们证明了Wang-Landau算法的收敛性和相应的中心极限定理。

英文摘要:

We analyze the convergence properties of the Wang-Landau algorithm. This sampling method belongs to the general class of adaptive importance sampling strategies which use the free energy along a chosen reaction coordinate as a bias. Such algorithms are very helpful to enhance the sampling properties of Markov Chain Monte Carlo algorithms, when the dynamics is metastable. We prove the convergence of the Wang-Landau algorithm and an associated central limit theorem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑