Ihara zeta function

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, the Ihara zeta-function is a zeta function associated with a finite graph. It closely resembles the Selberg zeta-function, and is used to relate closed paths to the spectrum of the adjacency matrix. The Ihara zeta-function was first defined by Yasutaka Ihara in the 1960s in the context of discrete subgroups of the two-by-two p-adic special linear group. Jean-Pierre Serre suggested in his book Trees that Ihara's original definition can be reinterpreted graph-theoretically. It was Toshikazu Sunada who put this suggestion into practice (1985). As observed by Sunada, a regular graph is a Ramanujan graph if and only if its Ihara zeta function satisfies an analogue of the Riemann hypothesis.[1]


The Ihara zeta-function can be defined by a formula analogous to the Euler product for the Riemann zeta function:

This product is taken over all prime walks p of the graph – that is, closed cycles such that

and is the length of cycle p, as used in the formulae above.[2] This formulation in graph-theoretic setting is due to Sunada.

Ihara's formula[edit]

Ihara (and Sunada in the graph-theoretic setting) showed that for regular graphs the zeta function is a rational function. If G is k-regular with adjacency matrix A then[3]

where χ is the circuit rank.

The Ihara zeta-function is in fact always the reciprocal of a polynomial:

where T is Hashimoto's edge adjacency operator. Hyman Bass gave a determinant formula involving the adjacency operator.


The Ihara zeta function plays an important role in the study of free groups, spectral graph theory, and dynamical systems, especially symbolic dynamics, where the Ihara zeta function is an example of a Ruelle zeta function.[4]


  1. ^ Terras (1999) p. 678
  2. ^ Terras (2010) p. 12
  3. ^ Terras (1999) p. 677
  4. ^ Terras (2010) p. 29