期刊
FRONTIERS OF PHYSICS
卷 12, 期 1, 页码 -出版社
HIGHER EDUCATION PRESS
DOI: 10.1007/s11467-016-0646-6
关键词
Monte Carlo algorithms; self-avoiding walk; irreversible; balance condition
资金
- National Natural Science Foundation of China [11275185, 11625522]
- Open Project Program of State Key Laboratory of Theoretical Physics, Institute of Theoretical Physics, Chinese Academy of Sciences, China [Y5KF191CJ1]
- Ministry of Education (of China) for the Fundamental Research Funds for the Central Universities [2340000034]
We formulate an irreversible Markov chain Monte Carlo algorithm for the self-avoiding walk (SAW), which violates the detailed balance condition and satisfies the balance condition. Its performance improves significantly compared to that of the Berretti-Sokal algorithm, which is a variant of the Metropolis-Hastings method. The gained efficiency increases with spatial dimension (D), from approximately 1 0 times in 2D to approximately 4 0 times in 5D. We simulate the SAW on a 5D hyper-cubic lattice with periodic boundary conditions, for a linear system with a size up to L = 128, and confirm that as for the 5D Ising model, the finite-size scaling of the SAW is governed by renormalized exponents, nu* = 2/d and gamma/nu* = d/2. The critical point is determined, which is approximately 8 times more precise than the best available estimate.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据