Related papers: Hierarchy of Modular Graph Identities
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
We relate two important notions in graph theory: expanders which are highly connected graphs, and modularity a parameter of a graph that is primarily used in community detection. More precisely, we show that a graph having modularity…
In this paper, we initiate the study of endomorphisms and modular theory of the graph C*-algebras $\O_{\theta}$of a 2-graph $\Fth$ on a single vertex. We prove that there is a semigroup isomorphism between unital endomorphisms of…
The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been…
This introductory paper studies a class of real analytic functions on the upper half plane satisfying a certain modular transformation property. They are not eigenfunctions of the Laplacian and are quite distinct from Maass forms. These…
Let $G_S$ be the graph obtained by attaching a self-loop at every vertex in $S \subseteq V(G)$ of a simple graph $G$ of order $n.$ In this paper, we explore several new results related to the line graph $L(G_S)$ of $G_S.$ Particularly, we…
The integrand of any multi-loop integral is characterised after Feynman parametrisation by two polynomials. In this review we summarise the properties of these polynomials. Topics covered in this article include among others: Spanning trees…
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…
We introduce a type of graph integrals on elliptic curves from the heat kernel. We show that such graph integrals have modular properties under the modular group $SL(2, \Z)$, and prove the polynomial nature of the anti-holomorphic…
In this note we study the U-duality invariant coefficient functions of higher curvature corrections to the four-graviton scattering amplitude in type IIB string theory compactified on a torus. The main focus is on the $D^6R^4$ term that is…
Threshold graphs are generated from one node by repeatedly adding a node that links to all existing nodes or adding a node without links. In the weighted threshold graph, we add a new node in step $i$, which is linked to all existing nodes…
Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…
We show that Automorphic Lie Algebras which contain a Cartan subalgebra with a constant spectrum, called hereditary, are completely described by 2-cocycles on a classical root system taking only two different values. This observation…
Lyubashenko's construction associates representations of mapping class groups Map_{g,n} of Riemann surfaces of any genus g with any number n of holes to a factorizable ribbon category. We consider this construction as applied to the…
Clustering algorithms for large networks typically use modularity values to test which partitions of the vertex set better represent structure in the data. The modularity of a graph is the maximum modularity of a partition. We consider the…
We consider specific linear combinations of two loop modular graph functions on the toroidal worldsheet with $2s$ links for $s=2, 3$ and $4$. In each case, it satisfies an eigenvalue equation with source terms involving $E_{2s}$ and $E_s^2$…
The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that computes colorings on graphs, which can often be used to detect their (non-)isomorphism. Particularly the 1- and 2-dimensional versions 1-WL and 2-WL have received much…
In an earlier paper, the authors considered three types of graphs, and three equivalence relations, defined on a group, viz.\ the power graph, enhanced power graph, and commuting graph, and the relations of equality, conjugacy, and same…
In this talk I discuss properties of the two Symanzik polynomials which characterise the integrand of an arbitrary multi-loop integral in its Feynman parametric form. Based on the construction from spanning forests and Laplacian matrices,…
We show that Verdier duality for certain sheaves on the moduli spaces of graphs associated to Koszul operads corresponds to Koszul duality of operads. This in particular gives a conceptual explanation of the appearance of graph cohomology…