Non-Backtracking Random Walks and Cogrowth of Graphs

DOI10.4153/CJM-2007-035-1zbMath1123.05081arXivmath/0403414OpenAlexW1986796100MaRDI QIDQ3590760

Wolfgang Woess, Ronald Ortner

Publication date: 3 September 2007

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0403414

zbMATH Keywords

finitely generated groupsMarkov chaintransition probabilities

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Structural characterization of families of graphs (05C75) Asymptotic properties of groups (20F69)

Related Items (17)

Amenability, critical exponents of subgroups and growth of closed geodesics ⋮ Critical exponents for groups of isometries. ⋮ Fractal models for normal subgroups of Schottky groups ⋮ Absolutely continuous spectrum for quantum trees ⋮ Unbounded Hermitian operators and relative reproducing kernel Hilbert space ⋮ Non-backtracking random walk ⋮ Algorithmically finite groups. ⋮ Kesten's theorem for invariant random subgroups. ⋮ Vertex reinforced non-backtracking random walks: an example of path formation ⋮ Analysis of unbounded operators and random motion ⋮ The measurable Kesten theorem ⋮ Reversibility of the non-backtracking random walk ⋮ Recent results of quantum ergodicity on graphs and further investigation ⋮ \(L^p\) norms and support of eigenfunctions on graphs ⋮ Group-extended Markov systems, amenability, and the Perron-Frobenius operator ⋮ Weighted cogrowth formula for free groups ⋮ The non-backtracking spectrum of the universal cover of a graph

This page was built for publication: Non-Backtracking Random Walks and Cogrowth of Graphs