Related papers: Categorified Path Calculus
We define a graded multiplication on the vector space of essential paths on a graph $G$ (a tree) and show that it is associative. In most interesting applications, this tree is an ADE Dynkin diagram. The vector space of length preserving…
Motivated by the need for a more comprehensive algebraic structure to calculate coincidence probabilities of a general decay scheme for gamma ray spectroscopy, we model the decay scheme, rather naturally, as a quiver through which we define…
The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…
q-Matroids form the q-analogue of classical matroids. In this paper we introduce various types of maps between q-matroids. These maps are not necessarily linear, but they map subspaces to subspaces and respect the q-matroid structure in…
Given a chiral algebra, we study modules over an arbitrary power of a curve. We describe this category in three different ways: in terms of factorization, in terms of certain chiral operations and as modules for a lie algebra in a certain…
The class of matrix algebras on a ladder $\mathcal{L}$ generalizes the class of block upper triangular matrix algebras. It was previously shown that the matrix algebra on a ladder $\mathcal{L}$ is zero product determined under matrix…
We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification…
We introduce monoidal streams. Monoidal streams are a generalization of causal stream functions, which can be defined in cartesian monoidal categories, to arbitrary symmetric monoidal categories. In the same way that streams provide…
Symbolic dynamics is partly the study of walks in a directed graph. By a walk, here we mean a morphism to the graph from the Cayley graph of the monoid of non-negative integers. Sets of these walks are also important in other areas, such as…
String diagrammatic calculi have become increasingly popular in fields such as quantum theory, circuit theory, probabilistic programming, and machine learning, where they enable resource-sensitive and compositional algebraic analysis.…
Matrix Graph Grammars (MGG) is a novel approach to the study of graph dynamics ([15]). In the present contribution we look at MGG as a formal grammar and as a model of computation, which is a necessary step in the more ambitious program of…
Cryptography is a theory of secret functions. Category theory is a general theory of functions. Cryptography has reached a stage where its structures often take several pages to define, and its formulas sometimes run from page to page.…
In the first part of this paper, we survey results that are associated with three types of Laplacian matrices:difference, normalized, and signless. We derive eigenvalue and eigenvector formulaes for paths and cycles using circulant matrices…
Many interesting examples of operator algebras, both self-adjoint and non-self-adjoint, can be constructed from directed graphs. In this survey, we overview the construction of $C^*$-algebras from directed graphs and from two…
We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is a structure capable of representing multilayer and time-varying networks, as well as higher-order networks, while also having the property…
Any finite-dimensional commutative (associative) graded algebra with all nonzero homogeneous subspaces one-dimensional is defined by a symmetric coefficient matrix. This algebraic structure gives a basic kind of $A$-graded algebras…
Integrated Gradients (IG) is a common explainability technique to address the black-box problem of neural networks. Integrated gradients assumes continuous data. Graphs are discrete structures making IG ill-suited to graphs. In this work,…
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…
We discuss what it means for a symmetric monoidal category to be a module over a commutative semiring category. Each of the categories of (1) cartesian monoidal categories, (2) semiadditive categories, and (3) connective spectra can be…
We show that the category of (reflexive) graphs and graph maps carries exactly two closed symmetric monoidal products: the box product and the categorical product.