Integral flow and cycle chip-firing on graphs
Anton Dochtermann, Eli Meyers, Raghav Samavedan, Alex Yi

TL;DR
This paper introduces a new form of chip-firing based on integral flows and dual Laplacians, establishing connections with spanning trees and cycle bases, and explores its properties on various graphs.
Contribution
It develops a novel integral flow chip-firing framework using dual Laplacians, proving avalanche finiteness and establishing bijections with spanning trees.
Findings
Existence of M-bases with avalanche-finite firing rules
Bijection between superstable flow configurations and spanning trees
Cycle-based M-bases for planar graphs, K_5, and K_{3,3}
Abstract
Motivated by the notion of chip-firing on the dual graph of a planar graph, we consider `integral flow chip-firing' on an arbitrary graph . The chip-firing rule is governed by , the dual Laplacian of determined by choosing a basis for the lattice of integral flows on . We show that any graph admits such a basis so that is an -matrix, leading to a firing rule on these basis elements that is avalanche finite. This follows from a more general result on bases of integral lattices that may be of independent interest. Our results provide a notion of -superstable flow configurations that are in bijection with the set of spanning trees of . We show that for planar graphs, as well as for the graphs and , one can find such a flow M-basis that consists of cycles of the underlying graph. We consider the question for arbitrary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTheoretical and Computational Physics · Mathematical Dynamics and Fractals · Stochastic processes and statistical mechanics
