加载中…
The loop-erased random walk (LERW) in is the process obtained by erasing loops chronologically for simple random walk. We prove that the escape probability of the LERW renormalized by converges almost surely and in for all . Along the way, we extend previous results by the first author building on slowly recurrent sets. We provide two applications for the escape probability. We construct the two-sided LERW, and we construct a spin model coupled with the wired spanning forests on with the bi-Laplacian Gaussian field on as its scaling limit.

生成讲解博客的中文版本

生成AI智能校验的中文版本