Chip-Firing Games on Mutating Graphs

DOI10.1137/S0895480192240287zbMATH Open0844.90140OpenAlexW2059862500MaRDI QIDQ4875440FDOQ4875440

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

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

zbMATH Keywords

chip-firing gameperiod lengthgame lengtheulerian graphsmutating graphs

Mathematics Subject Classification ID

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

Cited In (13)

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

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)