2015/06/30 by Athanasios N. Nikolakopoulos, John D. Garofalakis · 1 citation
Computer Science · Physics and Astronomy · #cs.IR #cs.SI #physics.soc-ph
paper · pdf · doi:10.1007/978-3-319-24024-4_19
13 pages. Published in the Volume: "Algorithms, Probability, Networks and Games, Springer-Verlag, 2015". (The updated version corrects small typos/errors)
arxiv created 2016/04/19 · arxiv updated 2016/04/20
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.