Related papers: Chip-Firing and Rotor-Routing on Directed Graphs
We extend the duality between acyclic orientations and totally cyclic orientations on planar graphs to dualities on graphs on orientable surfaces by introducing boundary acyclic orientations and totally bi-walkable orientations. In…
We develop technics of birational geometry to study automorphisms of affine surfaces admitting many distinct rational fibrations, with a particular focus on the interactions between automorphisms and these fibrations. In particular, we…
Chip-firing is a combinatorial game played on a graph in which we place and disperse chips on vertices until a stable state is reached. We study a chip-firing variant played on an infinite rooted directed $k$-ary tree, where we place…
We study labeled chip-firing on binary trees and some of its modifications. We prove a sorting property of terminal configurations of the process. We also analyze the endgame moves poset and prove that this poset is a modular lattice.
Building on earlier work of Diaconis and Fulton (1991) and Lawler, Bramson, and Griffeath (1992), Propp in 2001 defined a deterministic analogue of internal diffusion-limited aggregation. This growth model is a "convergent game" of the sort…
Model repair is an essential topic in model-driven engineering. Since models are suitably formalized as graph-like structures, we consider the problem of rule-based graph repair: Given a rule set and a graph constraint, try to construct a…
Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose order is the number of oriented…
We consider the nonabelian sandpile model defined on directed trees by Ayyer, Schilling, Steinberg and Thi\'ery (Commun. Math. Phys, 2013) and restrict it to the special case of a one-dimensional lattice of $n$ sites which has open…
This paper investigates circle patterns with obtuse exterior intersection angles on surfaces of finite topological type. We characterise the images of the curvature maps and establish several equivalent conditions regarding long time…
We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum…
We use techniques from the theory of electrical networks to give nearly tight bounds for the transience class of the Abelian sandpile model on the two-dimensional grid up to polylogarithmic factors. The Abelian sandpile model is a discrete…
The paper contributes to building algebraic foundations of self-organized criticality answering a previously unsolved question about the limiting structure of the extended sandpile group as well as relating it to another limit at the level…
The sandpile group of a connected graph is a finite abelian group whose cardinality is the number of spanning trees in the graph. We compute the spanning tree number and sandpile group structure for the cone over a bi-coconut tree,…
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-product of our result we significantly improve the estimate of…
Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…
We study the distribution of algebraic points on curves in abelian varieties over finite fields.
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
We consider a special scattering experiment with n particles in $\mathbb{R}^{n-3,1}$. The scattering equations in this set-up become the saddle-point equations of a Penner-like matrix model, where in the large $n$ limit, the spectral curve…