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.