On the predictability of the abelian sandpile model

DOI10.1007/S11047-021-09873-ZOpenAlexW3212745645MaRDI QIDQ6155033FDOQ6155033

Authors: J. Andres Montoya, Carolina Mejía 

Publication date: 16 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-021-09873-z

Recommendations

• The computational complexity of sandpiles
• How hard is it to predict sandpiles on lattices? A survey
• Avalanche prediction in abelian sandpile model
• On the complexity of sandpile critical avalanches
• Computational complexity of avalanches in the Kadanoff sandpile model

zbMATH Keywords

cellular automataproperty testingfirefighter problemabelian sandpile model

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Dynamical aspects of cellular automata (37B15)

Cites Work

• Self-organized criticality
• On the identity of the sandpile group
• Sublinear time algorithms
• The firefighter problem for graphs of maximum degree three
• The Firefighter problem: a survey of results, directions and questions
• On the complexity of sandpile critical avalanches
• Average firefighting on infinite grids

This page was built for publication: On the predictability of the abelian sandpile model

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