The abelian sandpile group on a grid has a beautiful bijection with spanning trees via the "burning algorithm." A stable sandpile configuration is recurrent iff it passes the burning test — and recurrent configs biject with spanning trees of the graph.