Related papers: Identities between Modular Graph Forms
Separation logics are widely used for verifying programs that manipulate complex heap-based data structures. These logics build on so-called separation algebras, which allow expressing properties of heap regions such that modifications to a…
In a nutshell, submodular functions encode an intuitive notion of diminishing returns. As a result, submodularity appears in many important machine learning tasks such as feature selection and data summarization. Although there has been a…
The discrete logarithm is a problem that surfaces frequently in the field of cryptography as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the…
We argue the usefulness of Gaifman graphs of first-order relational structures as an exploratory data analysis tool. We illustrate our approach with cases where the modular decompositions of these graphs reveal interesting facts about the…
We introduce a type of graph integrals which are holomorphic analogs of configuration space integrals. We prove their (ultraviolet) finiteness by considering a compactification of the moduli space of graphs with metrics, and study their…
We continue our investigation of the modular graph functions and string invariants that arise at genus-two as coefficients of low energy effective interactions in Type II superstring theory. In previous work, the non-separating degeneration…
A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A related problem is to find representations for multiple…
Modular graph functions associate to a graph an $SL(2,Z)$-invariant function on the upper half plane. We obtain the Fourier series of modular graph functions of arbitrary weight $w$ and two-loop order. The motivation for this work is to…
Recent evidence indicates that the abundance of recurring elementary interaction patterns in complex networks, often called subgraphs or motifs, carry significant information about their function and overall organization. Yet, the…
We develop a new ensemble of modular random graphs in which degree-degree correlations can be different in each module and the inter-module connections are defined by the joint degree-degree distribution of nodes for each pair of modules.…
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 continue to investigate properties of the worldsheet conformal field theories (CFTs) which are conjectured to be dual to free large N gauge theories, using the mapping of Feynman diagrams to the worldsheet suggested in hep-th/0504229.…
We explore an identity between two branching graphs and propose a physical meaning in the context of the gauge-gravity correspondence. From the mathematical point of view, the identity equates probabilities associated with $\mathbb{GT}$,…
A general theory of vector-valued modular functions, holomorphic in the upper half-plane, is presented for finite dimensional representations of the modular group. This also provides a description of vector-valued modular forms of arbitrary…
We introduce a simple procedure to integrate differential forms with arbitrary holomorphic poles on Riemann surfaces. It gives rise to an intrinsic regularization of such singular integrals in terms of the underlying conformal geometry.…
We continue the analysis of modular invariant functions, subject to inhomogeneous Laplace eigenvalue equations, that were determined in terms of Poincar\'e series in a companion paper. The source term of the Laplace equation is a product of…
We apply the theory of $\alpha$-induction of sectors which we elaborated in our previous paper to several nets of subfactors arising from conformal field theory. The main application are conformal embeddings and orbifold inclusions of SU(n)…
Let G be a finite connected simple graph. We define the moduli space of conformal structures on G. We propose a definition of conformally covariant operators on graphs, motivated by [25]. We provide examples of conformally covariant…
A modulator of a graph G to a specified graph class H is a set of vertices whose deletion puts G into H. The cardinality of a modulator to various tractable graph classes has long been used as a structural parameter which can be exploited…
Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…