Logo

Mathematical Sciences Research Institute

Home » Chip-firing games, potential theory on graphs, and spanning trees

Seminar

Chip-firing games, potential theory on graphs, and spanning trees April 26, 2012 (10:00 AM PDT - 11:00 AM PDT)
Parent Program: --
Location: MSRI: Simons Auditorium
Speaker(s) Matt Baker, UC Berkeley
Description No Description
Video
No Video Uploaded
Abstract/Media

Using the interplay between chip-firing games and potential theory on graphs, we present an "efficient bijective" proof of Kirchhoff\'s matrix-tree theorem and a new algorithm for sampling random spanning trees which does not utilize random walks.
This is joint work with Farbod Shokrieh.

No Notes/Supplements Uploaded No Video Files Uploaded