Deeper Inside PageRank

This paper serves as a companion or extension to the "Inside PageRank" paper by Bianchini et al. [Bianchini et al. 03]. It is a comprehensive survey of all issues associated with PageRank, covering the basic PageRank model, available and recommended solution methods, storage issues, existence, uniqueness, and convergence properties, possible alterations to the basic model, suggested alternatives to the traditional solution methods, sensitivity and conditioning, and finally the updating problem. We introduce a few new results, provide an extensive reference list, and speculate about exciting areas of future research.

[1]  Matthew Richardson,et al.  The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank , 2001, NIPS.

[2]  Sebastiano Vigna,et al.  The Webgraph framework II: codes for the World-Wide Web , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[3]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[4]  Kristen Thorson April.  Modeling the Web and the Computation of PageRank , 2004 .

[5]  Michael I. Jordan,et al.  Link Analysis, Eigenvectors and Stability , 2001, IJCAI.

[6]  Dell Zhang,et al.  An efficient algorithm to rank Web resources , 2000, Comput. Networks.

[7]  Ronald Fagin,et al.  Comparing top k lists , 2003, SODA '03.

[8]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[9]  Micah Adler,et al.  Towards compressing Web graphs , 2001, Proceedings DCC 2001. Data Compression Conference.

[10]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[11]  Taher H. Haveliwala,et al.  The Condition Number of the PageRank Problem , 2003 .

[12]  R. Plemmons,et al.  Updating LU factorizations for computing stationary distributions , 1986 .

[13]  Frédéric Amblard.  Linked: The New Science of Networks by Albert-László Barabási , 2003, J. Artif. Soc. Soc. Simul..

[14]  Gene H. Golub,et al.  Extrapolation methods for accelerating PageRank computations , 2003, WWW '03.

[15]  Luca Pretto,et al.  A Theoretical Analysis of Google's PageRank , 2002, SPIRE.

[16]  Sriram Raghavan,et al.  Searching the Web , 2001, ACM Trans. Internet Techn..

[17]  Krishna Bharat,et al.  When experts agree: using non-affiliated experts to rank popular topics , 2002, ACM Trans. Inf. Syst..

[18]  Marc Najork,et al.  A large‐scale study of the evolution of Web pages , 2003, WWW '03.

[19]  C. D. Meyer,et al.  Derivatives and perturbations of eigenvectors , 1988 .

[20]  Shlomo Moran,et al.  The stochastic approach for link-structure analysis (SALSA) and the TKC effect , 2000, Comput. Networks.

[21]  Ricardo A. Baeza-Yates,et al.  Web page ranking using link attributes , 2004, WWW Alt. '04.

