相关论文: A graphical construction of free Markov categories
Around the year 1988, Joyal and Street established a graphical calculus for monoidal categories, which provides a firm foundation for many explorations of graphical notations in mathematics and physics. For a deeper understanding of their…
Applied category theory has recently developed libraries for computing with morphisms in interesting categories, while machine learning has developed ways of learning programs in interesting languages. Taking the analogy between categories…
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to…
We present a Markl-style definition of operads colored by a small category. In the presence of a unit these are equivalent to substitudes of Day and Street. We show that operads colored by a category are internal algebras of a certain…
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of a previous one, designed to generate acyclic digraphs, non…
In [KW14], the new concept of Feynman categories was introduced to simplify the discussion of operad--like objects. In this present paper, we demonstrate the usefulness of this approach, by introducing the concept of decorated Feynman…
We give a category-theoretic treatment of causal models that formalizes the syntax for causal reasoning over a directed acyclic graph (DAG) by associating a free Markov category with the DAG in a canonical way. This framework enables us to…
In the paper "Triangulations, orientals, and skew monoidal categories", the free monoidal category Fsk on a single generating object was described. We sharpen this by giving a completely explicit description of Fsk, and so of the free skew…
An algorithm for generating the structure of a directed acyclic graph from data using the notion of causal input lists is presented. The algorithm manipulates the ordering of the variables with operations which very much resemble arc…
It is shown how the graph category of Borisov and Manin can be constructed from (a variant of) the graph category of Joyal and Kock, essentially by reversing the generic morphisms. More precisely, the morphisms in the Borisov-Manin category…
In this article is studied the construction of free operads functor, for the symmetric and non-symmetric case. In order to do this, the operads are seen as monoids on the differential graded modules category. In the last part we show some…
We recall several categories of graphs which are useful for describing homotopy-coherent versions of generalized operads (e.g. cyclic operads, modular operads, properads, and so on), and give new, uniform definitions for their morphisms.…
Properties of morphisms represented by so-called 'string diagrams' of monoidal categories (and their braided and symmetric derivatives), mainly their resistance in value to isotopic deformation, have made the usage of graphical calculi…
We study Hamiltonian paths and cycles in undirected graphs from an operadic viewpoint. We show that the graphical collection $\mathsf{Ham}$ encoding directed Hamiltonian paths in connected graphs admits an operad-like structure, called a…
Categorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories…
For every functor $\mathcal{F} : \mathcal{K} \to \mathbf{C}$, where $\mathcal{K}$ is a small category and $\mathbf{C}$ is a model category which satisfies some mild hypotheses, we define a model category $\mathbf{C}^m$ of…
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 show that the category of optics in a monoidal category arises naturally from the free cornering of that category. Further, we show that the free cornering of a monoidal category is a natural setting in which to work with comb diagrams…
The classical theory of free analysis generalizes the noncommutative (nc) polynomials and rational functions, easily providing such results as an nc analogue of the Jacobian conjecture. However, the classical theory misses out on important…
We give an algebraic presentation of directed acyclic graph structure, introducing a symmetric monoidal equational theory whose free PROP we characterise as that of finite abstract dags with input/output interfaces. Our development provides…