UW Probability Seminar
Time: Monday, December 5, 2011 at 2:30 pm.
Location: LOW 102
Speaker: David Wilson (Microsoft Research)
Title: Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z^2
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, 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. (Joint work with Richard Kenyon.)
Archive of previous talks
The University of Washington is committed to providing access, equal opportunity and reasonable accommodation in its services, programs, activities, education and employment for individuals with disabilities. To request disability accommodation contact the Disability Services Office at least ten days in advance at: 206-543-6450 (voice), 206-543-6452 (TTY), 206-685-7264 (FAX), or dso@u.washington.edu
| Mathematics Department |  |
University of Washington |