Loop-Erased Random Walk

@inproceedings{Lawler1999LoopErasedRW,
  title={Loop-Erased Random Walk},
  author={G. Lawler},
  year={1999}
}
  • G. Lawler
  • Published 1999
  • Mathematics
  • 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. 
    60 Citations
    The growth exponent for planar loop-erased random walk
    • 35
    • PDF
    Loop-Erased Random Walks, Spanning Trees and Hamiltonian Cycles
    • 30
    • Highly Influenced
    • PDF
    One-point function estimates for loop-erased random walk in three dimensions.
    • 4
    • PDF
    SCALING LIMIT OF LOOP-ERASED RANDOM WALK
    • 5
    • Highly Influenced
    • PDF
    Convergence of three-dimensional loop-erased random walk in the natural parametrization.
    • 4
    • PDF
    Estimates of Random Walk Exit Probabilities and Application to Loop-Erased Random Walk
    • 34
    • PDF
    Random planar curves and Schramm-Loewner evolutions
    • 231
    • PDF

    References

    SHOWING 1-10 OF 19 REFERENCES