graph
Graph may refer to:
Mathematics
*Graph (discrete mathematics), a structure made of vertices and edges
**Graph theory, the study of such graphs and their properties
*Graph (topology), a topological space resembling a graph in the sense of discre ...
. It closely resembles the
Selberg zeta function
The Selberg zeta-function was introduced by . It is analogous to the famous Riemann zeta function
: \zeta(s) = \prod_ \frac
where \mathbb is the set of prime numbers. The Selberg zeta-function uses the lengths of simple closed geodesics inste ...
, and is used to relate closed walks to the
spectrum
A spectrum (plural ''spectra'' or ''spectrums'') is a condition that is not limited to a specific set of values but can vary, without gaps, across a continuum. The word was first used scientifically in optics to describe the rainbow of color ...
of the
adjacency matrix
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.
In the special case of a finite simple ...
. The Ihara zeta function was first defined by
Yasutaka Ihara
Yasutaka Ihara (伊原 康隆, ''Ihara Yasutaka''; born 1938, Tokyo Prefecture) is a Japanese mathematician and professor emeritus at the Research Institute for Mathematical Sciences. His work in number theory includes Ihara's lemma and the Ihara ...
special linear group
In mathematics, the special linear group of degree ''n'' over a field ''F'' is the set of matrices with determinant 1, with the group operations of ordinary matrix multiplication and matrix inversion. This is the normal subgroup of the gen ...
.
Jean-Pierre Serre
Jean-Pierre Serre (; born 15 September 1926) is a French mathematician who has made contributions to algebraic topology, algebraic geometry, and algebraic number theory. He was awarded the Fields Medal in 1954, the Wolf Prize in 2000 and the ...
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 in 1985. As observed by Sunada, a
regular graph
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegre ...
is a
Ramanujan graph In the mathematical field of spectral graph theory, a Ramanujan graph is a regular graph whose spectral gap is almost as large as possible (see extremal graph theory). Such graphs are excellent spectral expanders. AMurty's survey papernotes, Ramanu ...
if and only if its Ihara zeta function satisfies an analogue of the
Riemann hypothesis
In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part . Many consider it to be the most important unsolved problem in pu ...
.
Definition
The Ihara zeta function is defined as the analytic continuation of the infinite product
The product in the definition is taken over all prime closed geodesics of the graph , where geodesics which differ by a cyclic rotation are considered equal. A ''closed geodesic'' on (known in graph theory as a " closed walk") is a finite sequence of vertices such that
:
:
The integer is the ''length'' of . The closed geodesic is ''prime'' if it cannot be obtained by repeating a closed geodesic times, for an integer .
This graph-theoretic formulation is due to Sunada.
Ihara's formula
Ihara (and Sunada in the graph-theoretic setting) showed that for regular graphs the zeta function is a rational function.
If is a -regular graph with
adjacency matrix
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.
In the special case of a finite simple ...
thenTerras (1999) p. 677
:
where is the
circuit rank
In graph theory, a branch of mathematics, the circuit rank, cyclomatic number, cycle rank, or nullity of an undirected graph is the minimum number of edges that must be removed from the graph to break all its cycle (graph theory), cycles, making ...
of . If is connected and has vertices, .
The Ihara zeta-function is in fact always the reciprocal of a
graph polynomial In mathematics, a graph polynomial is a graph invariant whose values are polynomials. Invariants of this type are studied in algebraic graph theory.
Important graph polynomials include:
*The characteristic polynomial, based on the graph's adjacency ...
:
:
where is Ki-ichiro Hashimoto's edge adjacency operator.
free group
In mathematics, the free group ''F'S'' over a given set ''S'' consists of all words that can be built from members of ''S'', considering two words to be different unless their equality follows from the group axioms (e.g. ''st'' = ''suu''− ...
s,
spectral graph theory
In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of matrices associated with the graph, such as its adjacency matrix or Laplacian mat ...
, and
dynamical systems
In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space. Examples include the mathematical models that describe the swinging of a clock pendulum, the flow of water in ...
, especially
symbolic dynamics In mathematics, symbolic dynamics is the practice of modeling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics ( ...
, where the Ihara zeta function is an example of a
Ruelle zeta function In mathematics, the Ruelle zeta function is a zeta function associated with a dynamical system. It is named after mathematical physicist David Ruelle.
Formal definition
Let ''f'' be a function defined on a manifold ''M'', such that the set of fix ...
.Terras (2010) p. 29
References
*
*
*
*
*
* {{cite book , title=Zeta Functions of Graphs: A Stroll through the Garden , volume=128 , series=Cambridge Studies in Advanced Mathematics , first=Audrey , last=Terras , authorlink=Audrey Terras , publisher=
Cambridge University Press
Cambridge University Press is the university press of the University of Cambridge. Granted letters patent by Henry VIII of England, King Henry VIII in 1534, it is the oldest university press in the world. It is also the King's Printer.
Cambr ...