Related papers: A graphical construction of free Markov categories

We construct models for the motivic homotopy category based on simplicial functors from smooth schemes over a field to simplicial sets. These spaces are homotopy invariant and therefore one does not have to invert the affine line in order…

A class of spherical functions is studied which can be viewed as the matrix generalization of Bessel functions. We derive a recursive structure for these functions. We show that they are only special cases of more general radial functions…

Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with…

This note gives the complete projective classification of rational, cuspidal plane curves of degree at least 6, and having only weighted homogeneous singularities. It also sheds new light on some previous characterizations of free and…

Network models, which abstractly are given by lax symmetric monoidal functors, are used to construct operads for modeling and designing complex networks. Many common types of networks can be modeled with simple graphs with edges weighted by…

One of the most influential recent results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent…

A unicellular collection on a surface is a collection of curves whose complement is a single disk. There is a natural surgery operation on unicellular collections, endowing the set of such with a graph structure where the edge relation is…

This paper considers the problem of defining distributions over graphical structures. We propose an extension of the hyper Markov properties of Dawid and Lauritzen [Ann. Statist. 21 (1993) 1272-1317], which we term structural Markov…

The massless one-loop vertex diagram is constructed by exploiting the causal structure of the diagram in configuration space, which can be translated directly into dispersive relations in momentum space.

We construct a diagrammatic categorification of the spherical module over the Hecke algebra. We establish a basis for the morphism spaces of this category, and prove that it is equivalent to an existing algebraic spherical category.

These are expanded lecture notes from lectures given at the Workshop on higher structures at MATRIX Melbourne. These notes give an introduction to Feynman categories and their applications. Feynman categories give a universal categorical…

We propose a directed acyclic hypergraph framework for a probabilistic graphical model that we call Bayesian hypergraphs. The space of directed acyclic hypergraphs is much larger than the space of chain graphs. Hence Bayesian hypergraphs…

We construct a space of string diagrams, which are a type of fatgraph with some additional data, and show that there are string topology operations on the chains of the free loop space of a closed Riemannian manifold which are parameterized…

A causal-net is a finite acyclic directed graph. In this paper, we introduce a category, denoted by $\mathbf{Cau}$ and called causal-net category, whose objects are causal-nets and morphisms between two causal-nets are the functors between…

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…

We introduce the Contextual Graph Markov Model, an approach combining ideas from generative models and neural networks for the processing of graph data. It founds on a constructive methodology to build a deep architecture comprising layers…

We introduce a graphical language for closed symmetric monoidal categories based on an extension of string diagrams with special bracket wires representing internal homs. These bracket wires make the structure of the internal hom functor…

Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…

In order to apply nonstandard methods to modern algebraic geometry, as a first step in this paper we study the applications of nonstandard constructions to category theory. It turns out that many categorial properties are well behaved under…

We develop the theory linking 'E-separation' in directed mixed graphs (DMGs) with conditional independence relations among coordinate processes in stochastic differential equations (SDEs), where causal relationships are determined by "which…