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
Spanning k-Trees and Loop-Erased Random Surfaces
We introduce a novel model of random hypersurfaces that generalizes loop-erased random walk. Using a duality with loop-erased… 
2016
2016
A note on dimers and T-graphs
The purpose of this note is to give a succinct summary of some basic properties of T-graphs which arise in the study of the dimer… 
2015
2015
A family of self-avoiding random walks interpolating the loop-erased random walk and a self-avoiding walk on the Sierpinski gasket
We show that the `erasing-larger-loops-first' (ELLF) method, which was first introduced for erasing loops from the simple random… 
2015
2015
Loop-Erased Random Surfaces
Loop-erased random walk and it's scaling limit, Schramm--Loewner evolution, have found numerous applications in mathematics and… 
2014
2014
Adaptive stereo matching via loop-erased random walk
This paper proposes an adaptive tree-based cost aggregation strategy for stereo matching. The previous tree-based algorithms… 
2011
2011
Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z^2
We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded… 
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… 
2008
2008
Hölder regularity of the SLE trace
S. Rohde and O. Schramm have recently shown that the SLE trace is Holder continuous (2005). However, their results are not… 
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… 
2006
2006
Coloured Loop-Erased Random Walk on the Complete Graph
Starting from a sequence regarded as a walk through some set of values, we consider the associated loop-erased walk as a sequence… 
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)