Chip-Firing and Rotor-Routing on Directed Graphs
From MaRDI portal
Abstract: We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguing open problems.
Recommendations
Cited in
(only showing first 100 items - show all)- The sandpile group of a tree
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs
- Algorithmic aspects of rotor-routing and the notion of linear equivalence
- Chip-firing on trees of loops
- G-parking functions and tree inversions
- \(R\)-systems
- Sandpiles on the square lattice
- Sandpile models
- A maximizing characteristic for critical configurations of chip-firing games on digraphs
- Generators of invariant linear system on tropical curves for finite isometry group
- Combinatorial, piecewise-linear, and birational homomesy for products of two chains
- Random walks with local memory
- A family of matrix-tree multijections
- Rotor-routing reachability is easy, chip-firing reachability is hard
- Convergence of the random abelian sandpile
- Dynamic dimensional reduction in the abelian sandpile
- Random integral matrices: universality of surjectivity and the cokernel
- Mean-field avalanche size exponent for sandpiles on Galton-Watson trees
- Compatible recurrent identities of the sandpile group and maximal stable configurations
- Asymptotic height distribution in high-dimensional sandpiles
- Critical group structure from the parameters of a strongly regular graph
- The rotor-routing torsor and the Bernardi torsor disagree for every non-planar ribbon graph
- Variation of Tamagawa numbers of Jacobians of hyperelliptic curves with semistable reduction
- The sandpile groups of chain-cyclic graphs
- Chip-firing and energy minimization on M-matrices
- Sandpiles and dominos
- Limit linear series and the Amini-Baker construction
- Differential posets and restriction in critical groups
- Threshold state and a conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle
- Directed nonabelian sandpile models on trees
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs
- Indistinguishability of trees in uniform spanning forests
- Geometric bijections between spanning trees and break divisors
- Applying the Kirchhoff relations in proofs of theorems on graph operations that do not affect the structure of the sandpile groups of graphs
- Robustness of the rotor-router mechanism
- Non-fixation for conservative stochastic dynamics on the line
- Direction-reversing quasi-random rumor spreading with restarts
- Homomesy in products of two chains
- Differential posets, Cayley graphs, and critical groups
- Genus from sandpile torsor algorithm
- Principal specializations of Schubert polynomials and pattern containment
- A combinatorial mapping for the higher-dimensional matrix-tree theorem
- Learning about critical phenomena from scribbles and sandpiles
- Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere
- CoEulerian graphs
- Abelian networks. I: Foundations and examples
- Multi-Eulerian tours of directed graphs
- Degeneration of linear series from the tropical point of view and applications
- Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting
- Chip-firing and Riemann-Roch theory for directed graphs
- Abelian networks. III: The critical group
- Parallel chip-firing on the complete graph: Devil’s staircase and Poincaré rotation number
- Parking functions and tree inversions revisited
- A sandpile model for proportionate growth
- Proportionate growth in patterns formed in the rotor-router model
- Spiral structures in the rotor-router walk
- Sandpiles, spanning trees, and plane duality
- Exact computation and approximation of stochastic and analytic parameters of generalized Sierpinski gaskets
- Linear systems on tropical curves
- A tropical proof of the Brill-Noether theorem
- scientific article; zbMATH DE number 1156591 (Why is no real title available?)
- The sandpile cellular automaton
- Minimal configurations and sandpile measures
- The range of a rotor walk
- Chip-firing and rotor-routing on Z^d and on trees
- Divisors and sandpiles. An introduction to chip-firing
- The multivariate avalanche polynomial
- Algebraic properties of generalized graph Laplacians: resistor networks, critical groups, and homological algebra
- Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
- Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
- Infinite-step stationarity of rotor walk and the wired spanning forest
- Determining genus from sandpile torsor algorithms
- Reachability Switching Games
- Abelian networks IV. Dynamics of nonhalting networks
- Critical groups for Hopf algebra modules
- Laplacian growth, sandpiles, and scaling limits
- The distribution of sandpile groups of random regular graphs
- Rotor walks on transient graphs and the wired spanning forest
- Abelian logic gates
- Mixing time and eigenvalues of the abelian sandpile Markov chain
- On the complexity of the chip-firing reachability problem
- The distribution of sandpile groups of random graphs
- Infinite excursions of router walks on regular trees
- Perfect boundaries in rotor-router aggregation on cylinders
- Height probabilities in the Abelian sandpile model on the generalized finite Bethe lattice
- Minimal free resolutions of the \(G\)-parking function ideal and the toppling ideal
- The chip-firing game and the sandpile model
- Enumerating linear systems on graphs
- A greedy chip‐firing game
- On Torsor Structures on Spanning Trees
- Recurrence of horizontal-vertical walks
- Abelian sandpiles on Sierpiński gasket graphs
- A shape theorem for exploding sandpiles
- Integer superharmonic matrices on the \(F\)-lattice
- Sandpile groups and spanning trees of directed line graphs
- Proppian random walks in Z
- Random rotor walks and i.i.d. sandpiles on Sierpiński graphs
- Generalized ARRIVAL problem for rotor walks in path multigraphs
- Labeled chip-firing on binary trees with 2ⁿ -1 chips
- On the sandpile group of the cone of a graph
This page was built for publication: Chip-Firing and Rotor-Routing on Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537737)
