用改进的壁跟随器算法识别渗流团的载流子集
Identification of a current-carrying subset of a percolation cluster using a modified wall follower algorithm
摘要：
我们已经提出并实施了一个修改的著名的墙跟随算法，以确定骨干（载流部分）的渗流集群。改进算法的优点是不需要访问所有的边就能识别出整个主干。该算法已被应用到骨干网络的绝缘基板上的导电棒随机沉积产生的识别。我们已经发现，（i）对于高于逾渗阈值的棒浓度，渗透簇的强度迅速接近1;（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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
