Scaling limit of the loop-erased random walk Green's function (Q328782): Difference between revisions

The authors consider a loop-erased random walk, LERW, on a square grid. This measure on self-avoiding paths is obtained by running a simple random walk and successively erasing loops as they form. The authors are interested in the probability that the LERW passes through a given edge of a grid approximation of a simply connected domain \(D\) and this probability is called the LERW edge Green's function in \(D\). It is shown that for edges away from the boundary, this probability, when normalized by the inverse mesh size to the power \(3/4\), converges as the mesh size gets smaller to an explicit conformally covariant function which coincides with the \(\mathrm{SLE}_2\) Green's function.