Abelian networks. III: The critical group

DOI10.1007/s10801-015-0648-4zbMath1336.05057arXiv1409.0170OpenAlexW2964253584MaRDI QIDQ289043

Lionel Levine, Benjamin Bond

Publication date: 27 May 2016

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

abelian distributed processorsasynchronous computationburning algorithmchip firingcommutative monoid actionLaplacian latticesandpile groupscript algorithm

Mathematics Subject Classification ID

Commutative semigroups (20M14) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (11)

Abelian networks IV. Dynamics of nonhalting networks ⋮ The sandpile group of polygon rings and twisted polygon rings ⋮ Uniform threshold for fixation of the stochastic sandpile model on the line ⋮ Abelian sandpile model and Biggs-Merino polynomial for directed graphs ⋮ Abelian networks. II: Halting on all inputs ⋮ Absorbing-state phase transition and activated random walks with unbounded capacities ⋮ Sorting via chip-firing ⋮ Sorting via chip-firing ⋮ Abelian Networks I. Foundations and Examples ⋮ Abelian Logic Gates ⋮ The sandpile group of a polygon flower

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of transformation monoids: combinatorics and representation theory
• Abelian networks. II: Halting on all inputs
• The rotor-router model on regular trees
• Arithmetical graphs
• A finite group attached to the laplacian of a graph
• Asymmetric Abelian sandpile models
• Chip-firing and the critical group of a graph
• Chip-firing games, potential theory on graphs, and spanning trees
• Algebraic and combinatorial aspects of sandpile monoids on directed graphs
• Critical groups of simplicial complexes
• Chip-firing and energy minimization on M-matrices
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• On the structure of semigroups
• Abelian Networks I. Foundations and Examples
• Primer for the algebraic geometry of sandpiles
• Rotor Walks and Markov Chains
• Fast Simulation of Large-Scale Growth Models
• Two-Variable Zeta-Functions on Graphs and Riemann–Roch Theorems
• Simulating a Random Walk with Constant Error
• Bigraphical arrangements
• Chip-Firing and Rotor-Routing on Directed Graphs
• Simplicial matrix-tree theorems
• The lattice of integral flows and the lattice of integral cuts on a finite graph
• Self-organized critical state of sandpile automaton models
• Trees, parking functions, syzygies, and deformations of monomial ideals
• Generalized loop‐erased random walks and approximate reachability

This page was built for publication: Abelian networks. III: The critical group