Convergence of loop erased random walks on a planar graph to a chordal SLE(2) curve
Abstract
In this paper we consider the natural random walk on a planar graph and scale it by a small positive number δ. Given a simply connected domain D and its two boundary points a and b, we start the scaled walk at a vertex of the graph nearby a and condition it on its exiting D through a vertex nearby b, and prove that the loop erasure of the conditioned walk converges, as δ 0, to the chordal SLE2 that connects a and b in D, provided that an invariance principle is valid for both the random walk and the dual walk of it.
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.