Ihara's zeta function for periodic graphs and its approximation in the amenable case

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 ...

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.

By a discrete torus we mean the Cayley graph associated to a finite product of finite cycle groups with generating set given by choosing a generator for each cyclic factor. In this article we study the spectral theory of the combinatorial Laplacian for sequences of discrete tori when the orders of the cyclic factors tend to infinity at comparable rates. First we show that the sequence of heat kernels corresponding to the degenerating family converges, after re-scaling, to the...

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.

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 de...

Several general results for the spectral determinant of the Schr\"odinger operator on metric graphs are reviewed. Then, a simple derivation for the $\zeta$-regularised spectral determinant is proposed, based on the Roth trace formula. Two types of boundary conditions are studied: functions continuous at the vertices and functions whose derivative is continuous at the vertices. The $\zeta$-regularised spectral determinant of the Schr\"odinger operator acting on functions with ...

Suppose that $\Gamma=(V,E)$ is a graph with vertices $V$, edges $E$, a free group action on the vertices $\mathbb{Z}^d \curvearrowright V$ with finitely many orbits, and a linear operator $D$ on the Hilbert space $l^2(V)$ such that $D$ commutes with the group action. Fix $\lambda \in \mathbb{R}$ in the pure-point spectrum of $D$ and consider the vector space of all eigenfunctions of finite support $K$. Then $K$ is a non-trivial finitely generated module over the ring of Laure...

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...

Adapting a method developed for the study of quantum chaos on {\it quantum (metric)} graphs \cite {KS}, spectral $\zeta$ functions and trace formulae for {\it discrete} Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph, and obtaining functions which belongs to the class of $\zeta$ functions proposed originally by Ihara \cite {Ihara}, and expanded by subsequent authors \cite {Stark,Sunada...

We study Harper operators and the closely related discrete magnetic Laplacians (DML) on a graph with a free action of a discrete group, as defined by Sunada. The spectral density function of the DML is defined using the von Neumann trace associated with the free action of a discrete group on a graph. The main result in this paper states that when the group is amenable, the spectral density function is equal to the integrated density of states of the DML that is defined using ...