English

Capacity of loop-erased random walk

Probability 2026-05-13 v3

Abstract

We study the capacity of loop-erased random walk (LERW) on Zd\mathbb{Z}^d. For d4d\geq4, 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 d=3d=3, we show that the scaling limit of the capacity of LERW is random. We show that the capacity of the first nn steps of LERW is of order n1/βn^{1/\beta}, with β\beta 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.

Keywords

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

R2 v1 2026-06-28T20:06:47.578Z