Some relations between the spectra of simple and non-backtracking random walks

Abstract

We establish some relations between the spectra of simple and non-backtracking random walks on non-regular graphs, generalizing some well-known facts for regular graphs. Our two main results are 1) a quantitative relation between the mixing rates of the simple random walk and of the non-backtracking random walk 2) a variant of the "Ihara determinant formula" which expresses the characteristic polynomial of the adjacency matrix, or of the laplacian, as the determinant of a certain non-backtracking random walk with holomorphic weights.

Cited by in corpus (3)

• Quantum ergodicity for expanding quantum graphs in the regime of spectral delocalization
• Edge Laplacians and Edge Poisson Transforms for Graphs
• Norm of matrix-valued polynomials in random unitaries and permutations