Related papers: Rewriting Graphically with Symmetric Traced Monoid…
Hyperbolic geometry has emerged as an effective latent space for representing complex networks, owing to its ability to capture hierarchical organization and heterogeneous connectivity patterns using low-dimensional embeddings. As a result,…
In machine learning, graph embedding algorithms seek low-dimensional representations of the input network data, thereby allowing for downstream tasks on compressed encodings. Recently, within the framework of network renormalization,…
We use traced monoidal categories to give a precise general version of "geometry of interaction". We give a number of examples of both "particle-style" and "wave-style" instances of this construction. We relate these ideas to semantics of…
Usually a name of the category is inherited from the name of objects. However more relevant for a category of objects and morphisms is an algebra of morphisms. Therefore we prefer to say a category of graphs if every morphism is a graph. In…
This thesis details a project to define a fully compositional theory of synchronous sequential circuits built from primitive components, motivated by applying techniques successfully used in programming languages to hardware. The first part…
Diagram chasing is not an easy task. The coherence holds in a generalized sense if we have a mechanical method to judge whether given two morphisms are equal to each other. A simple way to this end is to reform a concerned category into a…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
This paper introduces the concept of distorted monoidal categories, a generalization of monoidal and braided monoidal categories that supports non-reversible and direction-sensitive tensor structures. Unlike the classical setting, where the…
We provide a new approach to categorical graph and hypergraph theory by using categorical syntax and semantics. For each monoid $M$ and action on a set $X$, there is an associated presheaf topos of $(X,M)$-graphs where each object can be…
The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…
Metrically homogeneous graphs are connected graphs which, when endowed with the path metric, are homogeneous as metric spaces. In this paper we introduce the concept of twisted automorphisms, a notion of isomorphism up to a permutation of…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
We define a traced pseudomonoid as a pseudomonoid in a monoidal bicategory equipped with extra structure, giving a new characterisation of Cauchy complete traced monoidal categories as algebraic structures in Prof, the monoidal bicategory…
We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires in parallel are linked through the multiplicative structure…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
We define a traced pseudomonoid as a pseudomonoid in a monoidal bicategory equipped with extra structure, giving a new characterisation of Cauchy complete traced monoidal categories as algebraic structures in $\mathbf{Prof}$, the monoidal…
The syntactic categories of categorial grammar formalisms are structured units made of smaller, indivisible primitives, bound together by the underlying grammar's category formation rules. In the trending approach of constructive…
Heterogeneous graphs are ubiquitous in real-world applications because they can represent various relationships between different types of entities. Therefore, learning embeddings in such graphs is a critical problem in graph machine…
Designing programming languages that enable intuitive and safe manipulation of data structures is a critical research challenge. Conventional destructive memory operations using pointers are complex and prone to errors. Existing type…
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell 96]. This paper clarifies the mathematical foundations of these…