Related papers: Chip-Firing and Rotor-Routing on Directed Graphs
We suggest a measure of "Eulerianness" of a finite directed graph and define a class of "coEulerian" graphs. These are the graphs whose Laplacian lattice is as large as possible. As an application, we address a question in chip-firing posed…
In this paper, we study discrete Lyapunov models, which consist of steady-state distributions of first-order vector autoregressive models. The parameter matrix of such a model encodes a directed graph whose vertices correspond to the…
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
We describe a large-scale project in applied automated deduction concerned with the following problem of considerable interest in loop theory: If $Q$ is a loop with commuting inner mappings, does it follow that $Q$ modulo its center is a…
In this paper, we investigate the existence of fractional revival on Cayley graphs over finite abelian groups. We give a necessary and sufficient condition for Cayley graphs over finite abelian groups to have fractional revival. As…
In this paper we propose a model for describing advection dynamics on distance-weighted directed graphs. To this end we establish a set of key properties, or axioms, that a discrete advection operator should satisfy, and prove that there…
Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…
In rotor-router aggregation on the square lattice Z^2, particles starting at the origin perform deterministic analogues of random walks until reaching an unoccupied site. The limiting shape of the cluster of occupied sites is a disk. We…
Given two subsets A and B of nodes in a directed graph, the conduciveness of the graph from A to B is the ratio representing how many of the edges outgoing from nodes in A are incoming to nodes in B. When the graph's nodes stand for the…
The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalises naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for…
In this paper we explore mathematical tools that can be used to relate directed and undirected random graph models to each other. We identify probability spaces on which a directed and an undirected graph model are equivalent, and…
In this paper, we extend the ideas of graph pebbling to oriented graphs and find a classification for all graphs with fully traversable pebbling assignments that are isomorphic to their assignment graph. We then give some cases in which a…
We provide a comprehensive view on the role of Abelian symmetry and stochasticity in the universality class of directed sandpile models, in context of the underlying spatial correlations of metastable patterns and scars. It is argued that…
Motion planning is a fundamental problem of robotics with applications in many areas of computer science and beyond. Its restriction to graphs has been investigated in the literature for it allows to concentrate on the combinatorial problem…
We investigated the bifurcation structure on the self-propelled motion of a camphor rotor at a water surface. The center of the camphor rotor was fixed by the axis, and it showed rotational motion around it. Due to the chiral asymmetry of…
We use the inflation-restriction sequence and a result of Etingof and Gra\~na on the rack cohomology to give a explicit description of 2-cocycles of finite indecomposable quandles with values in an abelian group. Several applications are…
In this paper, we introduce the notion of Pfaffian orientations on (punctured) polygonally cellulated orientable surfaces, and provide an expression for the number of such orientations. This generalizes the notion of Pfaffian orientations…
We use a phenomenological field theory, reflecting the symmetries and conservation laws of sandpiles, to compare the driven dissipative sandpile, widely studied in the context of self-organized criticality, with the corresponding…
Let A be a finitely generated associative algebra over an algebraically closed field. We characterize the finite dimensional modules over A whose orbit closures are regular varieties.
This is a survey on Anderson t-motives -- high-dimensional generalizations of Drinfeld modules. They are the functional field analogs of abelian varieties with multiplication by an imaginary quadratic field. We describe their lattices,…