Related papers: Hierarchy of Modular Graph Identities
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…
Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…
A new heuristic based on vertex invariants is developed to rapidly distinguish non-isomorphic graphs to a desired level of accuracy. The method is applied to sample subgraphs from an E.coli protein interaction network, and as a probe for…
A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge. In this article, first we establish bounds for…
We consider the graph whose vertex set is a conjugacy class ${\mathcal C}$ consisting of finite-rank self-adjoint operators on a complex Hilbert space $H$. The dimension of $H$ is assumed to be not less than $3$. In the case when operators…
We obtain eigenvalue equations satisfied by various elliptic modular graphs with five links where two of the vertices are unintegrated. Solving them leads to several non--trivial algebraic identities between these graphs.
A new class of identities for Feynman graph amplitudes, dubbed Schouten identities, valid at fixed integer value of the dimension d is proposed. The identities are then used in the case of the two loop sunrise graph with arbitrary masses…
In this thesis, we investigate the low-energy expansion of scattering amplitudes of closed strings at one-loop level (i.e. at genus one) in a ten-dimensional Minkowski background using a special class of functions called modular graph…
Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…
We derive new Poincar\'e-series representations for infinite families of non-holomorphic modular invariant functions that include modular graph forms as they appear in the low-energy expansion of closed-string scattering amplitudes at genus…
The Feynman identity (FI) of a planar graph relates the Euler polynomial of the graph to an infinite product over the equivalence classes of closed nonperiodic signed cycles in the graph. The main objectives of this paper are to compute the…
We calculate the four-graviton scattering amplitude in Type II superstring theory at one loop up to seventh order in the low-energy expansion through the recently developed iterated integral formalism of Modular Graph Functions (MGFs). The…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
The hierarchical product of two graphs represents a natural way to build a larger graph out of two smaller graphs with less regular and therefore more heterogeneous structure than the Cartesian product. Here we study the eigenvalue spectrum…
Let $H$ be a connected $m$-uniform hypergraph, and let $\mathcal{A}(H)$ be the adjacency tensor of $H$ whose spectrum is simply called the spectrum of $H$. Let $s(H)$ denote the number of eigenvectors of $\mathcal{A}(H)$ associated with the…
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…
Modular graph forms (MGFs) are a class of non-holomorphic modular forms which naturally appear in the low-energy expansion of closed-string genus-one amplitudes and have generated considerable interest from pure mathematicians. MGFs satisfy…
In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…