arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.03708physics.soc-phcond-mat.dis-nn
收藏

空间网络上逾渗关联长度的快速计算

Faster calculation of the percolation correlation length on spatial networks

Michael M. Danziger, Bnaya Gross, Sergey V. Buldyrev

摘要:

关联长度$ξ$在临界点的发散是二维系统渗流的一个重要现象。通过利用不相交集,已经实现了对渗流阈值和组分分布的计算的实质性加速,但是现有的这种算法不能测量相关长度。在这里,我们利用平行轴定理来跟踪节点添加到系统的相关长度,使我们能够利用不相交的集合来测量$ξ$的整个渗流过程中的任意精度在一个单一的扫描。该算法能够直接测量格点和空间网络拓扑中的相关长度,为理解空间系统中的临界现象提供了重要工具。

英文摘要:

The divergence of the correlation length $ξ$ at criticality is an important phenomenon of percolation in two-dimensional systems. Substantial speed-ups to the calculation of the percolation threshold and component distribution have been achieved by utilizing disjoint sets, but existing algorithms of this sort cannot measure the correlation length. Here, we utilize the parallel axis theorem to track the correlation length as nodes are added to the system, allowing us to utilize disjoint sets to measure $ξ$ for the entire percolation process with arbitrary precision in a single sweep. This algorithm enables direct measurement of the correlation length in lattices as well as spatial network topologies, and provides an important tool for understanding critical phenomena in spatial systems.

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

↑