Name
Abstract | ||
|---|---|---|
The critical group of an abelian network is a finite abelian group that governs the behavior of the network on large inputs. It generalizes the sandpile group of a graph. We show that the critical group of an irreducible abelian network acts freely and transitively on recurrent states of the network. We exhibit the critical group as a quotient of a free abelian group by a subgroup containing the image of the Laplacian, with equality in the case that the network is rectangular. We generalize Dhar's burning algorithm to abelian networks and estimate the running time of an abelian network on an arbitrary input up to a constant additive error. |
Year | DOI | Venue |
|---|---|---|
2014 | https://doi.org/10.1007/s10801-015-0648-4 | Journal of Algebraic Combinatorics |
Keywords | Field | DocType |
Abelian distributed processors,Asynchronous computation,Burning algorithm,Chip firing,Commutative monoid action,Laplacian lattice,Sandpile group,Script algorithm,05C25,05C50,20M14,20M35,68Q10 | Abelian group,Discrete mathematics,Free abelian group,Combinatorics,Elementary abelian group,Perfect group,G-module,Arithmetic of abelian varieties,Rank of an abelian group,Torsion subgroup,Mathematics | Journal |
Volume | Issue | ISSN |
43 | 3 | 0925-9899 |
Citations | PageRank | References |
1 | 0.36 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Bond | 1 | 1 | 0.36 |
| Lionel Levine | 2 | 31 | 5.43 |