The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Local methods for estimating pagerank values
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Information revelation and privacy in online social networks
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Local approximation of PageRank and reverse PageRank
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Local computation of PageRank: the ranking side
Proceedings of the 20th ACM international conference on Information and knowledge management
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
A sublinear time algorithm for pagerank computations
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
| Hi-index | 0.00 |
Can one assess, by visiting only a small portion of a graph, if a given node has a significantly higher PageRank score than another? We show that the answer strongly depends on the interplay between the required correctness guarantees (is one willing to accept a small probability of error?) and the graph exploration model (can one only visit parents and children of already visited nodes?).