BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:A random walk proof of Kirchhoff's matrix tree the
orem - Kozdron\, M (University of Regina)
DTSTART;TZID=Europe/London:20150617T113000
DTEND;TZID=Europe/London:20150617T123000
UID:TALK59841AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/59841
DESCRIPTION:Kirchhoff's matrix tree theorem relates the number
of spanning trees in a graph to the determinant o
f a matrix derived from the graph. There are a num
ber of proofs of Kirchhoff's theorem known\, most
of which are combinatorial in nature. In this talk
we will present a relatively elementary random wa
lk-based proof of Kirchhoff's theorem due to Greg
Lawler which follows from his proof of Wilson's al
gorithm. Moreover\, these same ideas can be applie
d to other computations related to general Markov
chains and processes on a finite state space. Base
d in part on joint work with Larissa Richards (Tor
onto) and Dan Stroock (MIT).\n
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:
END:VEVENT
END:VCALENDAR