Candy-passing Games on General Graphs, I
  We undertake the first study of the candy-passing game on arbitrary connected graphs. We obtain a general stabilization result which encompasses the first author's results (arXiv:0709.2156) for candy-passing games on n-cycles with at least 3n candies. 
Paul M. Kominers, Scott D. Kominers