Related papers: Proving relations between modular graph functions
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…
This is the first one of a series of papers on association of orientations, lattice polytopes, and abelian group arrangements to graphs. The purpose is to interpret the integral and modular tension polynomials of graphs at zero and negative…
We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…
In a recent paper Jones introduced a correspondence between elements of the Thompson group $F$ and certain graphs/links. It follows from his work that several polynomial invariants of links, such as the Kauffman bracket, can be…
We propose explicit recipes to construct the euclidean Green functions of gauge-invariant charged, monopole and dyon fields in four-dimensional gauge theories whose phase diagram contains phases with deconfined electric and/or magnetic…
In the linear-in-means model, endogeneity arises naturally due to the reflection problem. A common solution is to use Instrumental Variables (IVs) based on higher-order network links, such as using friends-of-friends' characteristics. We…
In 2006 Bonato and Tardif posed the Tree Alternative Conjecture (TAC): the equivalence class of a tree under the embeddability relation is, up to isomorphism, either trivial or infinite. In 2022 LaFlamme, et al. provided a rigorous…
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…
The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from the theory of dynamical systems, we study the structural…
This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and…
In the suborbital graphs studies, there has been a research gap in the sense that the Modular group is connected to two numbers. Thus, this paper attempts to contribute to the studies developed by Gauss, Bolyai, Lobachevsky and Riemann.…
We study generalizations of the "contraction-deletion" relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman,…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
A diagrammatic expansion of coefficients in the low-momentum expansion of the genus-one four-particle amplitude in type II superstring theory is developed. This is applied to determine coefficients up to order s^6R^4 (where s is a…
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…
We prove that the graph of a discontinuous $n$-monomial function $f:\mathbb{R}\to\mathbb{R}$ is either connected or totally disconnected. Furthermore, the discontinuous monomial functions with connected graph are characterized as those…
In this study, we take a systematic look at the unrealised part of public transport networks (PTNs) with functional connections. We consider their complement graphs and study their structure. The complement graph $\bar G$ of an unweighted…
We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…
A constructive characterization of the class of uniformly $4$-connected graphs is presented. The characterization is based on the application of graph operations to appropriate vertex and edge sets in uniformly $4$-connected graphs, that…
The Feynman diagrams of the Green's function expansion of fermions interacting with a non-relativistic 2-body interaction are displayed in first, second and third order of the interaction as 2, 10 and 74 diagrams, respectively. A name…