The following pages link to Chip-firing games on graphs (Q805639):
Displaying 50 items.
- On the complexity of sandpile prediction problems (Q2811962) (← links)
- An Essay on the Riemann Hypothesis (Q2826808) (← links)
- Chip-firing, antimatroids, and polyhedra (Q2851431) (← links)
- Distributive lattice polyhedra (Q2851507) (← links)
- Parallel chip-firing on the complete graph: Devil’s staircase and Poincaré rotation number (Q3012886) (← links)
- The Riemann–Roch strategy (Q3297173) (← links)
- A Geometric Characterization of Poly-antimatroids (Q3439605) (← links)
- Two sided Sand Piles Model and unimodal sequences (Q3526421) (← links)
- On enumeration of conjugacy classes of Coxeter elements (Q3542033) (← links)
- ULD-Lattices and Δ-Bonds (Q3552499) (← links)
- Recognition of Antimatroidal Point Sets (Q3655154) (← links)
- No Polynomial Bound for the Chip Firing Game on Directed Graphs (Q3974530) (← links)
- (Q4320812) (← links)
- (Q4331212) (← links)
- Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three (Q4555049) (← links)
- (Q4622630) (← links)
- Algebraic Properties of Generalized Graph Laplacians: Resistor Networks, Critical Groups, and Homological Algebra (Q4641761) (← links)
- The Tutte polynomial (Q4704790) (← links)
- Mixing of random walks and other diffusions on a graph (Q4841309) (← links)
- Signed Chip Firing Games and symmetric Sandpile Models on the cycles (Q4928763) (← links)
- On lengths of burn-off chip-firing games (Q4995310) (← links)
- “Pass the Buck” on a Complete Binary Tree (Q5048684) (← links)
- Toppleable permutations, excedances and acyclic orientations (Q5052168) (← links)
- The sandpile group of a thick cycle graph (Q5054061) (← links)
- Abelian networks IV. Dynamics of nonhalting networks (Q5063346) (← links)
- (Q5088675) (← links)
- Laplacian growth, sandpiles, and scaling limits (Q5122445) (← links)
- Mixing time and eigenvalues of the abelian sandpile Markov chain (Q5243105) (← links)
- On the complexity of the chip-firing reachability problem (Q5270136) (← links)
- The distribution of sandpile groups of random graphs (Q5280066) (← links)
- Height probabilities in the Abelian sandpile model on the generalized finite Bethe lattice (Q5407664) (← links)
- Computational Science - ICCS 2004 (Q5712680) (← links)
- Passing the Buck and Firing Fibonacci: Adventures with the Stochastic Abacus (Q5742460) (← links)
- Random Walks, Electric Networks and The Transience Class problem of Sandpiles (Q5743503) (← links)
- Sorting via chip-firing (Q5916022) (← links)
- Enumerating linear systems on graphs (Q5918971) (← links)
- Recognizing hyperelliptic graphs in polynomial time (Q5919531) (← links)
- Sorting via chip-firing (Q5920071) (← links)
- Finite record sets of chip-firing games (Q6060071) (← links)
- “Pass the Buck” on a Rooted Tree (Q6069793) (← links)
- A greedy chip‐firing game (Q6074879) (← links)
- On approximating the rank of graph divisors (Q6098103) (← links)
- On a relationship between the characteristic and matching polynomials of a uniform hypertree (Q6204332) (← links)
- Cup stacking in graphs (Q6553185) (← links)
- Some statistics about tropical sandpile model (Q6590892) (← links)
- Anisotropic higher rank \(\mathbb{Z}_N\) topological phases on graphs (Q6593873) (← links)
- Generalized ARRIVAL problem for rotor walks in path multigraphs (Q6623027) (← links)
- The distribution of sandpile groups of random graphs with their pairings (Q6631317) (← links)
- Labeled chip-firing on binary trees with \(2^n -1\) chips (Q6644276) (← links)
- Ending states of a special variant of the chip-firing algorithm (Q6659990) (← links)
