Effects of Backtracking on PageRank

arXiv2211.13353MaRDI QIDQ6418322FDOQ6418322

Authors: Cory Glover, Tyler Jones, Mark Kempton 

Publication date: 23 November 2022

Abstract: In this paper, we consider three variations on standard PageRank: Non-backtracking PageRank, $mu$-PageRank, and $infty$-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.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

This page was built for publication: Effects of Backtracking on PageRank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418322)