Random surfing without teleportation
From MaRDI portal
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.
Recommendations
Cites work
- Adaptive methods for the computation of PageRank
- Aggregation of Variables in Dynamic Systems
- Distribution of PageRank Mass Among Principle Components of the Web
- Generic Damping Functions for Propagating Importance in Link-Based Ranking
- scientific article; zbMATH DE number 6013704 (Why is no real title available?)
- Non-negative matrices and Markov chains.
- Random alpha PageRank
Cited in
(5)- Random alpha PageRank
- The T-PageRank: a model of self-validating effects of web surfing
- Potential induced random teleportation on finite graphs
- Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model
- scientific article; zbMATH DE number 5033859 (Why is no real title available?)
This page was built for publication: Random surfing without teleportation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464479)