Remarks on the recurrence and transience of non-backtracking random walks (Q2188745)

The setting of the article is a given regular infinite graph with transition probabilities (a graph is regular if and only if all the vertex degrees are the same). Non-backtracking random walks are random processes defined on such graphs. Recurrences of these random walks are compared with simple random walks and it is shown that they are equivalent. Moreover, the article shows how to generalize the proof to certain non-regular graphs.