arXiv · 1506.00092
Random Surfing 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Athanasios N. Nikolakopoulos, John D. Garofalakis. 2016-04-19. Random Surfing Without Teleportation. https://doi.org/10.1007/978-3-319-24024-4_19
Cite the original work for its findings. Save a collection to share your selection of sources.