Chip-firing games on directed graphs
From MaRDI portal
Publication:685991
DOI10.1023/A:1022467132614zbMATH Open0805.90142OpenAlexW105010561MaRDI QIDQ685991FDOQ685991
Authors: Anders Bjoerner, László Lovász 
Publication date: 31 January 1995
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022467132614
Recommendations
Laplace operatorreachabilitychip-firing gamePetri netprobabilistic abacusreandom walkvector addition system
Directed graphs (digraphs), tournaments (05C20) Sums of independent random variables; random walks (60G50) Games involving graphs (91A43)
Cites Work
- Eigenvalues and expanders
- Chip-firing games on graphs
- Parallel program schemata
- Title not available (Why is that?)
- Introduction to Greedoids
- Balancing vectors in the max norm
- The probabilistic abacus
- Why does the probabilistic abacus work?
- Disks, Balls, and Walls: Analysis of a Combinatorial Game
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for the General Petri Net Reachability Problem
- Title not available (Why is that?)
- Chip-Firing Games on Mutating Graphs
- Polynomial Bound for a Chip Firing Game on Graphs
- No Polynomial Bound for the Chip Firing Game on Directed Graphs
Cited In (73)
- Computational Science - ICCS 2004
- The multivariate avalanche polynomial
- Experimental research on the welfare in a closed production network
- Finite record sets of chip-firing games
- A greedy chip‐firing game
- Generalized ARRIVAL problem for rotor walks in path multigraphs
- Geometric and spectral analysis on weighted digraphs
- Labeled chip-firing on binary trees with \(2^n -1\) chips
- On approximating the rank of graph divisors
- Probabilistic logarithmic-space algorithms for Laplacian solvers
- Abelian networks IV. Dynamics of nonhalting networks
- Chip-firing based methods in the Riemann-Roch theory of directed graphs
- Compatible recurrent identities of the sandpile group and maximal stable configurations
- Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models
- Markov chain methods for analyzing urban networks
- Spanning trees and recurrent configurations of a graph
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
- Dynamic graph models and their properties
- Enumerating degree sequences in digraphs and a cycle--cocycle reversing system
- Multi-Eulerian tours of directed graphs
- The sandpile group of a family of nearly complete graphs
- Universality of the chip-firing game
- Source reversal and chip firing on graphs
- Random walks and flights over connected graphs and complex networks
- Chip-firing and the critical group of a graph
- Root system chip-firing. I: Interval-firing
- Chip firing and the Tutte polynomial
- On the sandpile group of regular trees
- Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
- Sandpile models and lattices: a comprehensive survey
- Classes of lattices induced by chip firing (and sandpile) dynamics.
- Resource allocation among attractor vertices in asymmetric regular resource networks
- Resource network with limited capacity of attractor vertices
- On the complexity of the chip-firing reachability problem
- Abelian networks. II: Halting on all inputs
- Title not available (Why is that?)
- A survey on the stability of (extended) linear Sand Pile model
- Chip firing on Dynkin diagrams and McKay quivers
- A chip-firing game and Dirichlet eigenvalues
- Strong convergence and the polygon property of 1-player games
- Properties of chip-firing games on complete graphs
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Chip firing on general invertible matrices
- Minimal recurrent configurations of chip firing games and directed acyclic graphs
- Directed elimination games
- A study of Euler resource networks
- Strict partitions and discrete dynamical systems
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs
- Order structure and energy of conflicting chip firing game
- The chip-firing game
- A maximizing characteristic for critical configurations of chip-firing games on digraphs
- Signed chip firing games and symmetric sandpile models on the cycles
- ULD-lattices and \(\Delta \)-bonds
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs
- On the complexity of sandpile prediction problems
- A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case
- Rotor-routing reachability is easy, chip-firing reachability is hard
- On a game in directed graphs.
- CoEulerian graphs
- The sandpile group of a thick cycle graph
- Algorithmic aspects of rotor-routing and the notion of linear equivalence
- Reachability is decidable in the numbers game
- Some halting problems for abelian sandpiles are undecidable in dimension three
- Title not available (Why is that?)
- Height probabilities in the Abelian sandpile model on the generalized finite Bethe lattice
- Chip-Firing and Rotor-Routing on Directed Graphs
- Chip-firing games and critical groups
- Chip-firing, antimatroids, and polyhedra
- Integral flow and cycle chip-firing on graphs
- Algorithmic aspects of a chip-firing game
- Growth of replacements
- Control of limit states in absorbing resource networks
- Strong emergence of wave patterns on Kadanoff sandpiles
This page was built for publication: Chip-firing games on directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685991)
