arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1002.0494cond-mat.stat-mechmath-phmath.MPphysics.chem-ph
收藏

自回避游动临界指数$ν$的精确估计及其主元算法的快速实现

Accurate estimate of the critical exponent $ν$ for self-avoiding walks via a fast implementation of the pivot algorithm

Nathan Clisby

摘要:

我们介绍了一个快速实现的枢轴算法的自避免行走,我们用它来获得大样本的行走上的立方格子高达$33 \times 10^6$步骤。因此,三维自回避行走的临界指数$ν$被确定为非常精确;最终估计是$ν=0.587597(7)$。该方法可以适用于其他模型的聚合物与短程相互作用,在晶格上或在连续。

英文摘要:

We introduce a fast implementation of the pivot algorithm for self-avoiding walks, which we use to obtain large samples of walks on the cubic lattice of up to $33 \times 10^6$ steps. Consequently the critical exponent $ν$ for three-dimensional self-avoiding walks is determined to great accuracy; the final estimate is $ν=0.587597(7)$. The method can be adapted to other models of polymers with short-range interactions, on the lattice or in the continuum.

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

↑