Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models

DOI10.1007/978-3-319-92675-9_10OpenAlexW2964183982MaRDI QIDQ5886821

Kévin Perrot, Viet-Ha Nguyen

Publication date: 10 April 2023

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.00464

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15)

Related Items (2)

Freezing sandpiles and Boolean threshold networks: equivalence and complexity ⋮ Sandpile toppling on Penrose tilings: identity and isotropic dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of the bootstraping percolation and other problems
• Chip-firing games on directed graphs
• Crossing information in two-dimensional sandpiles
• The computational complexity of sandpiles
• Universality of the chip-firing game
• On the complexity of two-dimensional signed majority cellular automata
• On the Complexity of Sandpile Prediction Problems
• Polynomial Bound for a Chip Firing Game on Graphs
• Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles

This page was built for publication: Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models