Related papers: The transition matrix between the Specht and $\mat…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
Bayesian networks faithfully represent the symmetric conditional independences existing between the components of a random vector. Staged trees are an extension of Bayesian networks for categorical random vectors whose graph represents…
Low-dimensional representations, or embeddings, of a graph's nodes facilitate several practical data science and data engineering tasks. As such embeddings rely, explicitly or implicitly, on a similarity measure among nodes, they require…
We introduce weaves, which are random sets of non-crossing c\`{a}dl\`{a}g paths that cover space-time $\overline{\mathbb{R}}\times\overline{\mathbb{R}}$. The Brownian web is one example of a weave, but a key feature of our work is that we…
Graph embedding is gaining its popularity for link prediction in complex networks and achieving excellent performance. However, limited work has been done in sparse networks that represent most of real networks. In this paper, we propose a…
We offer a pedestrian level review of the wall-crossing invariants. The story begins from the scattering theory in quantum mechanics where the spectrum reshuffling can be related to permutations of S-matrices. In non-trivial situations,…
We introduce web supercategories of type Q. We describe the structure of these categories and show they have a symmetric braiding. The main result of the paper shows these diagrammatically defined monoidal supercategories provide…
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…
In this work we explore the structure of the branching graph of the unitary group using Schur transitions. We find that these transitions suggest a new combinatorial expression for counting paths in the branching graph. This formula, which…
A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…
We provide three 3-dimensional characterizations of the Z-slice genus of a knot, the minimal genus of a locally-flat surface in 4-space cobounding the knot whose complement has cyclic fundamental group: in terms of balanced algebraic…
Many network analysis and graph learning techniques are based on models of random walks which require to infer transition matrices that formalize the underlying stochastic process in an observed graph. For weighted graphs, it is common to…
In this paper we indicate one method of construction of linear representations of groups and algebras with translation invariant (except, maybe , finite number) defining relationships. As an illustration of this method, we give one approach…
The understanding of the immense and intricate topological structure of the World Wide Web (WWW) is a major scientific and technological challenge. This has been tackled recently by characterizing the properties of its representative graphs…
Morphisms between tensor products of fundamental representations of the quantum group of sl(n) are described by the sl(n)-webs of Cautis-Kamnitzer-Morrison. Using these webs, we provide an explicit, root-theoretic formula for the local…
We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a…
We study a wide range of homologically-defined representations of surface braid groups and of mapping class groups of surfaces, including the Lawrence-Bigelow representations of the classical braid groups. These representations naturally…
We propose a combinatorial and graph-theoretic theory of dropout by modeling training as a random walk over a high-dimensional graph of binary subnetworks. Each node represents a masked version of the network, and dropout induces stochastic…
Recently, the diagrammatic description of soft-gluon exponentiation in scattering amplitudes has been generalized to the multiparton case. It was shown that the exponent of Wilson-line correlators is a sum of webs, where each web is formed…