arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0811.2042cond-mat.stat-mech
收藏

一种全填充环模型的蠕虫算法

A worm algorithm for the fully-packed loop model

Wei Zhang, Timothy M. Garoni, Youjin Deng

摘要:

本文提出了一种蠕虫型的马尔可夫链蒙特卡罗算法,它能正确地模拟蜂窝格子上的满圈模型,并证明了它是遍历的,具有均匀平稳分布。蜂窝晶格上的完全填充回路模型等价于零温度三角晶格反铁磁伊辛模型,后者是完全受挫的,并且众所周知难以模拟。我们对该蠕虫算法进行了数值测试,并估计了动态指数z = 0.515(8)。我们还测量了几个感兴趣的静态量,包括环长和脸大小的时刻。它出现在数值上的面大小的时刻是由磁渗透的尺寸。

英文摘要:

We present a Markov-chain Monte Carlo algorithm of worm type that correctly simulates the fully-packed loop model on the honeycomb lattice, and we prove that it is ergodic and has uniform stationary distribution. The fully-packed loop model on the honeycomb lattice is equivalent to the zero-temperature triangular-lattice antiferromagnetic Ising model, which is fully frustrated and notoriously difficult to simulate. We test this worm algorithm numerically and estimate the dynamic exponent z = 0.515(8). We also measure several static quantities of interest, including loop-length and face-size moments. It appears numerically that the face-size moments are governed by the magnetic dimension for percolation.

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

↑