Asymptotic behavior of the transition probability of a random walk on an infinite graph (Q1281653)

Let \(p(n,x,y)\) be an \(n\)-step transition probability of a random walk on an infinite graph \(X\) with transition probability \(p(e)\) between the original point and the end point of the edge \(e\) in one unit time and with reversible measure \(m(e)\). Assume that \(\Gamma\) is a group acting freely on \(X\) such that the quotient graph \(X_0=X/\Gamma\) is finite and \(p(\cdot),m(\cdot)\) are invariant under \(\Gamma\). The asymptotic property is studied. To do this, a systematic discrete analogue of the spectral geometry of the discrete Laplacian [for the manifold counterpart, see \textit{A. Katsuda} and \textit{T. Sunada}, Am. J. Math. 110, No. 1, 145-155 (1988; Zbl 0647.53036)] is developed. And the asymptotic is then approached via the perturbation theory of the maximal eigenvalue of the wisted transition operator \(L_{\chi}\), that is, the generator L of the random walk confined on the space \(l_{\chi}^2=\{f:f\to \mathbf C\mid f(\sigma x)=\chi (\sigma)f(x)\) for \(\sigma\in\Gamma \}\) where \(\chi\) is a homomorphism: \(\Gamma\to U(1)\). The main results are: If \(X\) is non-bipartition, then \(p(n,x,y)\sim\frac {2m(y)m(\mathcal F)^{k/2-1}}{\text{Vol}(\widehat{\Gamma })}(4\pi n)^{-k/2}\) as \(n\to\infty\), where \(\widehat{\Gamma}\) is the group of unitary characters of \(\Gamma\), \(\mathcal F\) is a subset of \(V\), the set of vertices, satisfying \(V=\bigcup_{\sigma\in\Gamma}\sigma \mathcal F\) where \(X\) is said to be bipartition if every closed path has even length. Moreover, if \(X\) is bipartition, then the above asymptotic only holds for even \(n\) in case of \(x,y\) in the same partition and for odd \(n\) in case of \(x,y\) in different partitions and \(p(n,x,y)=0\) in all other cases. Some typical examples of \(\text{Vol}(\widehat{\Gamma })\) are computed.