Chip-Firing Games on Mutating Graphs

DOI10.1137/S0895480192240287MaRDI QIDQ4875440zbMATH OpenOpenAlexFDO

Authors Kimmo Eriksson

Publication date 24 April 1996

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480192240287

zbMATH Keywords

chip-firing gameeulerian graphsgame lengthmutating graphsperiod length

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• Chip-firing games on graphs
• Parallel chip firing games on graphs
• scientific article; zbMATH DE number 718855
• The chip firing game on \(n\)-cycles
• Polynomial Bound for a Chip Firing Game on Graphs

Cited in

(13)

• Classes of lattices induced by chip firing (and sandpile) dynamics.
• Activated Random Walks on \(\mathbb{Z}^d\)
• Activated random walk on a cycle
• Non-fixation for conservative stochastic dynamics on the line
• The chip-firing game
• Uniform threshold for fixation of the stochastic sandpile model on the line
• Abelian networks. I: Foundations and examples
• Absorbing-state phase transition for driven-dissipative stochastic dynamics on Z
• scientific article; zbMATH DE number 718855 (Why is no real title available?)
• scientific article; zbMATH DE number 1741027 (Why is no real title available?)
• Chip-firing games on directed graphs
• Cleaning a network with brushes
• Activated random walkers: facts, conjectures and challenges

This page was built for publication: Chip-Firing Games on Mutating Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875440)