Loop-erased random walk (LERW) is one of the most well-studied critical lattice models. It is the self-avoiding random walk that one gets after erasing the loops from a simple random walk in order or, alternatively, by considering the branches in a spanning tree chosen uniformly at random. We prove that planar LERW parameterized by renormalized length converges in the lattice-size scaling limit to parameterized by -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. We give, for example, two-point estimates, estimates on maximal content, and a “separation lemma” for two-sided LERW.
"Convergence of loop-erased random walk in the natural parameterization." Duke Math. J. 170 (10) 2289 - 2370, 15 July 2021. https://doi.org/10.1215/00127094-2020-0075