Capacity of loop-erased random walk
Probability
2026-05-13 v3
Abstract
We study the capacity of loop-erased random walk (LERW) on . For , we prove a strong law of large numbers and give explicit expressions for the limit in terms of the non-intersection probabilities of a simple random walk and a two-sided LERW. Along the way, we show that four-dimensional LERW is ergodic. For , we show that the scaling limit of the capacity of LERW is random. We show that the capacity of the first steps of LERW is of order , with the growth exponent of three-dimensional LERW. We express the scaling limit of the capacity of LERW in terms of the capacity of Kozma's scaling limit of LERW. As a corollary, we obtain the scaling limit of the LERW in three dimensions when parametrized by its capacity.
Cite
@article{arxiv.2411.13505,
title = {Capacity of loop-erased random walk},
author = {Maarten Markering},
journal= {arXiv preprint arXiv:2411.13505},
year = {2026}
}
Comments
25 pages