[22]  Anna R. Karlin,et al.  Random walks with `back buttons' , 2001, STOC 2000.

[23]  Wei-Ying Ma,et al.  A unified framework for Web link analysis , 2002, Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002..

[24]  Marcin Sydow,et al.  Random surfer with back step , 2004, WWW Alt. '04.

[25]  Fabien Mathieu,et al.  The effect of the back button in a random walk: application for pagerank , 2004, WWW Alt. '04.

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

[27]  Konstantin Avrachenkov,et al.  Decomposition of the Google Pagerank and Optimal Linking Strategy Decomposition of the Google Pagerank and Optimal Linking Strategy , 2004 .

[28]  Franco Scarselli,et al.  Inside PageRank , 2005, TOIT.

[29]  Gesine Reinert,et al.  Small worlds , 2001, Random Struct. Algorithms.

[30]  Taher H. Haveliwala,et al.  Adaptive methods for the computation of PageRank , 2004 .

[31]  Alberto O. Mendelzon,et al.  What do the Neighbours Think? Computing Web Page Reputations , 2000, IEEE Data Eng. Bull..

[32]  Jasmine Novak,et al.  PageRank Computation and the Structure of the Web: Experiments and Algorithms , 2002 .

[33]  Shlomo Moran,et al.  Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs , 2005, Information Retrieval.

[34]  Michael I. Jordan,et al.  Stable algorithms for link analysis , 2001, SIGIR '01.

[35]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[36]  Ravi Kumar,et al.  Topic Distillation and Spectral Filtering , 1999, Artificial Intelligence Review.

[37]  Allan Borodin,et al.  Finding authorities and hubs from link structures on the World Wide Web , 2001, WWW '01.

[38]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[39]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[40]  C. D. Meyer,et al.  Updating finite markov chains by using techniques of group matrix inversion , 1980 .

[41]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[42]  Monika Henzinger,et al.  Query-free news search , 2003, WWW.

[43]  Taher H. Haveliwala,et al.  The Second Eigenvalue of the Google Matrix , 2003 .

[44]  Amos Fiat,et al.  Web search via hub synthesis , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[45]  A. Barabasi,et al.  Spectra of "real-world" graphs: beyond the semicircle law. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[46]  Carl D. Meyer,et al.  Updating pagerank using the group inverse and stochastic complementation , 2002 .

[47]  Fritz Schneider,et al.  How to Do Everything with Google , 2003 .

[48]  B. Nordstrom.  FINITE MARKOV CHAINS , 2005 .

[49]  GhemawatSanjay,et al.  The Google file system , 2003 .

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

[51]  C. D. Meyer,et al.  Using the QR factorization and group inversion to compute, differentiate ,and estimate the sensitivity of stationary probabilities for markov chains , 1986 .

[52]  A. Tomkins,et al.  Spectral filtering for resource discovery , 1998 .

[53]  Franco Scarselli,et al.  PageRank: A Circuital Analysis , 2002 .

[54]  Ming-Syan Chen,et al.  Entropy-based link analysis for mining web informative structures , 2002, CIKM '02.

[55]  Chris H. Q. Ding,et al.  PageRank, HITS and a unified framework for link analysis , 2002, SIGIR '02.

[56]  John A. Tomlin,et al.  A new paradigm for ranking pages on the world wide web , 2003, WWW '03.

[57]  Rajeev Motwani,et al.  What can you do with a Web in your Pocket? , 1998, IEEE Data Eng. Bull..

[58]  Gene H. Golub,et al.  Exploiting the Block Structure of the Web for Computing , 2003 .

[59]  David Cohn,et al.  Learning to Probabilistically Identify Authoritative Documents , 2000, ICML.

[60]  Maximino Aldana-Gonzalez,et al.  Linked: The New Science of Networks , 2003 .

[61]  Chris H. Q. Ding,et al.  Link Analysis: Hubs and Authorities on the World Wide Web , 2004, SIAM Rev..

[62]  Alberto O. Mendelzon,et al.  What is this page known for? Computing Web page reputations , 2000, Comput. Networks.

[63]  Sriram Raghavan,et al.  Representing Web graphs , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[64]  Sepandar D. Kamvar,et al.  An Analytical Comparison of Approaches to Personalizing PageRank , 2003 .

[65]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[66]  Yi Liu,et al.  The powerrank web link analysis algorithm , 2004, WWW Alt. '04.

[67]  Carson C. Chow,et al.  Small Worlds , 2000 .

[68]  Torsten Suel,et al.  I/O-efficient techniques for computing pagerank , 2002, CIKM '02.

[69]  C. D. Meyer,et al.  Comparison of perturbation bounds for the stationary distribution of a Markov chain , 2001 .

[70]  Taher H. Haveliwala.  Efficient Encodings for Document Ranking Vectors (Extended Abstract) , 2003, International Conference on Internet Computing.

[71]  Joel C. Miller,et al.  Modifications of Kleinberg's HITS algorithm using matrix exponentiation and web log records , 2001, SIGIR '01.

[72]  Hector Garcia-Molina,et al.  The Evolution of the Web and Implications for an Incremental Crawler , 2000, VLDB.

[73]  C. D. Meyer.  Sensitivity of the Stationary Distribution of a Markov Chain , 1994, SIAM J. Matrix Anal. Appl..

[74]  C. D. Meyer,et al.  Markov chain sensitivity measured by mean first passage times , 2000 .

[75]  Torsten Suel,et al.  Compressing the graph structure of the Web , 2001, Proceedings DCC 2001. Data Compression Conference.

[76]  Eli Upfal,et al.  Using PageRank to Characterize Web Structure , 2002, COCOON.

[77]  Jennifer Widom,et al.  Scaling personalized web search , 2003, WWW '03.

[78]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[79]  C. D. Meyer,et al.  Updating the stationary vector of an irreducible Markov chain , 2002 .

[80]  Cleve B. Moler,et al.  Numerical computing with MATLAB , 2004 .

[81]  Ronald Fagin,et al.  Searching the workplace web , 2003, WWW '03.

[82]  Ah Chung Tsoi,et al.  Adaptive ranking of web pages , 2003, WWW '03.

[83]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[84]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[85]  David A. Cohn,et al.  The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity , 2000, NIPS.

[86]  C. D. Meyer,et al.  Sensitivity of the stationary distribution vector for an ergodic Markov chain , 1986 .

[87]  Taher H. Haveliwala.  Efficient Computation of PageRank , 1999 .

[88]  Luiz André Barroso,et al.  Web Search for a Planet: The Google Cluster Architecture , 2003, IEEE Micro.

[89]  Brian D. Davison,et al.  DiscoWeb: Applying Link Analysis to Web Search , 2001 .

[90]  Alberto O. Mendelzon,et al.  An Autonomous Page Ranking Method for Metasearch Engines , 2002, WWW 2002.

[91]  Andrei Z. Broder,et al.  The Connectivity Server: Fast Access to Linkage Information on the Web , 1998, Comput. Networks.

[92]  Ilse C. F. Ipsen,et al.  Uniform Stability of Markov Chains , 1994, SIAM J. Matrix Anal. Appl..

[93]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[94]  Marco Gori,et al.  Web page scoring systems for horizontal and vertical search , 2002, WWW.

[95]  Serge Abiteboul,et al.  Adaptive on-line page importance computation , 2003, WWW '03.

[96]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[97]  Krishna Bharat,et al.  Improved algorithms for topic distillation in a hyperlinked environment , 1998, SIGIR '98.

[98]  Robert J. Plemmons,et al.  Linear algebra, Markov chains, and queueing models , 1993 .

[99]  Monika Henzinger,et al.  Algorithmic Challenges in Web Search Engines , 2004, Internet Math..

[100]  Amy Nicole Langville,et al.  A Survey of Eigenvector Methods for Web Information Retrieval , 2005, SIAM Rev..

[101]  Rajeev Motwani,et al.  Stratified Planning , 2009, IJCAI.