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 characteristic polynomial of the Grover matrix by using the determinant expression for the second weighted zeta function of a finite graph. In this paper, we focus on a relationship between the Grover walk and the generalized Ihara zeta function. That is to say, we treat the generalized Ihara zeta function of the one-dimensional integer lattice as a limit of the Ihara zeta function of the cycle graph.
In this article, we introduce an entropy based on the formal power series expansion of the Ihara Zeta function. We find a number of inequalities based on the values of the Ihara zeta function. These new entropies are applicable in symbolic dynamics and the dynamics of billiards.
The Ihara expression of a weighted zeta function for a general finite digraph is given. It unifies all the Ihara expressions obtained for known zeta functions for finite digraphs. Any digraph in this paper permits multi-edges and multi-loops.
We define a new weighted zeta function for a finite digraph and obtain its determinant expression called the Ihara expression. The graph zeta function is a generalization of the weighted graph zeta function introduced in previous research. That is, our result makes it possible to derive the Ihara expressions of the previous graph zeta functions for any finite digraphs.
We consider the ensemble of $N\times N$ real random symmetric matrices $H_N^{(R)}$ obtained from the determinant form of the Ihara zeta function associated to random graphs $Γ_N^{(R)}$ of the long-range percolation radius model with the edge probability determined by a function $ϕ(t)$. We show that the normalized eigenvalue counting function of $H_N^{( R)}$ weakly converges in average as $N,R\to\infty$, $R=o(N)$ to a unique measure that depends on the limiting average vertex degree of $Γ_N^{(R)}$ given by $ϕ_1 = \int ϕ(t) dt$. This measure converges in the limit of infinite $ϕ_1$ to a shift of…
We consider the ensemble of real symmetric random matrices $H^{(n,ρ)}$ obtained from the determinant form of the Ihara zeta function of random graphs that have $n$ vertices with the edge probability $ρ/n$. We prove that the normalized eigenvalue counting function of $H^{(n,ρ)}$ weakly converges in average as $n,ρ\to\infty$ and $ρ=o(n^α)$ for any $α>0$ to a shift of the Wigner semi-circle distribution. Our results support a conjecture that the large Erdos-Rényi random graphs satisfy in average the weak graph theory Riemann Hypothesis.
The theory of Ihara zeta functions is extended to infinite graphs which are weighted and of finite total weight. In this case one gets meromorphic instead of rational functions and the classical determinant formulas of Bass and Ihara hold true with Fredholm determinants.
We establish a generalized Ihara zeta function formula for simple graphs with bounded degree. This is a generalization of the formula obtained by G. Chinta, J. Jorgenson and A. Karlsson from a vertex-transitive graph.
In this paper, using matrix techniques, we compute the Ihara-zeta function and the number of spanning trees of the join of two semi-regular bipartite graphs. Furthermore, we show that the spectrum and the zeta function of the join of two semi-regular bipartite graphs can determine each other.
The infinite grid is the Cayley graph of $\mathbb{Z} \times \mathbb{Z}$ with the usual generators. In this paper, the Ihara zeta function for the infinite grid is computed using elliptic integrals and theta functions. The zeta function of the grid extends to an analytic, multivalued function which satisfies a functional equation. The set of singularities in its domain is finite. The grid zeta function is the first computed example which is non-elementary, and which takes infinitely many values at each point of its domain. It is also the limiting value of the normalized sequence of Ihara zeta f…
We derive combinatorial proofs of the main two evaluations of the Ihara-Selberg Zeta function associated with a graph. We give three proofs of the first evaluation all based on the algebra of Lyndon words. In the third proof it is shown that the first evaluation is an immediate consequence of Amitsur's identity on the characteristic polynomial of a sum of matrices. The second evaluation of the Ihara-Selberg Zeta function is first derived by means of a sign-changing involution technique. Our second approach makes use of a short matrix-algebra argument.
In this paper, we give a more direct proof of the results by Clair and Mokhtari-Sharghi on the zeta functions of periodic graphs. In particular, using appropriate operator-algebraic techniques, we establish a determinant formula in this context and examine its consequences for the Ihara zeta function. Moreover, we answer in the affirmative one of the questions raised by Grigorchuk and Zuk. Accordingly, we show that the zeta function of a periodic graph with an amenable group action is the limit of the zeta functions of a suitable sequence of finite subgraphs.
The definition and main properties of the Ihara zeta function for graphs are reviewed, focusing mainly on the case of periodic simple graphs. Moreover, we give a new proof of the associated determinant formula, based on the treatment developed by Stark and Terras for finite graphs.
We establish a new formula for the heat kernel on regular trees in terms of classical I-Bessel functions. Although the formula is explicit, and a proof is given through direct computation, we also provide a conceptual viewpoint using the horocyclic transform on regular trees. From periodization, we then obtain a heat kernel expression on any regular graph. From spectral theory, one has another expression for the heat kernel as an integral transform of the spectral measure. By equating these two formulas and taking a certain integral transform, we obtain several generalized versions of the dete…
Using recent results on the concentration of the largest eigenvalue and maximal vertex degree of large random graphs, we show that the infinite sequence of Erd\H os-Rényi random graphs $G(n,ρ_n/n)$ such that $ρ_n/\log n$ infinitely increases as $n\to\infty$ verifies a version of the graph theory Riemann Hypothesis.
We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, periodic graphs, graphings and percolation graphs. Making use of Connes' non-commutative integration theory we construct a Zeta function and present a determinant formula for it. We further introduce a notion of weak convergence of measure graphs and show that our construction is compatible with it. The approximation of the Ihara Zeta function via the normalized version on finite graphs in the sens…
Starting with Ihara's work in 1968, there has been a growing interest in the study of zeta functions of finite graphs, by Sunada, Hashimoto, Bass, Stark and Terras, Mizuno and Sato, to name just a few authors. Then, Clair and Mokhtari-Sharghi have studied zeta functions for infinite graphs acted upon by a discrete group of automorphisms. The main formula in all these treatments establishes a connection between the zeta function, originally defined as an infinite product, and the Laplacian of the graph. In this article, we consider a different class of infinite graphs. They are fractal graphs, …
Recently the Ihara zeta function for the finite graph was extended to infinite one by Clair and Chinta et al. In this paper, we obtain the same expressions by a different approach from their analytical method. Our new approach is to take a suitable limit of a sequence of finite graphs via the Konno-Sato theorem. This theorem is related to explicit formulas of characteristic polynomials for the evolution matrix of the Grover walk. The walk is one of the most well-investigated quantum walks which are quantum counterpart of classical random walks. We call the relation between the Grover walk and …
We show that if a graph $G$ has average degree $\bar d \geq 4$, then the Ihara zeta function of $G$ is edge-reconstructible. We prove some general spectral properties of the edge adjacency operator $T$: it is symmetric for an indefinite form and has a "large" semi-simple part (but it can fail to be semi-simple in general). We prove that this implies that if $\bar d>4$, one can reconstruct the number of non-backtracking (closed or not) walks through a given edge, the Perron-Frobenius eigenvector of $T$ (modulo a natural symmetry), as well as the closed walks that pass through a given edge in bo…
Let $X$ denote a connected $(q+1)$-regular undirected graph of finite order $n$. The graph $X$ is called Ramanujan whenever $$ |λ|\leq 2q^{\frac{1}{2}} $$ for all nontrivial eigenvalues $λ$ of $X$. We consider the variant $Ξ(u)$ of the Ihara zeta function $Z(u)$ of $X$ defined by \begin{gather*} Ξ(u)^{-1} = \left\{ \begin{array}{ll} (1-u)(1-qu)(1-q^{\frac{1}{2}} u)^{2n-2}(1-u^2)^{\frac{n(q-1)}{2}} Z(u) \qquad &\hbox{if $X$ is nonbipartite}, (1-q^2u^2) (1-q^{\frac{1}{2}} u)^{2n-4} (1-u^2)^{\frac{n(q-1)}{2}+1} Z(u) \qquad &\hbox{if $X$ is bipartite}. \end{array} \right. \end{gather*} The functio…
We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function and a generalized zeta function of a graph $G$ with respect to its generalized Grover matrix as an analog of the Ihara zeta function and present explicit formulas for their zeta functions for a vertex-transitive graph. As applications, we express the limit on the generalized zeta functions of a family of finite vertex-transitive regular graphs by an integra…
We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto's factorization results for biregular bipartite graphs apply, leading to exact factorizations. For $(d,r)$-regular hypergraphs, we show that a modified Riemann hypothesis is true if and only if the hypergraph is Ramanujan in the sense of Winnie Li and Patrick Solé. Finally, we give an example to show how the generalized zeta function can be applied to graphs to distinguish non-isomorphic graphs with the same Ihara-Selberg zeta function.
In this paper, following the recent paper on Walk/Zeta Correspondence by the first author and his coworkers, we compute the zeta function for the three- and four-state quantum walk and correlated random walk, and the multi-state random walk on the one-dimensional torus by using the Fourier analysis. We deal with also the four-state quantum walk and correlated random walk on the two-dimensional torus. In addition, we introduce a new class of models determined by the generalized Grover matrix bridging the gap between the Grover matrix and the positive-support of the Grover matrix. Finally, we gi…
Our previous work presented explicit formulas for the generalized zeta function and the generalized Ihara zeta function corresponding to the Grover walk and the positive-support version of the Grover walk on the regular graph via the Konno-Sato theorem, respectively. This paper extends these walks to a class of walks including random walks, correlated random walks, quantum walks, and open quantum random walks on the torus by the Fourier analysis.
We consider the Ihara zeta function $ζ(u,X//G)$ and Artin-Ihara $L$-function of the quotient graph of groups $X//G$, where $G$ is a group acting on a finite graph $X$ with trivial edge stabilizers. We determine the relationship between the primes of $X$ and $X//G$ and show that $X\to X//G$ can be naturally viewed as an unramified Galois covering of graphs of groups. We show that the $L$-function of $X//G$ evaluated at the regular representation is equal to $ζ(u,X)$ and that $ζ(u,X//G)$ divides $ζ(u,X)$. We derive two-term and three-term determinant formulas for the zeta and $L$-functions, and …
Conjecturally, almost all graphs are determined by their spectra. This problem has also been studied for variants such as the spectra of the Laplacian and signless Laplacian. Here we consider the problem of determining graphs with Ihara and Bartholdi zeta functions, which are also computable in polynomial time. These zeta functions are geometrically motivated, but can be viewed as certain generalizations of characteristic polynomials. After discussing some graph properties determined by zeta functions, we show that large classes of cospectral graphs can be distinguished with zeta functions and…
In this article, we define an information-theoretic entropy based on the Ihara zeta function of a graph which is called the Ihara entropy. A dynamical system consists of a billiard ball and a set of reflectors correspond to a combinatorial graph. The reflectors are represented by the vertices of the graph. Movement of the billiard ball between two reflectors is represented by the edges. The prime cycles of this graph generate the bi-infinite sequences of the corresponding symbolic dynamical system. The number of different prime cycles of a given length can be expressed in terms of the adjacenc…
We define a zeta function woth respect to the twisted Grover matrix of a mixed digraph, and present an exponential expression and a determinant expression of this zeta function. As an application, we give a trace formula with respect to the twisted Grover matrix of a mixed digraph.
We present the structure theorem for the positive support of the cube of the Grover transition matrix of the discrete-time quantum walk (the Grover walk) on a general graph $G$ under same condition. Thus, we introduce a zeta function on the positive support of the cube of the Grover transition matrix of $G$, and present its Euler product and its determinant expression. As a corollary, we give the characteristic polynomial for the positive support of the cube of the Grover transition matrix of a regular graph, and so obtain its spectra. Finally, we present the poles and the radius of the conver…
In this paper we study spectral zeta functions associated to finite and infinite graphs. First we establish a meromorphic continuation of these functions under some general conditions. Then we study special values in the case of standard lattice graphs associated to free abelian groups. In particular we connect it to Catalan numbers in several ways, and obtain some non-trivial special values and functional symmetries. Furthermore we relate the values at the negative integers with the more studied Ihara zeta functions, and prove a few minor results that seem not to have been recorded before. Fi…
We establish the quaternionic weighted zeta function of a graph and its Study determinant expressions. For a graph with quaternionic weights on arcs, we define a zeta function by using an infinite product which is regarded as the Euler product. This is a quaternionic extension of the square of the Ihara zeta function. We show that the new zeta function can be expressed as the exponential of a generating function and that it has two Study determinant expressions, which are crucial for the theory of zeta functions of graphs.
The definitions and main properties of the Ihara and Bartholdi zeta functions for infinite graphs are reviewed. The general question of the validity of a functional equation is discussed, and various possible solutions are proposed.
We establish a generalization of the second weighted zeta function of a graph to the case of quaternions. For an arc-weighted graph whose weights are quaternions, we define the second weighted zeta function by using the Study determinant that is a quaternionic determinant for quaternionic matrices defined by Study. This definition is regarded as a quaternionic analogue of the determinant expression of Hashimoto type for the Ihara zeta function of a graph. We derive the Study determinant expression of Bass type and the Euler product for the quaternionic second weighted zeta function.
Let $π=\{V_1,\dots,V_r\}$ be an equitable partition of the vertex set of a directed graph (digraph) $X$. It is well known that the characteristic polynomial $ϕ(X/π,x)$ of a quotient graph $X/π$ divides that of $X$, but the remainder part is not well investigated. In this paper, we define a deletion graph $X\backslashπ$ over an equitable partition $π$, which is a signed directed graph defined for a fixed set of deleting vertices $\{\bar{v}_i\in V_i, i=1,\cdots,r\}$, and give a similarity transformation exchanging the adjacency matrix $A(X)$ which is compatible with the equitable partition for a…
Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph properties which we can determine using the edge zeta function. In particular, the edge zeta function is enough to deduce the clique number, the number of Hamiltonian cycles, and whether a graph is perfect or chordal. Actually computing these properties takes exponential time. Finally, we present a new example illustrating that the Ihara zeta function canno…
We consider the alternating zeta function and the alternating $L$-function of a graph $G$, and express them by using the Ihara zeta function of $G$. Next, we define a generalized alternating zeta function of a graph, and express the generalized alternating zeta function of a vertex-transitive regular graph by spectra of the transition probability matrix of the symmetric simple random walk on it and its Laplacian. Furthermore, we present an integral expression for the limit of the generalized alternating zeta functions of a series of vertex-transitive regular graphs. As an example, we treat the…
We introduce a generalized Bartholdi zeta function for simple graphs with bounded degree. This zeta function is a generalization of both the Bartholdi zeta function which was introduced by L.~Bartholdi and the Ihara zeta function which was introduced by G.~Chinta, J.~Jorgenson and A.~Karlsson. Furthermore, we establish a Bartholdi type formula of this Bartholdi zeta function for simple graphs with bounded degree. Moreover, for regular graphs, we give a new expression of the heat kernel which is regarded as a one-parameter deformation of the expression obtained by G.~Chinta, J.~Jorgenson and A.…
We discuss two combinatorical ways of generalizing the definition of expander graphs and Ramanujan graphs, to quotients of buildings of higher dimension. The two possible definitions are equivalent for affine buildings, giving the notion of an Lp-expander complex. We calculate explicit spectral gaps on many combinatorical operators, on any Lp-expander complex. We associate with any complex a natural "zeta function", generalizing the Ihara-Hashimoto zeta function of a finite graph. We generalize a well known theorem of Hashimoto, showing that a complex is Ramanujan if and only if the zeta funct…
We initiate the study of spectral zeta functions $ζ_{X}$ for finite and infinite graphs $X$, instead of the Ihara zeta function, with a perspective towards zeta functions from number theory and connections to hypergeometric functions. The Riemann hypothesis is shown to be equivalent to an approximate functional equation of graph zeta functions. The latter holds at all points where Riemann's zeta function $ζ(s)$ is non-zero. This connection arises via a detailed study of the asymptotics of the spectral zeta functions of finite torus graphs in the critcal strip and estimates on the real part of …
This paper is about the determinantal identities associated with the Ihara (Ih) zeta function of a non directed graph and the Bowen-Lanford (BL) zeta function of a directed graph. They will be called the Ih and the BL identities in this paper. We show that the Witt identity (WI) is a special case of the BL identity and inspired by the links the WI has with Lie algebras and combinatorics we investigate similar aspects of the Ih and BL identities. We show that they satisfy generalizations of the Strehl identity and Carlitz, Metropolis-Rota relations and each one of them can be interpreted as the…
We define a correlated random walk (CRW) induced from the time evolution matrix (the Grover matrix) of the Grover walk on a graph $G$, and present a formula for the characteristic polynomial of the transition probability matrix of this CRW by using a determinant expression for the generalized weighted zeta function of $G$. As applications, we give the spectrum of the transition probability matrices for the CRWs induced from the Grover matrices of regular graphs and semiregular bipartite graphs. Furthermore, we consider another type of the CRW on a graph.
Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose letters, the edges of the graph, obey a specific commutation rule. A particularclass of traces emerges from this framework, the hikes, whose alphabet is the set of simple cycleson the graph. We show that hikes characterize undirected graphs uniquely, up to isomorphism, andsatisfy remarkable algebraic properties such as the existence and uniqueness of a prime factorization.Because of this, the set of hikes partially ordered by divisibility hosts a plethora of relations in directcorrespondence with…
We study a class of determinant inequalities that are closely related to Sidorenko's famous conjecture (Also conjectured by Erd\H os and Simonovits in a different form). Our main result can also be interpreted as an entropy inequality for Gaussian Markov random fields (GMRF). We call a GMRF on a finite graph $G$ homogeneous if the marginal distributions on the edges are all identical. We show that if $G$ is bipartite then the differential entropy of any homogeneous GMRF on $G$ is at least $|E(G)|$ times the edge entropy plus $|V(G)|-2|E(G)|$ times the point entropy. We also show that in the ca…
Shanghai Institute for Mathematics and Interdisciplinary Sciences (SIMIS)（上海数学与交叉学科研究院）；Research Institute of Intelligent Complex Systems, Fudan University（复旦大学智能复杂系统研究院）
A non-backtracking walk on a graph, $H$, is a directed path of directed edges of $H$ such that no edge is the inverse of its preceding edge. Non-backtracking walks of a given length can be counted using the non-backtracking adjacency matrix, $B$, indexed by $H$'s directed edges and related to Ihara's Zeta function. We show how to determine $B$'s spectrum in the case where $H$ is a tree covering a finite graph. We show that when $H$ is not regular, this spectrum can have positive measure in the complex plane, unlike the regular case. We show that outside of $B$'s spectrum, the corresponding Gre…
