A chip-firing game and Dirichlet eigenvalues

We consider a variation of the chip-firing game in an induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its degree, we can fire v by sending one chip along each edge from v to its neighbors. Chips are removed at the boundary δS. The game continues until no vertex can be fired. We will give an upper bound, in terms of Dirichlet eigenvalues, for the number of firings needed before a game terminates. We also examine the relations among three equinumerous families, the set of spanning forests on S with roots in the boundary of S, a set of "critical" configurations of chips, and a coset group, called the sandpile group associated with S.

[1]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[2]  W. T. Tutte.  Graph Theory , 1984 .

[3]  David M. Raup,et al.  How Nature Works: The Science of Self-Organized Criticality , 1997 .

[4]  Fan Chung Graham,et al.  A Combinatorial Laplacian with Vertex Weights , 1996, J. Comb. Theory, Ser. A.

[5]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[6]  Andrei Gabrielov,et al.  Abelian avalanches and Tutte polynomials , 1993 .

[7]  Eric Goles Ch.,et al.  Parallel Chip Firing Games on Graphs , 1992, Theor. Comput. Sci..

[8]  Norman Biggs.  The Tutte Polynomial as a Growth Function , 1999 .

[9]  D. Dhar,et al.  Algebraic aspects of Abelian sandpile models , 1995 .

[10]  Norman Biggs,et al.  Chip-Firing and the Critical Group of a Graph , 1999 .

[11]  Robert Cori,et al.  On the Sandpile Group of Dual Graphs , 2000, Eur. J. Comb..

[12]  Tang,et al.  Self-organized criticality. , 1988, Physical review. A, General physics.

[13]  Dhar,et al.  Self-organized critical state of sandpile automaton models. , 1990, Physical review letters.

[14]  László Lovász,et al.  Chip-firing Games on Graphs , 1991, Eur. J. Comb..

[15]  László Lovász,et al.  Chip-Firing Games on Directed Graphs , 1992 .

[16]  Jan van den Heuvel,et al.  Algorithmic Aspects of a Chip-Firing Game , 2001, Combinatorics, Probability and Computing.

[17]  O. Wing.  Enumeration of Trees , 1963 .

[18]  Criel Merino López.  Chip firing and the tutte polynomial , 1997 .

[19]  Robert Cori,et al.  On the Sandpile Group of a Graph , 2000 .

[20]  Martin Nilsson,et al.  The Computational Complexity of Sandpiles , 1999 .

[21]  J. Spencer,et al.  Disks, balls, and walls: analysis of a combinatorial game , 1989 .