Local approximation of pagerank and reverse pagerank

@inproceedings{BarYossef2008LocalAO,
  title={Local approximation of pagerank and reverse pagerank},
  author={Ziv Bar-Yossef and Li-Tal Mashiach},
  booktitle={CIKM},
  year={2008}
}
We consider the problem of approximating the PageRank of a target node using only local information provided by a link server. This problem was originally studied by Chen, Gan, and Suel (CIKM 2004), who presented an algorithm for tackling it. We prove that local approximation of PageRank, even to within modest approximation factors, is infeasible in the worst-case, as it requires probing the link server for Ω(n) nodes, where n is the size of the graph. The difficulty emanates from nodes of high… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS