GRAPHICAL REPRESENTATIONS AND CLUSTER ALGORITHMS FOR CRITICAL POINTS WITH FIELDS

GRAPHICAL REPRESENTATIONS AND CLUSTER ALGORITHMS FOR CRITICAL POINTS WITH FIELDS
复制标题

具有字段的关键点的图形表示和聚类算法

DOI：
--
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
L. Chayes
L. Chayes
中科院分区：
--
文献类型：
--
作者：
Oliver Redner;J. Machta;L. Chayes

文献摘要

被引文献

相似文献

描述了一种适用于具有任意场的铁磁Ising系统的双副本图形表示和相关的聚类算法。临界点与图形表示的渗透阈值相关联。给出了交错场中Ising模型的数值模拟结果。实验结果表明，该算法的动态指数小于0.5。
A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields. Critical points are associated with the percolation threshold of the graphical representation. Results from numerical simulations of the Ising model in a staggered field are presented. The dynamic exponent for the algorithm is measured to be less than 0.5.