arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.13343cond-mat.stat-mech
收藏

稀疏硬盘包装与局部马尔可夫链

Sparse hard-disk packings and local Markov chains

Philipp Hoellmer, Nicolas Noirault, Botao Li, A. C. Maggs, Werner Krauth

摘要:

我们提出了本地稳定的稀疏硬盘包装,介绍了Böröczky,作为一个模型的分析和基准的马尔可夫链蒙特卡罗(MCMC)算法。我们首先生成这样的填充在一个正方形框周期边界条件,并分析其性质。然后,我们研究如何本地MCMC算法,即大都市算法和几个版本的事件链蒙特卡罗(ECMC),逃脱配置,通过稍微减少所有磁盘半径的松弛参数。模拟结果证实了尺度分析。我们得到两个类的ECMC,其中逃逸时间随松弛参数代数变化(如局部Metropolis算法),另一个逃逸时间尺度为松弛参数的对数。我们讨论了硬盘样本空间的连通性,局部MCMC算法的遍历性,以及在NPT系综的背景下包装的意义。我们的工作是伴随着开源的,任意精度的软件,用于Böröczky包装(Python)和直接,反射,向前和牛顿ECMC(Go)。

英文摘要:

We propose locally stable sparse hard-disk packings, as introduced by Böröczky, as a model for the analysis and benchmarking of Markov-chain Monte Carlo (MCMC) algorithms. We first generate such packings in a square box with periodic boundary conditions and analyze their properties. We then study how local MCMC algorithms, namely the Metropolis algorithm and several versions of event-chain Monte Carlo (ECMC), escape from configurations that are obtained by slightly reducing all disk radii by a relaxation parameter. A scaling analysis is confirmed by simulation results. We obtain two classes of ECMC, one in which the escape time varies algebraically with the relaxation parameter (as for the local Metropolis algorithm) and another in which the escape time scales as the logarithm of the relaxation parameter. We discuss the connectivity of the hard-disk sample space, the ergodicity of local MCMC algorithms, as well as the meaning of packings in the context of the NPT ensemble. Our work is accompanied by open-source, arbitrary-precision software for Böröczky packings (in Python) and for straight, reflective, forward, and Newtonian ECMC (in Go).

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

↑