arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.10376math.PRmath.CO
收藏

公平皮亚诺路径的缩放极限

The scaling limit of fair Peano paths

Kansas State University(堪萨斯州立大学);University of Tennessee(田纳西大学)

Nathan Albin, Joan Lind, Pietro Poggi-Corradini

AI总结:

本文研究平面方格网上公平随机生成树产生的皮亚诺路径,证明在网格尺寸趋于零时其缩放极限是确定性的,与均匀采样情形下的 ${\rm SLE}_8$ 极限形成对比。

摘要:

我们研究平面方格网上由公平随机生成树产生的随机皮亚诺路径。这些树的采样方式使得(如果可能的话)各边具有相同的概率。我们特别关注当网格的网格尺寸趋于零时识别其缩放极限。已知(见\cite{lawler-schramm-werner2002}),如果树是均匀采样的,那么缩放极限存在且等于 ${\rm SLE}_8$。我们证明,如果简单地遵循与\cite{lawler-schramm-werner2002}中相同的步骤,那么公平皮亚诺路径具有确定性的缩放极限。

英文摘要:

We study random Peano paths on planar square grids that arise from fair random spanning trees. These are trees that are sampled in such a way as to have the same (if possible) edge probabilities. In particular, we are interested in identifying the scaling limit as the mesh-size of the grid tends to zero. It is known \cite{lawler-schramm-werner2002} that if the trees are sampled uniformly, then the scaling limit exists and equals ${\rm SLE}_8$. We show that if we simply follow the same steps as in \cite{lawler-schramm-werner2002}, then fair Peano paths have a deterministic scaling limit.

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

↑