The power of local information in PageRank

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?).

[1]  Hector Garcia-Molina,et al.  Efficient Crawling Through URL Ordering , 1998, Comput. Networks.

[2]  Michael Kearns,et al.  Local Algorithms for Finding Interesting Individuals in Large Networks , 2010, ICS.

[3]  Virgílio A. F. Almeida,et al.  Finding trendsetters in information networks , 2012, KDD.

[4]  Vahab S. Mirrokni,et al.  Local Computation of PageRank Contributions , 2007, Internet Math..

[5]  Alessandro Acquisti,et al.  Information revelation and privacy in online social networks , 2005, WPES '05.

[6]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[7]  Ziv Bar-Yossef,et al.  Local approximation of PageRank and reverse PageRank , 2008, SIGIR '08.

[8]  Philip S. Yu,et al.  Top 10 algorithms in data mining , 2007, Knowledge and Information Systems.

[9]  Konstantin Avrachenkov,et al.  Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient , 2007, SIAM J. Numer. Anal..

[10]  Sebastiano Vigna,et al.  Traps and Pitfalls of Topic-Biased PageRank , 2007, WAW.

[11]  Ashish Goel,et al.  Fast Incremental and Personalized PageRank , 2010, Proc. VLDB Endow..

[12]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[13]  Amy Nicole Langville,et al.  Google's PageRank and beyond - the science of search engine rankings , 2006 .

[14]  Sanjeev Khanna,et al.  The Power of Local Information in Social Networks , 2012, WINE.

[15]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[16]  Ziv Bar-Yossef,et al.  Local approximation of PageRank and reverse PageRank , 2008, SIGIR.

[17]  Marco Bressan,et al.  Local computation of PageRank: the ranking side , 2011, CIKM '11.

[18]  Shang-Hua Teng,et al.  A Sublinear Time Algorithm for PageRank Computations , 2012, WAW.

[19]  Eli Upfal,et al.  PageRank on an evolving graph , 2012, KDD.

[20]  Eli Upfal,et al.  Algorithms on evolving graphs , 2012, ITCS '12.

[21]  Bala Kalyanasundaram,et al.  Constructing Competitive Tours from Local Information , 1993, Theor. Comput. Sci..

[22]  Torsten Suel,et al.  Local methods for estimating pagerank values , 2004, CIKM '04.

[23]  Taher H. Haveliwala.  Topic-sensitive PageRank , 2002, IEEE Trans. Knowl. Data Eng..

[24]  Dongwon Lee,et al.  Toward alternative measures for ranking venues: a case of database research community , 2007, JCDL '07.

[25]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[26]  Hector Garcia-Molina,et al.  Combating Web Spam with TrustRank , 2004, VLDB.

[27]  Carl D. Meyer,et al.  Deeper Inside PageRank , 2004, Internet Math..

[28]  Dániel Fogaras,et al.  Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments , 2005, Internet Math..