Loop-erased random walk
This is a survey on what is known and what is believed about the loop erased random walk (LERW). The LERW has been introduced and first studied by the author in 1980 in the hope to learn from the study of this model about the usual self-avoiding walk. Meanwhile, it turned out that the two models exhibit different asymptotic behaviors. Nevertheless, the LERW is interesting on its own as it is believed to possess a number of interesting critical properties similar to other models of statistical mechanics, and since the LERW has close connections to other actively studied models like uniform spanning trees or the \(Q\)-state Potts model as \(Q\to 0\). The LERW is a path process on a graph obtained from simple random walk by erasing the loops chronologically, such that a random self-avoiding path arises. The paper focusses on the key properties of the process like the growth exponent on the hypercubic lattices, for instances. Three topics are mainly covered: a summary of the rigorous results and some proof ideas, a presentation of Wilson's simple and beautiful algorithm for generating uniform spanning trees using the LERW, and a collection of important conjectures and open problems, in particular the (conjectured) relation to conformal invariance in two dimensions. For the entire collection see [Zbl 0919.00093].
- Loop-erased random walk on the Sierpinski gasket
- Loop-erased random walks associated with Markov processes
- Loop-erased walks and random matrices
- The infinite two-sided loop-erased random walk
- Loop-erased random walk on finite graphs and the Rayleigh process
- On the scaling limit of loop-erased random walk excursion
- Loop-erased self-avoiding random walk in two and three dimensions.
- Four-dimensional loop-erased random walk
- Loop-erased random walk on a torus in dimensions 4 and above
- Field theory conjecture for loop-erased random walks
- Scaling limits of loop-erased random walks and uniform spanning trees
- On Brownian motion, simple paths, and loops
- Growth exponent for loop-erased random walk in three dimensions
- Topics in loop measures and the loop-erased walk
- Conformal invariance of planar loop-erased random walks and uniform spanning trees.
- Loop-erased random walks, spanning trees and Hamiltonian cycles
- A reverse Aldous-Broder algorithm
- Quenched and averaged tails of the heat kernel of the two-dimensional uniform spanning tree
- Scaling limits of the three-dimensional uniform spanning tree and associated random walk
- Weights of uniform spanning forests on nonunimodular transitive graphs
- The Hölder continuity of the scaling limit of three-dimensional loop-erased random walk
- The number of spanning clusters of the uniform spanning tree in three dimensions
- The infinite two-sided loop-erased random walk
- One-point function estimates for loop-erased random walk in three dimensions
- Field theories for loop-erased random walks
- Hausdorff dimension of the scaling limit of loop-erased random walk in three dimensions
- The scaling limit of loop-erased random walk in three dimensions
- Loop-erased random walk on a torus in dimensions 4 and above
- Learning about critical phenomena from scribbles and sandpiles
- Random walk loop soup
- The complexity of loop erased walk in Z^3
- Coloured Loop-Erased Random Walk on the Complete Graph
- A Lower Bound on the Growth Exponent for Loop-Erased Random Walk in Two Dimensions
- scientific article; zbMATH DE number 1537469 (Why is no real title available?)
- The probability that planar loop-erased random walk uses a given edge
- Loop-erased random walks associated with Markov processes
- Geometry of Uniform Spanning Forest Components in High Dimensions
- Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
- Generalized loop-erased random walks and approximate reachability
- Almost triangular Markov chains on \(\mathbb{N}\)
- Scaling limits of loop-erased Markov chains on resistance spaces via a partial loop-erasing procedure
- Logarithmic corrections to scaling in the four-dimensional uniform spanning tree
- A co-preLie structure from chronological loop erasure in graph walks
- Loop-erased random walk and Poisson kernel on planar graphs
- Convergence of loop-erased random walk in the natural parameterization
- Random walk on the range of random walk
- Markov loops and renormalization
This page was built for publication: Loop-erased random walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938902)
