Chip-firing games, potential theory on graphs, and spanning trees
From MaRDI portal
Publication:1758511
DOI10.1016/j.jcta.2012.07.011zbMath1408.05089arXiv1107.1313OpenAlexW2066653142MaRDI QIDQ1758511
Farbod Shokrieh, Matthew H. Baker
Publication date: 9 November 2012
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1313
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Generalizations of potential theory (31C99) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (60)
Divisors on graphs, binomial and monomial ideals, and cellular resolutions ⋮ Abelian networks. III: The critical group ⋮ A Riemann-Roch Theorem on Infinite Graphs ⋮ Monomials, binomials and Riemann-Roch ⋮ Geometric bijections for regular matroids, zonotopes, and Ehrhart theory ⋮ Simplicial dollar game ⋮ Kirchhoff’s theorem for Prym varieties ⋮ Generalized bijective maps between \(G\)-parking functions, spanning trees, and the Tutte polynomial ⋮ Geometric bijections between spanning trees and break divisors ⋮ Chip-firing groups of iterated cones ⋮ Effective divisor classes on metric graphs ⋮ Fourientations and the Tutte polynomial ⋮ Abelian sandpile model and Biggs-Merino polynomial for directed graphs ⋮ On Torsor Structures on Spanning Trees ⋮ On approximating the rank of graph divisors ⋮ Critical groups of strongly regular graphs and their generalizations ⋮ A Torelli theorem for graph isomorphisms ⋮ Tropical moments of tropical Jacobians ⋮ On discrete gradient vector fields and Laplacians of simplicial complexes ⋮ The critical groups of Adinkras up to 2-rank of Cayley graphs ⋮ Chip-firing on trees of loops ⋮ Chip-Firing Games and Critical Groups ⋮ \(G\)-parking functions and tree inversions ⋮ Realization of groups with pairing as Jacobians of finite graphs ⋮ Critical groups of graphs with dihedral actions ⋮ Unnamed Item ⋮ Smoothing of Limit Linear Series on Curves and Metrized Complexes of Pseudocompact Type ⋮ The Riemann–Roch strategy ⋮ Chip firing on Dynkin diagrams and McKay quivers ⋮ Sandpiles on the square lattice ⋮ Integral flow and cycle chip-firing on graphs ⋮ Canonical measures on metric graphs and a Kazhdan's theorem ⋮ Riemann-Roch theory for graph orientations ⋮ A note on Brill-Noether existence for graphs of low genus ⋮ Computing graph gonality is hard ⋮ Chip-firing and energy minimization on M-matrices ⋮ Sandpiles and dominos ⋮ Graphs of gonality three ⋮ Recognizing hyperelliptic graphs in polynomial time ⋮ Gonality of expander graphs ⋮ Infinite reduction of divisors on metric graphs ⋮ GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ Stable divisorial gonality is in NP ⋮ A maximizing characteristic for critical configurations of chip-firing games on digraphs ⋮ Free divisors on metric graphs ⋮ Chip Firing on General Invertible Matrices ⋮ Enumerating linear systems on graphs ⋮ The distribution of Weierstrass points on a tropical curve ⋮ On power ideals of transversal matroids and their ``parking functions ⋮ Degeneration of Linear Series from the Tropical Point of View and Applications ⋮ Gonality Sequences of Graphs ⋮ Minimal free resolutions of the 𝐺-parking function ideal and the toppling ideal ⋮ CANONICAL REPRESENTATIVES FOR DIVISOR CLASSES ON TROPICAL CURVES AND THE MATRIX–TREE THEOREM ⋮ Mixing time and eigenvalues of the abelian sandpile Markov chain ⋮ Metric graphs, cross ratios, and Rayleigh's laws ⋮ On computation of Baker and Norine's rank on complete graphs ⋮ Linear series on metrized complexes of algebraic curves ⋮ Divisors on graphs, orientations, syzygies, and system reliability ⋮ Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
This page was built for publication: Chip-firing games, potential theory on graphs, and spanning trees
