Chip-firing games on graphs

Abstract

This thesis is based on chip-firing games as discussed in the following papers: - Chip-firing, potential theory, spanning trees - Baker, Shokrieh - Chipfiring games on graphs – Bjorner - Chipfiring games on directed graphs – Bjorner - Signed chipfiring games on weighted graphs - J.-H. Park

These papers (and others) will be used to find answers to a few questions regarding chip-firing games. How do they work? Can we encapsulate them in a nice mathematical structure? Can we find efficient algorithms to determine equivalence classes? How are chipfiring games connected to spanning trees?