We define a zeta function of a finite graph derived from time evolution matrix of quantum walk, and give its determinant expression. Furthermore, we generalize the above result to a periodic graph.
We define a zeta function of a graph by using the time evolution matrix of a general coined quantum walk on it, and give a determinant expression for the zeta function of a finite graph. Furthermore, we present a determinant expression for the zeta function of an (infinite) periodic graph.
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 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…
We present the characteristic polynomial for the transition matrix of a vertex-face walk on a graph, and obtain its spectra. Furthermore, we express the characteristic polynomial for the transition matrix of a vertex-face walk on the 2-dimensional torus by using its adjacency matrix, and obtain its spectra. As an application, we define a new walk-type zeta function with respect to the transition matrix of a vertex-face walk on the 2-dimensional torus, and present its explicit formula.
This paper gives the quantum walks determined by graph zeta functions. The result enables us to obtain the characteristic polynomial of the transition matrix of the quantum walk, and it determines the behavior of the quantum walk. We treat finite graphs allowing multi-edges and multi-loops.
We define a new weighted zeta function for a finite graph and obtain its determinant expression. This result gives the characteristic polynomial of the transition matrix of the Szegedy walk on a graph.
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.
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 z…
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…
The Ronkin function was defined by Ronkin in the consideration of the zeros of almost periodic function. Recently, this function has been used in various research fields in mathematics, physics and so on. Especially in mathematics, it has a closed connections with tropical geometry, amoebas, Newton polytopes and dimer models. On the other hand, we have been investigated a new class of zeta functions for various kinds of walks including quantum walks by a series of our previous work on Zeta Correspondence. The quantum walk is a quantum counterpart of the random walk. In this paper, we present a…
The Mahler measure was introduced by Mahler in the study of number theory. It is known that the Mahler measure appears in different areas of mathematics and physics. On the other hand, we have been investigated a new class of zeta functions for various kinds of walks including quantum walks by a series of our previous work on "Zeta Correspondence". The quantum walk is a quantum counterpart of the random walk. In this paper, we present a new relation between the Mahler measure and our zeta function for quantum walks. Firstly we consider this relation in the case of one-dimensional quantum walks…
Our previous works presented zeta functions by the Konno-Sato theorem or the Fourier analysis for one-particle models including random walks, correlated random walks, quantum walks, and open quantum random walks. This paper introduces a new zeta function for multi-particle models with probabilistic or quantum interactions, called the interacting particle system (IPS). We compute the zeta function for some tensor-type IPSs.
We present an explicit formula for the characteristic polynomial of the transition matrix of the discrete-time quantum walk on a graph via the second weighted zeta function. As applications, we obtain new proofs for the results on spectra of the transition matrix and its positive support.
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 …
In our previous work, we investigated the relation between zeta functions and discrete-time models including random and quantum walks. In this paper, we introduce a zeta function for the continuous-time model (CTM) and consider CTMs including the corresponding random and quantum walks on the d-dimensional torus.
Zeta functions of periodic cubical lattices are explicitly derived by computing all the eigenvalues of the adjacency operators and their characteristic polynomials. We introduce cyclotomic-like polynomials to give factorization of the zeta function in terms of them and count the number of orbits of the Galois action associated with each cyclotomic-like polynomial to obtain its further factorization. We also give a necessary and sufficient condition for such a polynomial to be irreducible and discuss its irreducibility from this point of view.
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.
In rotor walk on a finite directed graph, the exits from each vertex follow a prescribed periodic sequence. Here we consider the case of rotor walk where a particle starts from a designated source vertex and continues until it hits a designated target set, at which point the walk is restarted from the source. We show that the sequence of successively hit targets, which is easily seen to be eventually periodic, is in fact periodic. We show moreover that reversing the periodic patterns of all rotor sequences causes the periodic pattern of the hitting sequence to be reversed as well. The proofs i…
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…
In this paper we study a class of discrete quantum walks, known as bipartite walks. These include the well-known Grover's walks. Any discrete quantum walk is given by the powers of a unitary matrix $U$ indexed by arcs or edges of the underlying graph. The walk is periodic if $U^k=I$ for some positive integer $k$. Kubota has given a characterization of periodicity of Grover's walk when the walk is defined on a regular bipartite graph with at most five eigenvalues. We extend Kubota's results--if a biregular graph $G$ has eigenvalues whose squares are algebraic integers with degree at most two, w…
We determine connected bipartite regular graphs with four distinct adjacency eigenvalues that induce periodic Grover walks, and show that it is only $C_6$. We also show that there are only three kinds of the second largest eigenvalues of bipartite regular periodic graphs with five distinct eigenvalues. Using walk-regularity, we enumerate feasible spectra for such graphs.
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…
Characterizations graphs of some classes to induce periodic Grover walks have been studied for recent years. In particular, for the strongly regular graphs, it has been known that there are only three kinds of such graphs. Here, we focus on the periodicity of the Grover walks on distance-regular graphs. The distance-regular graph can be regarded as a kind of generalization of the strongly regular graphs and the typical graph with an equitable partition. In this paper, we find some classes of such distance-regular graphs and obtain some useful necessary conditions to induce periodic Grover walk…
The aim of the current work is to prove a law of large numbers for the range size of recurrent rotor walks with random initial configuration on a general class of trees, called periodic trees or directed covers of graphs.
In this paper, we determine periodicity of quantum walks defined by mixed paths and mixed cycles. By the spectral mapping theorem of quantum walks, consideration of periodicity is reduced to eigenvalue analysis of $η$-Hermitian adjacency matrices. First, we investigate coefficients of the characteristic polynomials of $η$-Hermitian adjacency matrices. We show that the characteristic polynomials of mixed trees and their underlying graphs are same. We also define $n+1$ types of mixed cycles and show that every mixed cycle is switching equivalent to one of them. We use these results to discuss pe…
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.
We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the vertex set $V$ and the period $t$ approach $\infty$ with $t/V\rightarrow τ$ for any $τ$. This formula is based on the conjecture that the spectral statistics of the adjacency eigenvalues is given by Random Matrix Theory (RMT). We provide numerical and theoretical evidence for the validity of this conjecture. The key tool used in this study is a trace formula whi…
In this paper we extend the study of three state lively quantum walks on cycles by considering the coin operator as a linear sum of permutation matrices, which is a generalization of the Grover matrix. First we provide a complete characterization of orthogonal matrices of order $3\times 3$ which are linear sum of permutation matrices. Consequently, we determine several groups of complex, real and rational orthogonal matrices. We establish that an orthogonal matrix of order $3\times 3$ is a linear sum of permutation matrices if and only if it is permutative. Finally we determine period of livel…
Gessel walks are lattice paths confined to the quarter plane that start at the origin and consist of unit steps going either West, East, South-West or North-East. In 2001, Ira Gessel conjectured a nice closed-form expression for the number of Gessel walks ending at the origin. In 2008, Kauers, Koutschan and Zeilberger gave a computer-aided proof of this conjecture. The same year, Bostan and Kauers showed, again using computer algebra tools, that the complete generating function of Gessel walks is algebraic. In this article we propose the first "human proofs" of these results. They are derived …
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix quantum walk model, the number of edges is bounded below by a cubic function on the eccentricity of a periodic vertex. This gives some idea on the shape of a graph that would admit periodicity or perfect state transfer. We also raise some extremal type of questions in the end that could lead to future research.
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…