Random Surfing Without Teleportation

TL;DR

This paper explores conditions for defining PageRank-like rankings without teleportation, addressing limitations of the standard model by leveraging space decomposition within the NCDawareRank framework.

Contribution

It introduces necessary and sufficient conditions for random surfing without teleportation, improving understanding of ranking vector properties.

Findings

Conditions for teleportation-free ranking established

Decomposition of space into blocks is key

Enhanced ranking vector quality without teleportation

Abstract

In the standard Random Surfer Model, the teleportation matrix is necessary to ensure that the final PageRank vector is well-defined. The introduction of this matrix, however, results in serious problems and imposes fundamental limitations to the quality of the ranking vectors. In this work, building on the recently proposed NCDawareRank framework, we exploit the decomposition of the underlying space into blocks, and we derive easy to check necessary and sufficient conditions for random surfing without teleportation.