Related papers: Morphisms between categorified spin networks

We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges…

We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…

Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…

Permutation equivariant neural networks are often constructed using tensor powers of $\mathbb{R}^{n}$ as their layer spaces. We show that all of the weight matrices that appear in these neural networks can be obtained from Schur-Weyl…

We describe an algorithm that morphs between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $\Gamma_I$ and $\Gamma_O$ share the same combinatorial…

In the context of loop quantum gravity, quantum states of geometry are mathematically defined as spin networks living on graphs embedded in the canonical space-like hypersurface. In the effort to study the renormalisation flow of loop…

Observations reveal that on large scales the universe is spanned by a percolating network of superclusters interspersed with large and almost empty regions -- voids. This thesis reports the construction of a sophisticated computational…

We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we…

We give an easy diagrammatical description of the parabolic Kazhdan-Lusztig polynomials for the Weyl group $W_n$ of type $D_n$ with parabolic subgroup of type $A_n$ and consequently an explicit counting formula for the dimension of the…

We present a convenient trick for computing the sizes of clusters within a network. The rationale relies on the mathematics of the geometric series and the fundamental matrix of a Markov Chain.

We identify certain Gromov-Witten invariants counting rational curves with given incidence and tangency conditions with the Betti numbers of moduli spaces of point configurations in projective spaces. On the Gromov-Witten side, S. Fomin and…

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.…

We develop a new ensemble of modular random graphs in which degree-degree correlations can be different in each module and the inter-module connections are defined by the joint degree-degree distribution of nodes for each pair of modules.…

We study the relationship between tropical and classical Hurwitz moduli spaces. Following recent work of Abramovich, Caporaso and Payne, we outline a tropicalization for the moduli space of generalized Hurwitz covers of an arbitrary genus…

This paper extends the Birman-Wenzl category by including a spin representation and then developing the recoupling theory, following Cvitanovic. In particular this gives a q-analogue of the chromatic evaluation of a spin network. The…

We extend the theory of diffeomorphism-invariant spin network states from the real-analytic category to the smooth category. Suppose that G is a compact connected semisimple Lie group and P -> M is a smooth principal G-bundle. A `cylinder…

We describe a graphical calculus for completely positive maps and in doing so review the theory of open quantum systems and other fundamental primitives of quantum information theory using the language of tensor networks. In particular we…

We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…

Let $\mathcal{C}$ be a spherical fusion category. The goal of this article is to present the tube category of $\mathcal{C}$, denoted $\mathcal{TC}$, as giving an alternative graphical perspective on the Drinfeld centre of $\mathcal{C}$,…

We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…