Related papers: Chip-Firing and Riemann-Roch Theory for Directed G…
A rational map $f:\widehat{\mathbb{C}}\to\widehat{\mathbb{C}}$ on the Riemann sphere $\widehat{\mathbb{C}}$ is called critically fixed if each critical point of $f$ is fixed under $f$. In this article, we study the properties of a…
We study two classes of inverse semigroups built from directed graphs, namely graph inverse semigroups and a new class of semigroups that we refer to as Leavitt inverse semigroups. These semigroups are closely related to graph…
Most of real-world graphs are dynamic, i.e., they change over time by a sequence of update operations. While the regression problem has been studied for static graphs and temporal graphs, it is not investigated for general dynamic graphs.…
We examine a wide class of stochastic approximation algorithms for solving (stochastic) nonlinear problems on Riemannian manifolds. Such algorithms arise naturally in the study of Riemannian optimization, game theory and optimal transport,…
In the present paper we extend the Riemann-Roch formalism to structure algebras of moment graphs. We introduce and study the Chern character and pushforwards for twisted fibrations of moment graphs. We prove an analogue of the Riemann-Roch…
For a drawing of a labeled graph, the rotation of a vertex or crossing is the cyclic order of its incident edges, represented by the labels of their other endpoints. The extended rotation system (ERS) of the drawing is the collection of the…
Graph-based machine learning has seen an increased interest over the last decade with many connections to other fields of applied mathematics. Learning based on partial differential equations, such as the phase-field Allen-Cahn equation,…
The Laplacian matrix and its pseudo-inverse for a strongly connected directed graph is fundamental in computing many properties of a directed graph. Examples include random-walk centrality and betweenness measures, average hitting and…
The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared in the study of automata and logic, and they later became…
We prove a theorem computing the number of solutions to a system of equations which is generic subject to the sparsity conditions embodied in a graph. We apply this theorem to games obeying graphical models and to extensive-form games. We…
The concept of biased Maker-Breaker games, introduced by Chv\'atal and Erd{\H o}s, is a central topic in the field of positional games, with deep connections to the theory of random structures. For any given hypergraph ${\cal H}$ the main…
In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…
A metrized complex of algebraic curves is a finite metric graph together with a collection of marked complete nonsingular algebraic curves, one for each vertex, the marked points being in bijection with incident edges. We establish a…
A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph $\Gamma$ is an element of the free abelian group on $\Gamma$. The rank of a divisor on a metric graph is…
We study certain groups and ideals arising from the chip-firing game on a generalisation of graphs called pargraphs. Several well-known families of toric ideals arise as toppling ideals of pargraphs. These include ideals defining rational…
We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. This approach provides us with insights into the interplay between rules when inducing answer sets. We…
We construct a functor, from the category of schemes to the category of graded rings, that is an initial object for having a theory of Chern classes with an additive first Chern class. For any scheme $X$, the graded ring that our functor…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…
Ricci curvature was proposed by Ollivier in a general framework of metric measure spaces, and it has been studied extensively in the context of graphs in recent years. In this paper we prove upper bounds for Ollivier's Ricci curvature for…
Rosenbrock's theorem on polynomial system matrices is a classical result in linear systems theory that relates the Smith-McMillan form of a rational matrix $G$ with the Smith forms of an irreducible polynomial system matrix $P$ giving rise…