Loop-Erased Random Walk

@inproceedings{Lawler1999LoopErasedRW,
  title={Loop-Erased Random Walk},
  author={Gregory F. Lawler},
  year={1999}
}
Loop-erased random walk (LERW) is a process obtained from erasing loops from simple random walk. This paper reviews some of the results and conjectures about LERW. In particular, we discuss the critical exponents for LERW, Wilson’s algorithm for generating uniform spanning trees with LERW, and the role of conformal invariance in studying LERW in two dimensions. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 38 CITATIONS