Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs

Source abstract

We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the “intensity” of the loop-erased random walk in Z 2 \mathbb {Z}^2 , that is, the probability that the walk from ( 0 , 0 ) (0,0) to ∞ \infty passes through a given vertex or edge. For example, the probability that it passes through ( 1 , 0 ) (1,0) is 5 / 16 5/16 ; this confirms a conjecture from 1994 about the stationary sandpile density on Z 2 \mathbb {Z}^2 . We do the analogous computation for the triangular lattice, honeycomb lattice, and Z × R \mathbb {Z}\times \mathbb {R} , for which the probabilities are 5 / 18 5/18 , 13 / 36 13/36 , and 1 / 4 − 1 / π 2 1/4-1/\pi ^2 respectively.