Related papers: A graphical construction of free Markov categories
In these notes we generalize the theory of graphical functions from scalar theories to theories with spin.
AT-free graphs are characterized by vertex elimination orders. We show that these AT-free orders of a graph can be generated in constant amortized time.
We provide a categorical procedure to turn graphs corresponding to state spaces of finite state machines into boolean circuits, leveraging on the fact that boolean circuits can be easily turned into zk-SNARKS. Our circuits verify that a…
In the present article we construct new families of free and nearly free curves starting from a plane cubic curve $C$ and adding some of its hyperosculating conics. We present results that involve nodal cubic curves and the Fermat cubic. In…
We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate two processes for constructing non-negative topological…
In this paper we introduce a notion of {\it generalized operad} containing as special cases various kinds of operad--like objects: ordinary, cyclic, modular, properads etc. We then construct inner cohomomorphism objects in their categories…
This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…
A popular graphical calculus for monoidal categories makes computations tactile and intuitive. Complicated diagram chases can be expressed in a few pictures and discovered by playing with a shoelace. Joyal and Street's proof of the…
We consider a a collection of categorical random variables. Of special interest is the causal effect on an outcome variable following an intervention on another variable. Conditionally on a Directed Acyclic Graph (DAG), we assume that the…
This work presents a construction of stationary Markov models with negative-binomial marginal distributions. A simple closed form expression for the corresponding transition probabilities is given, linking the proposal to well-known classes…
This work presents a detailed analysis of the combinatorics of modular operads. These are operad-like structures that admit a contraction operation as well as an operadic multiplication. Their combinatorics are governed by graphs that admit…
In the process of building (structural learning) a probabilistic graphical model from a set of observed data, the directional, cyclic dependencies between the random variables of the model are often found. Existing graphical models such as…
In this paper we present the construction of a skeletal diagram category, which we call the square with bands category. This category extends the Temperley-Lieb (TL) category, where morphisms now include diagrams of embedded curves on…
A polynomial-time exact algorithm for counting the number of directed acyclic graphs in a Markov equivalence class was recently given by Wien\"obst, Bannach, and Li\'skiewicz (AAAI 2021). In this paper, we consider the more general problem…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
The free energy of a field theory can be considered as a functional of the free correlation function. As such it obeys a nonlinear functional differential equation which can be turned into a recursion relation. This is solved order by order…
We exploit a decomposition of graph traversals to give a novel characterization of depth-first and breadth-first traversals as universal constructions. Specifically, we introduce functors from two different categories of edge-ordered…
We construct injective hulls and projective covers in categories of generalized uniform hypergraphs which generalizes the constructions in the category of quivers and the category of undirected graphs. While the constructions are not…
A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…
This paper considers inference of causal structure in a class of graphical models called "conditional DAGs". These are directed acyclic graph (DAG) models with two kinds of variables, primary and secondary. The secondary variables are used…