Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z^2

Details Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z^2 Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z^2

2011-07-18

arxiv.org/abs/1107.3377v1

Mathematics

Probability

62 pages, 53 figures

Scientific paper

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, 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 15-year old conjecture about the stationary sandpile density on Z^2. We do the analogous computation for the triangular lattice, honeycomb lattice and Z x R, for which the probabilities are 5/18, 13/36, and 1/4-1/\pi^2 respectively.

Affiliated with

Also associated with

No associations

Rating

Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z^2 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z^2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z^2 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271210