BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A random walk proof of Kirchhoff's matrix tree theorem - Kozdron\,
  M (University of Regina)
DTSTART:20150617T103000Z
DTEND:20150617T113000Z
UID:TALK59841@talks.cam.ac.uk
CONTACT:42080
DESCRIPTION:Kirchhoff's matrix tree theorem relates the number of spanning
  trees in a graph to the determinant of a matrix derived from the graph. T
 here are a number of proofs of Kirchhoff's theorem known\, most of which a
 re combinatorial in nature. In this talk we will present a relatively elem
 entary random walk-based proof of Kirchhoff's theorem due to Greg Lawler w
 hich follows from his proof of Wilson's algorithm. Moreover\, these same i
 deas can be applied to other computations related to general Markov chains
  and processes on a finite state space. Based in part on joint work with L
 arissa Richards (Toronto) and Dan Stroock (MIT).\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR