论文标题
使用修改的墙壁自动算法识别渗透集群的电流子集
Identification of a current-carrying subset of a percolation cluster using a modified wall follower algorithm
论文作者
论文摘要
我们已经提出并实施了众所周知的壁式追随者算法的修改，以识别渗透群集的骨干（当前携带部分）。修改后的算法的优点是识别整个主链而无需访问所有边缘。该算法已应用于通过将导电棒随机沉积在绝缘基板上随机沉积产生的网络中。我们发现（i）对于渗透阈值以上的棍棒浓度，渗透簇的强度迅速接近统一； （ii）同时，渗透簇与其骨架和最简单的死端相同，即，边缘出现在单位程度的顶点。
We have proposed and implemented a modification of the well-known wall follower algorithm to identify a backbone (a current-carrying part) of the percolation cluster. The advantage of the modified algorithm is identification of the whole backbone without visiting all edges. The algorithm has been applied to backbone identification in networks produced by random deposition of conductive sticks onto an insulating substrate. We have found that (i) for concentrations of sticks above the percolation threshold, the strength of the percolating cluster quickly approaches unity; (ii) simultaneously, the percolation cluster is identical to its backbone plus simplest dead ends, i.e., edges that are incident to vertices of unit degree.
