Scaling limits of loop-erased random walks and uniform spanning trees
- 529 Downloads
The uniform spanning tree (UST) and the loop-erased random walk (LERW) are strongly related probabilistic processes. We consider the limits of these models on a fine grid in the plane, as the mesh goes to zero. Although the existence of scaling limits is still unproven, subsequential scaling limits can be defined in various ways, and do exist. We establish some basic a.s. properties of these subsequential scaling limits in the plane. It is proved that any LERW subsequential scaling limit is a simple path, and that the trunk of any UST subsequential scaling limit is a topological tree, which is dense in the plane.
Unable to display preview. Download preview PDF.