Chip-firing games on graphs

Research Horizons Seminar
Wednesday, November 30, 2011 - 12:05pm
1 hour (actually 50 minutes)
Skiles 005.
Georgia Tech.
I will discuss the theory of chip-firing games, focusing on the interplay between chip-firing games and potential theory on graphs. To motivate the discussion, I will give a new proof of "the pentagon game". I will discuss the concept of reduced divisors and various related algorithmic aspects of the theory. If time permits I will also give some applications, including an "efficient bijective" proof of Kirchhoff's matrix-tree theorem.