Abelian networks IV. Dynamics of nonhalting networks
DOI10.1090/memo/1358zbMath1485.05074arXiv1804.03322OpenAlexW2797617178MaRDI QIDQ5063346
Publication date: 17 March 2022
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.03322
critical groupGrothendieck groupconfluenceexchange lemmarotor walkabelian distributed processorsburning algorithmcommutative monoid actionsandpile groupremoval lemmachip-firingcycle-rooted spanning forestEulerian walkersabelian mobile agentsatemporal dynamicsinjective action
Commutative semigroups (20M14) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite abelian groups (20K01) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Semigroups in automata theory, linguistics, etc. (20M35) Combinatorial dynamics (types of periodic orbits) (37E15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Abelian networks. III: The critical group
- Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
- A theory of transformation monoids: combinatorics and representation theory
- Spanning forests and the vector bundle Laplacian
- Chip firing on Dynkin diagrams and McKay quivers
- Chip-firing games on directed graphs
- Chip-firing games on graphs
- Abelian networks. II: Halting on all inputs
- Growth rates and explosions in sandpiles
- Arithmetical graphs
- Parallel chip firing games on graphs
- Asymmetric Abelian sandpile models
- Chip-firing and the critical group of a graph
- No polynomial bound for the period of the parallel chip firing game on graphs
- Universality of the chip-firing game
- Counting arithmetical structures on paths and cycles
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs
- Algorithmic aspects of rotor-routing and the notion of linear equivalence
- Quasi-random rumor spreading: reducing randomness can be costly
- Chip-firing and energy minimization on M-matrices
- Threshold state and a conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle
- Determinants of Laplacians on graphs
- Arithmetical structures on graphs
- Deterministic random walks on the integers
- Irreducible actions.
- Parallel Quantum Computation and Quantum Codes
- CoEulerian graphs
- Abelian Networks I. Foundations and Examples
- Probability on Trees and Networks
- Chip-Firing and Riemann-Roch Theory for Directed Graphs
- Parallel chip-firing on the complete graph: Devil’s staircase and Poincaré rotation number
- Rotor Walks and Markov Chains
- Chip-Firing and Rotor-Routing on Directed Graphs
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Introduction to Greedoids
- Self-organized critical state of sandpile automaton models
- Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three
- Trees, parking functions, syzygies, and deformations of monomial ideals
- Abelian Logic Gates
- Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game
- On the complexity of the chip-firing reachability problem
