Schramm’s formula for multiple loop-erased random walks
Schramm’s formula for multiple loop-erased random walks
We revisit the computation of the discrete version of Schramm's formula for the loop-erased random walk derived by Kenyon. The explicit formula in terms of the Green function relies on the use of a complex connection on a graph, for which a line bundle Laplacian is defined. We give explicit …