Related papers: The transition matrix between the Specht and $\mat…
Self-Organizing Maps (SOM) are popular unsupervised artificial neural network used to reduce dimensions and visualize data. Visual interpretation from Self-Organizing Maps (SOM) has been limited due to grid approach of data representation,…
We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. Our methods are rooted in the bracket…
In this paper we study self-similar and fractal networks from the combinatorial perspective. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to…
The study of complex networks has been historically based on simple graph data models representing relationships between individuals. However, often reality cannot be accurately captured by a flat graph model. This has led to the…
Various properties of a class of braid matrices, presented before, are studied considering $N^2 \times N^2 (N=3,4,...)$ vector representations for two subclasses. For $q=1$ the matrices are nontrivial. Triangularity $(\hat R^2 =I)$…
The paper introduces mixed networks, a new framework for expressing and reasoning with probabilistic and deterministic information. The framework combines belief networks with constraint networks, defining the semantics and graphical…
We study the balance of $G$-gain graphs, where $G$ is an arbitrary group, by investigating their adjacency matrices and their spectra. As a first step, we characterize switching equivalence and balance of gain graphs in terms of their…
Due to the ubiquity of graph data on the web, web graph mining has become a hot research spot. Nonetheless, the prevalence of large-scale web graphs in real applications poses significant challenges to storage, computational capacity and…
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…
We give a diagrammatic presentation in terms of generators mod relations of the representation category of $U_q(\mathfrak{sl}_n)$. More precisely, we produce all the relations among $\rm{SL}_n$-webs, thus describing the full subcategory…
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
The present work continues the program of summing planar Feynman graphs on the world sheet. Although it is based on the same classical action introduced in the earlier work, there are important new features: Instead of the path integral…
Graph data structures are widely used to store relational information between several entities. With data being generated worldwide on a large scale, we see a significant growth in the generation of knowledge graphs. Thing in the future is…
Graphs are central to modeling complex systems in domains such as social networks, molecular chemistry, and neuroscience. While Graph Neural Networks, particularly Graph Convolutional Networks, have become standard tools for graph learning,…
We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…
Observations indicate galaxies are distributed in a filament-dominated web-like structure. Numerical experiments at high and low redshift of viable structure formation theories also show filament-dominance. We present a simple quantitative…
Linking structure is a new concept characterizing topological semimetals, which indicates the interweaving of gap-closing nodes at the Fermi energy ($E_F$) with other nodes below $E_F$. As the number of linked nodes can be changed only via…
Graph Neural Networks (GNNs) are widely used to compute representations of node pairs for downstream tasks such as link prediction. Yet, theoretical understanding of their expressive power has focused almost entirely on graph-level…
The existence of basket, flat plumbing and flat plumbing basket surfaces of a link was first proven from a braid representative of the link. In the present article, we show the existence of such surfaces from an induced graph of the link.…
We continue investigating the generalisations of geometrical statistical models introduced in [13], in the form of models of webs on the hexagonal lattice H having a U_q(sl_n) quantum group symmetry. We focus here on the n=3 case of cubic…