Related papers: Proving relations between modular graph functions
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…
We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…
We consider the contributions upto the $D^{10} \mathcal{R}^4$ terms in the low momentum expansion of the two loop four graviton amplitude in maximal supergravity that arise in the field theory limit of genus two modular graph functions that…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases…
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…
A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…
Modular graph forms are a class of non-holomorphic modular forms that arise in the low-energy expansion of genus-one closed string amplitudes. In this work, we introduce a systematic procedure to convert lattice-sum representations of…
We prove the following "linkage" theorem: two p-regular graphs of the same genus can be obtained from one another by a finite alternating sequence of one-edge-contractions; moreover this preserves 3-edge-connectivity. We use the linkage…
We study the structure of the non-perturbative free energy of a one-parameter class of little string theories (LSTs) of A-type in the so-called unrefined limit. These theories are engineered by $N$ M5-branes probing a transverse flat space.…
The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…
Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…
The mechanisms by which modularity emerges in complex networks are not well understood but recent reports have suggested that modularity may arise from evolutionary selection. We show that finding the modularity of a network is analogous to…
The free energy of a multi-component scalar field theory is considered as a functional W[G,J] of the free correlation function G and an external current J. It obeys non-linear functional differential equations which are turned into…
By introducing multipe-site correlation functions, we propose a hierarchical Green function approach, and apply it to study the characteristic properties of a 2D square lattice Hubbard model by solving the equation of motions of a…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
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…
In an earlier paper, we constructed the genus-two amplitudes for five external massless states in Type II and Heterotic string theory, and showed that the alpha' expansion of the Type II amplitude reproduces the corresponding supergravity…
Green's functions are highly useful in analyzing the dynamical behavior of polynomials in their escaping set. The aim of this paper is to construct an analogue of Green's functions for planar quasiregular mappings of degree two and constant…
Answering some questions of Gutman, we show that, except for four specific trees, every connected graph G of order n, with no cycle of order 4 and with maximum degree at most 3, has energy greater that its order. Here, the energy of a graph…