Related papers: Identities between Modular Graph Forms
Graphs can have different properties that lead to several graph types and may allow for a varying representation of diverse information. In order to clarify the modeling power of graphs, we introduce a partial order on the most common graph…
The modular decomposition of a graph $G$ is a natural construction to capture key features of $G$ in terms of a labeled tree $(T,t)$ whose vertices are labeled as "series" ($1$), "parallel" ($0$) or "prime". However, full information of $G$…
In signal processing, exploring complex systems through network representations has become an area of growing interest. This study introduces the modularity graph, a new graph-based feature, to highlight the relationship across the graph…
The modular decomposition of a symmetric map $\delta\colon X\times X \to \Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features…
We give a description of the complete 1/N expansion of SU(N) 2D Yang Mills theory in terms of the moduli space of holomorphic maps from non-singular worldsheets. This is related to the Gross-Taylor coupled 1/N expansion through a map from…
We present a method for computing the framing on the cohomology of graph hypersurfaces defined by the Feynman differential form. This answers a question of Bloch, Esnault and Kreimer in the affirmative for an infinite class of graphs for…
In this lecture we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. Our analysis is based on an approach to modular invariants using braided sector induction…
In this paper we introduce a family of planar, modular and self-similar graphs which have small-world and scale-free properties. The main parameters of this family are comparable to those of networks associated to complex systems, and…
Many real-world phenomena are naturally modeled by graphs and networks. However, classical graph models are often limited to pairwise interactions and may not adequately capture the richer structures that arise in practice. Higher-order…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
Modular symbols for the congruence subgroup $\Gamma_0(\mathfrak{n})$ of $GL_{2}(\mathbf{F}_q[T])$ have been defined by Teitelbaum. They have a presentation given by a finite number of generators and relations, in a formalism similar to…
We recall several categories of graphs which are useful for describing homotopy-coherent versions of generalized operads (e.g. cyclic operads, modular operads, properads, and so on), and give new, uniform definitions for their morphisms.…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
For a graph $H$, its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions $W$ in $L^p$, $p\geq e(H)$, denoted by $t(H,W)$. One may then define corresponding functionals…
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…
We prove identities between cycle integrals of non-holomorphic modular forms arising from applications of various differential operators to weak Maass forms.
This article introduces moduli spaces of coloured graphs on which Feynman amplitudes can be viewed as 'discrete' volume densities. The basic idea behind this construction is that these moduli spaces decompose into disjoint unions of open…
The Pfaffian structure of the boundary monomer correlation functions in the dimer-covering planar graph models is rederived through a combinatorial / topological argument. These functions are then extended into a larger family of…
This is the first of two papers in which we study the modular invariance of pseudotraces of logarithmic intertwining operators. We construct and study genus-one correlation functions for logarithmic intertwining operators among generalized…
The graph structure is a commonly used data storage mode, and it turns out that the low-dimensional embedded representation of nodes in the graph is extremely useful in various typical tasks, such as node classification, link prediction ,…