arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.05040cond-mat.dis-nncond-mat.stat-mechphysics.comp-ph
收藏

常配位数拓扑无序格的快速算法

Fast algorithm for topologically disordered lattices with constant coordination number

Manuel Schrauth, Jefferson S. E. Portela

摘要:

我们提出了一个随机算法,用于构建一个拓扑无序(即,非规则的)具有恒定配位数的节点的空间晶格,CC晶格。施工程序大大改善了早期的建议[物理修订版E。97,022144(2018)]关于计算复杂性和有限尺寸标度属性两者-使得CC晶格成为邻近图的替代方案,其尤其是在更高维度中,构建起来明显更快。在其他应用中,诸如具有低浓度配位缺陷的某些非晶材料的物理系统是自然界中无序的恒定配位晶格的重要示例。作为一个具体的应用,我们刻画了CC格点上三维伊辛模型的临界性。我们发现它的相变属于干净的伊辛普适类,建立在CC晶格中存在的无序是一个无关的扰动在重整化群理论的意义。

英文摘要:

We present a stochastic algorithm for constructing a topologically disordered (i.e., non-regular) spatial lattice with nodes of constant coordination number, the CC lattice. The construction procedure dramatically improves on an earlier proposal [Phys. Rev. E. 97, 022144 (2018)] with respect to both computational complexity and finite-size scaling properties - making the CC lattice an alternative to proximity graphs which, especially in higher dimensions, is significantly faster to build. Among other applications, physical systems such as certain amorphous materials with low concentration of coordination defects are an important example of disordered, constant-coordination lattices in nature. As a concrete application, we characterize the criticality of the 3D Ising model on the CC lattice. We find that its phase transition belongs to the clean Ising universality class, establishing that the disorder present in the CC lattice is a non-relevant perturbation in the sense of renormalization group theory.

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

↑