arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.00539math.COcond-mat.stat-mech
收藏

精确可解的自陷格点行走。第一部分:梯形图中的陷阱

Exactly-Solvable Self-Trapping Lattice Walks. Part I: Trapping in Ladder Graphs

Alexander R. Klotz, Everett Sullivan

摘要:

生长自回避行走(GSAW)是一种从晶格原点开始,通过随机占据相邻晶格空位而生长的随机过程。足够长的GSAW将达到所有相邻站点都已被步行占据并被困的状态,从而终止该过程。从模拟中经验已知,在正方形晶格上,这在平均71步之后发生。在第一部分的两部分系列的手稿,我们认为简化的晶格几何形状只有两个网站高("梯子"),并推导出GSAW捕获的概率分布的生成函数。我们证明了在正方形梯子上的自陷行走在平均17步后会被困住,而在三角形梯子上的自陷行走在平均941/48步(约19.6步)后会被困住。我们讨论了我们的研究结果的其他影响,了解捕获在“无限”GSAW。

英文摘要:

A growing self-avoiding walk (GSAW) is a stochastic process that starts from the origin on a lattice and grows by occupying an unoccupied adjacent lattice site at random. A sufficiently long GSAW will reach a state in which all adjacent sites are already occupied by the walk and become trapped, terminating the process. It is known empirically from simulations that on a square lattice, this occurs after a mean of 71 steps. In Part I of a two-part series of manuscripts, we consider simplified lattice geometries only two sites high ("ladders") and derive generating functions for the probability distribution of GSAW trapping. We prove that a self-trapping walk on a square ladder will become trapped after a mean of 17 steps, while on a triangular ladder trapping will occur after a mean of 941/48 (~19.6 steps). We discuss additional implications of our results for understanding trapping in the "infinite" GSAW.

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

↑