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

@article{Kenyon2014SpanningTO,
  title={Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs},
  author={Richard W. Kenyon and D. Wilson},
  journal={Journal of the American Mathematical Society},
  year={2014},
  volume={28},
  pages={985-1030}
}
  • Richard W. Kenyon, D. Wilson
  • Published 2014
  • Mathematics
  • Journal of the American Mathematical Society
  • 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 ${\mathbb Z}^2$, that is, the probability that the walk from (0,0) to infinity passes through a given vertex or edge. For example, the probability that it passes through (1,0) is 5/16; this confirms a conjecture from 1994 about the stationary sandpile density on… CONTINUE READING
    30 Citations
    Transfer current and pattern fields in spanning trees
    • 5
    • PDF
    The Looping Rate and Sandpile Density of Planar Graphs
    • 17
    • PDF
    Scaling limit of the loop-erased random walk Green’s function
    • 17
    • PDF
    Probability on Trees and Networks
    • 482
    • PDF
    Boundary Correlations in Planar LERW and UST
    • 17
    • PDF
    Multipoint correlators in the Abelian sandpile model
    • 1
    • Highly Influenced
    • PDF
    Sandpiles and unicycles on random planar maps
    • 9
    • PDF

    References

    SHOWING 1-10 OF 45 REFERENCES
    Boundary Partitions in Trees and Dimers
    • 53
    • PDF
    Conformal invariance of planar loop-erased random walks and uniform spanning trees
    • 480
    • PDF
    The Problem of Predecessors on Spanning Trees
    • 13
    • PDF
    Double-Dimer Pairings and Skew Young Diagrams
    • 34
    • PDF
    Spanning forests and the vector bundle Laplacian
    • 84
    • Highly Influential
    • PDF
    Uniform spanning forests
    • 193
    • PDF
    Generating random spanning trees more quickly than the cover time
    • 410
    • PDF
    The Laplacian and Dirac operators on critical planar graphs
    • 58
    • PDF
    Local statistics of lattice dimers
    • 185
    • PDF