Related papers: Classification of higher grade $\ell$ graphs for $…
$O(N)$ invariant vector models have been shown to possess non-trivial scaling large $N$ limits, at least perturbatively within the loop expansion, a property they share with matrix models of 2D quantum gravity. In contrast with matrix…
Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…
An U(N)-invariant matrix model with d matrix variables is studied. It was shown that in the limit $N\to \infty $ and $d\to 0$ the model describes the knot diagrams. We realize the free partition function of the matrix model as the…
In this paper, we study semi-supervised graph classification, which aims at accurately predicting the categories of graphs in scenarios with limited labeled graphs and abundant unlabeled graphs. Despite the promising capability of graph…
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…
Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $G(n,\frac{d}{n})$.…
Let Q be a Dynkin quiver of type A. The bounded derived category of the path algebra of Q has an autoequivalence given by the composition of the Auslander-Reiten translate and the square of the shift functor. We classify the maximal rigid…
A $1$-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a $1$-plane graph such that any two pairs of crossing edges share at most one end-vertex. An edge partition of a $1$-plane…
We consider the problem of classifying those graphs that arise as an undirected square of an oriented graph by generalising the notion of quasi-transitive directed graphs to mixed graphs. We fully classify those graphs of maximum degree…
We explicitly determine the group of isomorphism classes of equivariant line bundles on the non-archimedean Drinfeld upper half plane for $\mathrm{GL}_2(F)$, for its subgroups of matrices whose determinant has even (respectively trivial)…
We give the first and lowest order examples of 3-regular 3-edge-colored graphs that demonstrate the non-factorization of tensor model invariants in the large N limit of Gaussian random tensors, as proven on general grounds in [Gurau R.,…
We consider the following generalization of dominating sets: Let $G$ be a host graph and $P$ be a pattern graph $P$. A dominating $P$-pattern in $G$ is a subset $S$ of vertices in $G$ that (1) forms a dominating set in $G$ \emph{and} (2)…
The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…
To unify the quantum electrodynamics (QED) under the first principle which brings the renormalization unartificially, we study Feynman diagrams in QED according to the set theory and the category theory. We add the restriction on the…
We consider the rank-1 inhomogeneous random graph in the Brownian regime in the critical window. Aldous studied the weights of the components, and showed that this ordered sequence converges in the $\ell^2$-topology to the ordered…
The spectral properties of traditional (dyadic) graphs, where an edge connects exactly two vertices, are widely studied in different applications. These spectral properties are closely connected to the structural properties of dyadic…
Degree ssortativity is the tendency for nodes of high degree (resp.low degree) in a graph to be connected to high degree nodes (resp. to low degree ones). It is sually quantified by the Pearson correlation coefficient of the degree-degree…
Euler graphs with only one (two) type(s) of cycles under (mod 4) operation were studied in Part-I(II). Here we consider the class of Euler graphs with only three types of cycles under (mod 4). This gives rise to four cases viz., graphs…
Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of…
The perturbative expansion of tensorial field theories in Feynman graphs can be interpreted as weighted generating series of some piecewise linear varieties. This simple fact establishes a link between two a priori distinct fields: the…