Related papers: ProPs of graphs and generalised traces

We introduce the concept of TRAP (Traces and Permutations), which can roughly be viewed as a wheeled PROP (Products and Permutations) without unit. TRAPs are equipped with a horizontal concatenation and partial trace maps. Continuous…

We introduce and study wheeled PROPs, an extension of the theory of PROPs which can treat traces and, in particular, solutions to the master equations which involve divergence operators. We construct a dg free wheeled PROP whose…

We show how the machine of PROP profiles invented by S. Merkulov can be used to study and classify natural operators in differential geometry. We also give an interpretation of graph complexes arising in this context in terms of…

We consider graph complexes with a flow and compute their cohomology. More specifically, we prove that for a PROP generated by a Koszul dioperad, the corresponding graph complex gives a minimal model of the PROP. We also give another proof…

We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…

A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…

Motivated by the problem of deformation quantization we introduce and study directed graph complexes with oriented loops and wheels. We develop some technique for computing cohomology of such graph complexes and apply it to several concrete…

We construct a direct quasi-isomorphism from Kontsevich's graph complex GC_n to the oriented graph complex OGC_{n+1}, thus providing an alternative proof that the two complexes are quasi-isomorphic. Moreover, the result is extended to the…

This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…

We study the category of wheeled PROPs using tools from Invariant Theory. A typical example of a wheeled PROP is the mixed tensor algebra ${\mathcal V}=T(V)\otimes T(V^\star)$, where $T(V)$ is the tensor algebra on an $n$-dimensional vector…

A PROP is a symmetric monoidal category whose objects are the nonnegative integers and whose tensor product on objects is addition. A morphism from $m$ to $n$ in a PROP can be visualized as a string diagram with $m$ input wires and $n$…

Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the "not later than" relationship. In this paper, we first introduce the novel notion of generalized comtraces, extensions of comtraces that can additionally…

We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…

We introduce a generalization of the notion of operad that we call a contractad, whose set of operations is indexed by connected graphs and whose composition rules are numbered by contractions of connected subgraphs. We show that many…

The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…

In this paper we establish a bridge between Topological Data Analysis and Geometric Deep Learning, adapting the topological theory of group equivariant non-expansive operators (GENEOs) to act on the space of all graphs weighted on vertices…

Non-linear kernel methods can be approximated by fast linear ones using suitable explicit feature maps allowing their application to large scale problems. We investigate how convolution kernels for structured data are composed from base…

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…

This paper is concerned with developing a theory of traces for functions that are integrable but need not possess any differentiability within their domain. Moreover, the domain can have an irregular boundary with cusp-like features and…