Skip to search formSkip to main contentSkip to account menu

Loop-erased random walk

Known as: Wilson's algorithm, Uniform Spanning Tree, Loop erased random walk 
In mathematics, loop-erased random walk is a model for a random simple path with important applications in combinatorics and, in physics, quantum… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Brownian motionDiscrete mathematicsDomino tilingGraph (discrete mathematics)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Convergence of radial loop-erased random walk in the natural parametrization
Loop-erased random walk, abbreviated LERW, is one of the most well-studied critical lattice models. It is the self-avoiding… 
Review
2016
Review
2016
I – Loop Erased Walks and Uniform Spanning Trees
The uniform spanning tree has had a fruitful history in probability theory. Most notably, it was the study of the scaling limit… 
2014
2014
Scaling limit of the loop-erased random walk Green’s function
We consider loop-erased random walk (LERW) running between two boundary points of a square grid approximation of a planar simply… 
2013
2013
Growth exponent for loop-erased random walk in three dimensions
We show the existence of the growth exponent for loop-erased random walk in three dimensions. 
2012
2012
Convergence rates for loop-erased random walk and other Loewner curves
We estimate convergence rates for curves generated by Loewner's differential equation under the basic assumption that a… 
2010
2010
The dimension of loop-erased random walk in 3D
Loop-erased random walk (LERW) is the path obtained from a random walk by erasing loops as they are formed, and was introduced by… 
2009
2009
On the Rate of Convergence of Loop-Erased Random Walk to SLE2
We derive a rate of convergence of the Loewner driving function for a planar loop-erased random walk to Brownian motion with… 
Highly Cited
2008
Highly Cited
2008
Reversibility of chordal SLE
We prove that the chordal SLE κ trace is reversible for κ ∈ ( 0 , 4 ] . 
Review
2007
Review
2007
SCALING LIMIT OF LOOP-ERASED RANDOM WALK
The loop-erased random walk (LERW) was first studied in 1980 by Lawler as an attempt to analyze self-avoiding walk (SAW) which… 
Highly Cited
2000
Highly Cited
2000
Long-range properties of spanning trees
We compute some large-scale properties of the uniform spanning tree process on bounded regions in Z2. In particular, we compute… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)