How Hard is it to Predict Sandpiles on Lattices? A Survey

DOI10.3233/FI-2020-1879zbMath1445.37006arXiv1909.12150MaRDI QIDQ5114215

Kévin Perrot, Enrico Formenti

Publication date: 21 June 2020

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

sandpile modelsprediction problembehavioral complexity

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Complexity of computation (including implicit computational complexity) (03D15) Simulation of dynamical systems (37M05) Dynamics of disordered systems (random Ising systems, etc.) in time-dependent statistical mechanics (82C44) Dynamical aspects of statistical mechanics (37A60)

Related Items (3)

Embedding arbitrary Boolean circuits into fungal automata ⋮ Freezing sandpiles and Boolean threshold networks: equivalence and complexity ⋮ Sandpile toppling on Penrose tilings: identity and isotropic dynamics

This page was built for publication: How Hard is it to Predict Sandpiles on Lattices? A Survey