Related papers: Grover/Zeta Correspondence based on the Konno-Sato…
A spidernet is a graph obtained by adding large cycles to an almost regular tree and considered as an example having intermediate properties of lattices and trees in the study of discrete-time quantum walks on graphs. We introduce the…
We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…
There is an extensive literature concerning self-avoiding walk on infinite graphs, but the subject is relatively undeveloped on finite graphs. The purpose of this paper is to elucidate the phase transition for self-avoiding walk on the…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
In this paper, we study graph-theoretic analogies of the Mertens' theorems by using basic properties of the Ihara zeta-function. One of our results is a refinement of a special case of the dynamical system Mertens' second theorem due to…
The walk distances in graphs are defined as the result of appropriate transformations of the $\sum_{k=0}^\infty(tA)^k$ proximity measures, where $A$ is the weighted adjacency matrix of a connected weighted graph and $t$ is a sufficiently…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
The Rado graph, also known as the random graph $G(\infty, p)$, is a classical limit object for finite graphs. We study natural ball walks as a way of understanding the geometry of this graph. For the walk started at $i$, we show that order…
In this paper, we study Grover's search algorithm focusing on continuous-time quantum walk on graphs. We propose an alternative optimization approach to Grover's algorithm on graphs that can be summarized as follows: instead of finding…
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…
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…
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…
Given a real number $ \beta > 1$, we study the associated $ (-\beta)$-shift introduced by S. Ito and T. Sadahiro. We compares some aspects of the $(-\beta)$-shift to the $\beta$-shift. When the expansion in base $ -\beta $ of $…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
Lin and Wang defined a model of random walks on knot diagrams and interprete the Alexnader polynomials and the colored Jones polynomials as Ihara zeta functions, i.e. zeta functions defined by counting cycles on the knot diagram. Using this…
We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…
We initiate the study of spectral zeta functions $\zeta_{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.…
In this work, we explore a link between an unbounded spin system given by a system of stochastic differential equations and a random walk. This allows us to study the decay of the (co)variance of functions with respect to time. We extend…