English

Chip-firing and energy minimization on M-matrices

Combinatorics 2014-11-24 v2

Abstract

We consider chip-firing dynamics defined by arbitrary M-matrices. M-matrices generalize graph Laplacians and were shown by Gabrielov to yield avalanche finite systems. Building on the work of Baker and Shokrieh, we extend the concept of energy minimizing chip configurations. Given an M-matrix, we show that there exists a unique energy minimizing configuration in each equivalence class defined by the matrix. We define the class of zz-superstable configurations which satisfy a strictly stronger stability requirement than superstable configurations (equivalently GG-parking functions or reduced divisors). We prove that for any M-matrix, the zz-superstable configurations coincide with the energy minimizing configurations. Moreover, we prove that the zz-superstable configurations are in simple duality with critical configurations. Thus for all avalanche-finite systems (including all directed graphs with a global sink) there exist unique critical, energy minimizing and zz-superstable configurations. The critical configurations are in simple duality with energy minimizers which coincide with zz-superstable configurations.

Keywords

Cite

@article{arxiv.1403.1635,
  title  = {Chip-firing and energy minimization on M-matrices},
  author = {Johnny Guzmán and Caroline Klivans},
  journal= {arXiv preprint arXiv:1403.1635},
  year   = {2014}
}

Comments

11 pages, revised version, to appear in JCTA