Addition of Recurrent Configurations in Chip Firing Games: Finding Minimal Recurrent Configurations with Markov Chains

DOI10.1007/978-3-642-15979-4_23zbMath1306.68115OpenAlexW1545457009MaRDI QIDQ4931211

Matthias Schulz

Publication date: 4 October 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15979-4_23

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Cellular automata (computational aspects) (68Q80)

Cites Work

• A chip-firing game and Dirichlet eigenvalues
• On the Addition of Recurrent Configurations of the Sandpile-Model
• Algebraic aspects of Abelian sandpile models

This page was built for publication: Addition of Recurrent Configurations in Chip Firing Games: Finding Minimal Recurrent Configurations with Markov Chains