Capacity of loop-erased random walk

Abstract

We study the capacity of loop-erased random walk (LERW) on Zd. For d≥4, 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=3, we show that the scaling limit of the capacity of LERW is random. We show that the capacity of the first n steps of LERW is of order n1/β, 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…