Convergence of loop-erased random walk in the natural parametrization

2016/03/16 by Gregory F. Lawler, Lawler, Gregory F., Fredrik Viklund +1 · 2 citations
Mathematics · Physics and Astronomy · #Stochastic processes and statistical mechanics #Markov Chains and Monte Carlo Methods #Theoretical and Computational Physics

paper · pdf · doi:10.48550/arxiv.1603.05203

Abstract

Loop-erased random walk, abbreviated LERW, is one of the most well-studied critical lattice models. It is the self-avoiding random walk one gets after erasing the loops from a simple random walk in order or alternatively by considering the branches in a uniformly chosen spanning tree. This paper proves that planar LERW parametrized by renormalized length converges in the lattice size scaling limit to SLE(2) parametrized by 5/4-dimensional Minkowski content. In doing this we also provide a method for proving similar convergence results for other models converging to SLE. Besides the main theorem, several of our results about LERW are of independent interest: for example, two-point estimates, estimates on maximal content, and a "separation lemma".

Cited by

• Existence and uniqueness of the conformally covariant geodesic metric on non-simple conformal loop ensemble gaskets
• Splitting algorithm and normed convergence for drawing the random Loewner curves

Related

• Convergence of three-dimensional loop-erased random walk in the natural parametrization
• Convergence of radial loop-erased random walk in the natural parametrization
• Four dimensional loop-erased random walk
• Scaling limit of the loop-erased random walk Green's function
• The Loewner difference equation and convergence of loop-erased random walk