Related papers: On graph theory Mertens' theorems
The theory of Ihara zeta functions is extended to non-compact arithmetic quotients of Bruhat-Tits trees. This new zeta function turns out to be a rational function, despite the infinite-dimensional setting. In general it has zeros and…
We present a short proof of Szemer\'edi's Theorem using a dynamical system enriched by ideas from model theory. The resulting proof contains features reminiscent of proofs based on both ergodic theory and on hypergraph regularity.
We prove that if $\omega$ is uniformly distributed on $[0,1]$, then as $T\to\infty$, $t\mapsto \zeta(i\omega T+it+1/2)$ converges to a non-trivial random generalized function, which in turn is identified as a product of a very well behaved…
Chinta, Jorgenson and Karlsson introduced a generalized version of the determinant formula for the Ihara zeta function associated to finite or infinite regular graphs. On the other hand, Konno and Sato obtained a formula of the…
In this paper, we consider an extended Kazakov-Migdal model defined on an arbitrary graph. The partition function of the model, which is expressed as the summation of all Wilson loops on the graph, turns out to be represented by the…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
We study the basic relation between skew-symmetric Lotka-Volterra systems and graphs, both at the level of objects and morphisms, and derive a classification from it of skew-symmetric Lotka-Volterra systems in terms of graphs as well as in…
In recent years, algorithms and neural architectures based on the Weisfeiler-Leman algorithm, a well-known heuristic for the graph isomorphism problem, emerged as a powerful tool for (supervised) machine learning with graphs and relational…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
In this paper, we describe some recent spectral Moore theorems related to determining the maximum order of a connected graph of given valency and second eigenvalue. We show how these spectral Moore theorems have applications in Alon-Boppana…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
The topological zeta function of a matroid is a rational function as well as a valuative invariant of the matroid, encoding rich combinatorial information. We analyze topological zeta functions of matroids from the vantage point of several…
In [1] M. Baker and S. Norine developed a theory of divisors and linear systems on graphs, and proved a Riemann-Roch Theorem for these objects (conceived as integer-valued functions on the vertices). In [2] and [3] the authors generalized…
By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.
We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…
In this note we define L-functions of finite graphs and study the particular case of finite cycles in the spirit of a previous paper that studied spectral zeta functions of graphs. The main result is a suggestive equivalence between an…
Graphity models are characterized by configuration spaces in which states correspond to graphs and Hamiltonians that depend on local properties of graphs such as the degrees of vertices and numbers of short cycles. As statistical systems,…
We address questions posed by Lorenzini about relations between Jacobians, Tutte polynomials, and the Brill-Noether theory of finite graphs, as encoded in his two-variable zeta functions. In particular, we give examples showing that none of…
We define an analytic version of the graph property testing problem, which can be formulated as studying an unknown 2-variable symmetric function through sampling from its domain and studying the random graph obtained when using the…