Chip-firing games, potential theory on graphs, and spanning trees

M Baker, F Shokrieh - Journal of Combinatorial Theory, Series A, 2013 - Elsevier
We study the interplay between chip-firing games and potential theory on graphs,
characterizing reduced divisors (G-parking functions) on graphs as the solution to an energy …

[HTML][HTML] Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph

V Kiss, L Tóthmérész - Discrete Applied Mathematics, 2015 - Elsevier
Baker and Norine introduced a graph-theoretic analogue of the Riemann–Roch theory. A
central notion in this theory is the rank of a divisor. In this paper we prove that computing the …

[HTML][HTML] On approximating the rank of graph divisors

K Bérczi, HP Hoang, L Tóthmérész - Discrete Mathematics, 2023 - Elsevier
Baker and Norine initiated the study of graph divisors as a graph-theoretic analogue of the
Riemann-Roch theory for Riemann surfaces. One of the key concepts of graph divisor theory …

[PDF][PDF] The chip-firing game

L Tóthmérész - 2016 - core.ac.uk
This thesis is about three related topics, chip-firing, graph divisor theory and rotorrouting.
Chip-firing and rotor-routing are simple, yet interesting diffusion processes on graphs, that …

Weierstrass Vertices and Divisor Theory of Graphs

ARC De Vas Gunasekara - 2018 - stars.library.ucf.edu
Chip-firing games and divisor theory on finite, connected, undirected and unweighted
graphs have been studied as analogs of divisor theory on Riemann Surfaces. As part of this …