Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
