# Effects of Backtracking on PageRank

arXiv: https://arxiv.org/abs/2211.13353 · HTML: https://mlsanity.com/paper/2211.13353/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Nov 2022.

## Built on by (most cited first, 1 of 1)

- [node2vec or triangle-biased random walks: stationarity, regularity & recurrence](https://mlsanity.com/paper/2604.13681/) (2026)

## Abstract (arXiv)

In this paper, we consider three variations on standard PageRank: Non-backtracking PageRank, μ-PageRank, and ∞-PageRank, all of which alter the standard formula by adjusting the likelihood of backtracking in the algorithm's random walk. We show that in the case of regular and bipartite biregular graphs, standard PageRank and its variants are equivalent. We also compare each centrality measure and investigate their clustering capabilities.