Convergence of loop-erased random walk in the natural parameterization

From MaRDI portal



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".


The main contribution of this paper is that planar loop-erased random walks parameterized by renormalized length converge in the scaling limit to SLE\(_2\) (Schramm-Loewner evolution) parametrized by \(5/4\)-dimensional Minkowski content. In the process of proving this, the authors provide a method for proving similar convergence results for other models converging to SLE and other results of independent interest like two-point estimates, estimates on maximal content, and a separation lemma for two-sided loop-erased random walks.



Cites work


Cited in
(28)








This page was built for publication: Convergence of loop-erased random walk in the natural parameterization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q821481)