Conformal invariance of planar loop-erased random walks and uniform spanning trees
نویسندگان
چکیده
We prove that the scaling limit of loop-erased random walk in a simply connected domain D $ C is equal to the radial SLE2 path. In particular, the limit exists and is conformally invariant. It follows that the scaling limit of the uniform spanning tree in a Jordan domain exists and is conformally invariant. Assuming that ∂D is a C1 simple closed curve, the same method is applied to show that the scaling limit of the uniform spanning tree Peano curve, where the tree is wired along a proper arc A ⊂ ∂D, is the chordal SLE8 path in D joining the endpoints of A. A by-product of this result is that SLE8 is almost surely generated by a continuous path. The results and proofs are not restricted to a particular choice of lattice. Duke University and Cornell University; partially supported by the National Science Foundation and the Mittag-Leffler Institute. Microsoft Research. Université Paris-Sud and IUF.
منابع مشابه
Loop-erased Random Walks, Spanning Trees and Hamiltonian Cycles
We establish a formula for the distribution of loop-erased random walks at certain random times. Several classical results on spanning trees, including Wilson’s algorithm, follow easily, as well as a method to construct random Hamiltonian cycles.
متن کاملBoundary Behavior of Sle
Introduction. Several lattice models from statistical physics such as random walks (RWs), loop-erased random walks (LERWs), self-avoiding random walks (SAWs), and critical FK (Fortuin and Kasteleyn) percolations have been shown or are conjectured to be invariant under conformal mappings. The stochastic Loewner evolution (SLE) was first introduced by O. Schramm as a possible scaling limit for th...
متن کاملScaling limits of loop - erased random walks and uniform spanning trees
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 su...
متن کاملGeneralized loop-erased random walks and approximate reachability
In this paper we extend the loop-erased random walk (LERW) to the directed hypergraph setting. We then generalize Wilson’s algorithm for uniform sampling of spanning trees to directed hypergraphs. In several special cases, this algorithm perfectly samples spanning hypertrees in expected polynomial time. Our main application is to the reachability problem, also known as the directed all-terminal...
متن کامل4 A pr 1 99 9 The Upper Critical Dimension of the Abelian Sandpile Model
The existing estimation of the upper critical dimension of the Abelian Sandpile Model is based on a qualitative consideration of avalanches as self-avoiding branching processes. We find an exact representation of an avalanche as a sequence of spanning sub-trees of two-component spanning trees. Using equivalence between chemical paths on the spanning tree and loop-erased random walks, we reduce ...
متن کامل