Related papers: Chip-Firing and Rotor-Routing on Directed Graphs
Directed sandpile models with different toppling rules are studied by means of numerical simulations in two dimensions, with the purpose of determining the different universality classes. It is concluded that the random-threshold directed…
We study various mathematical aspects of discrete models on graphs, specifically the Dimer and the Ising models. We focus on proving gluing formulas for individual summands of the partition function. We also obtain partial results regarding…
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…
We study the rotor router model and two deterministic sandpile models. For the rotor router model in $\mathbb{Z}^d$, Levine and Peres proved that the limiting shape of the growth cluster is a sphere. For the other two models, only bounds in…
A category N of labeled (oriented) trivalent graphs (nets) or ribbon graphs is extended by new generators called fusing, braiding, twist and switch with relations which can be called Moore--Seiberg relations. A functor to N is constructed…
We investigate special structures due to automorphisms in isogeny graphs of principally polarized abelian varieties, and abelian surfaces in particular. We give theoretical and experimental results on the spectral and statistical properties…
In this paper, we systematically investigate the geometry and topology of manifolds with integral radial curvature bounds, and obtain many interesting and important conclusions.
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…
We study chip-firing on a signed graph $G_\phi$, employing a general theory of chip-firing on invertible matrices introduced by Guzm\'an and Klivans. Here a negative edge designates an adversarial relationship, so that firing a vertex…
We consider a discrete non-deterministic flow-firing process for rerouting flow on the edges of a planar complex. The process is an instance of higher-dimensional chip-firing. In the flow-firing process, flow on the edges of a complex is…
In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…
This is a somewhat expanded version of the notes of a series of lectures given at Lausanne and Stellenbosch in 1998-99. They are intended to provide a pedagogical introduction to the abelian sandpile model of self-organized criticality, and…
We consider the following matching-based routing problem. Initially, each vertex $v$ of a connected graph $G$ is occupied by a pebble which has a unique destination $\pi(v)$. In each round the pebbles across the edges of a selected matching…
After attaching explicitly to the M\"obius strip an invertible module over the ring of real polynomial functions on the real circle, we expound as directly as possible the many faces and the main algebraic properties of invertible modules.…
The authors have recently shown how direct limits of Hilbert spaces can be used to construct multi-resolution analyses and wavelets in $L^2(\R)$. Here they investigate similar constructions in the context of Hilbert modules over…
We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
We show that the extended based mapping class group of an infinite-type surface is naturally isomorphic to the automorphism group of the loop graph of that surface. Additionally, we show that the extended mapping class group stabilizing a…
In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…
For a continuous map on a topological graph containing a unique loop S, it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…
We give a characterization of the effect of sequences of pivot operations on a graph by relating it to determinants of adjacency matrices. This allows us to deduce that two sequences of pivot operations are equivalent iff they contain the…