Related papers: Chip-Firing and Rotor-Routing on Directed Graphs
The abelian sandpile model is a simple combinatorial model for critical behaviour which has the "abelian property" that the order in which we make moves does not change the final outcome of the game. This might seem to restrict the model's…
In this paper we study the abelian sandpile model on the two-dimensional grid with uniform neighborhood, and prove that any family of neighborhoods defined as scalings of a continuous non-flat shape can ultimately perform crossing.
Graphical chip-firing is a discrete dynamical system where chips are placed on the vertices of a graph and exchanged via simple firing moves. Recent work has sought to generalize chip-firing on graphs to higher dimensions, wherein graphs…
The development of multi-core processor systems is a demanded branch of science and technology. The appearance of processors with dozens and hundreds of cores poses to the developers the question of choosing the optimal topology capable to…
We study the limit shape of the boundary of the leaky sandpile model on isoradial graphs. These graphs are equipped with conductances and masses introduced by Boutillier, de Tili\`ere and Raschel, which are defined with the help of the…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
This contribution is a review of the deep and powerful connection between the large scale properties of critical systems and their description in terms of a field theory. Although largely applicable to many other models, the details of this…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…
It is conjectured that there exist finitely many isomorphism classes of simple endomorphism algebras of abelian varieties of GL_2-type over \Q of bounded dimension. We explore this conjecture when particularized to quaternion endomorphism…
The theory of fractal tilings of fractal blow-ups is extended to graph-directed iterated function systems, resulting in generalizations and extensions of some of the theory of Anderson and Putnam and of Bellisard et al. regarding…
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
Kinetic self-avoiding trails are introduced and used to generate a substrate of randomly quenched flow vectors. Sandpile model is studied on such a substrate with asymmetric toppling matrices where the precise balance between the net…
We discuss the relation between self-organized criticality and depinning transitions by mapping sandpile models to equations that describe driven interfaces in random media. This equivalence yields a continuum description and gives insight…
We show that abelian surfaces (and consequently curves of genus 2) over totally real fields are potentially modular. As a consequence, we obtain the expected meromorphic continuation and functional equations of their Hasse--Weil zeta…
The rotor-router model on a graph describes a discrete-time walk accompanied by the deterministic evolution of configurations of rotors randomly placed on vertices of the graph. We prove the following property: if at some moment of time,…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
The Abelian sandpile model was the first example of a self-organized critical system studied by Bak, Tang and Wiesenfeld. The dynamics of the sandpiles occur when the grains topple over a graph. In this study, we allow the graph to evolve…