Loop-Erased Random Walk Branch of Uniform Spanning Tree in Topological Polygons

Abstract

We consider uniform spanning tree (UST) in topological polygons with 2N marked points on the boundary with alternating boundary conditions. In [LPW21], the authors derive the scaling limit of the Peano curve in the UST. They are variants of SLE8. In this article, we derive the scaling limit of the loop-erased random walk branch (LERW) in the UST. They are variants of SLE2. The conclusion is a generalization of [HLW20,Theorem 1.6] where the authors derive the scaling limit of the LERW branch of UST when N=2. When N=2, the limiting law is SLE2(-1,-1; -1, -1). However, the limiting law is nolonger in the family of SLE2() process as long as N 3.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…