Remarks on the recurrence and transience of non-backtracking random walks
classification
🧮 math.PR
math.CO
keywords
randomnon-backtrackingproofrecurrenceregularwalkcasescertain
read the original abstract
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.