Chip firing on general invertible matrices
From MaRDI portal
Publication:2808165
Abstract: We propose a generalization of the graphical chip-firing model allowing for the redistribution dynamics to be governed by any invertible integer matrix while maintaining the long term critical, superstable, and energy minimizing behavior of the classical model.
Recommendations
Cites work
- Abelian networks. II: Halting on all inputs
- An introduction to the geometry of numbers.
- Asymmetric Abelian sandpile models
- Chip-firing and energy minimization on M-matrices
- Chip-firing and the critical group of a graph
- Chip-firing games on graphs
- Chip-firing games, potential theory on graphs, and spanning trees
- Computing the Continuous Discretely
- Critical groups of simplicial complexes
- M-matrix characterizations. I: nonsingular M-matrices
- Maximum principle and uniform convergence for the finite element method
- Primer for the algebraic geometry of sandpiles
- Self-organized critical state of sandpile automaton models
- Self-organized criticality
- Stabilized Galerkin approximation of convection-diffusion-reaction equations: discrete maximum principle and convergence
- Trees, parking functions, syzygies, and deformations of monomial ideals
This page was built for publication: Chip firing on general invertible matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808165)
