Google's PageRank and beyond: The science of search engine rankings

Google's PageRank and Beyond: The Science of Search Engine Rankings

Volumn , Issue , 2009, Pages

  Langville, Amy N ^a   Meyer, Carl D ^b  

^a School of Business   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84883905026     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (165)

1. Caslon Analytics net metrics and statistics guide. http://www.caslon.com.au/metricsguide.htm.
2. Clever-IBM Corporation Almaden Research Center. http://www.almaden.ibm.com/cs/k53/clever.html.
3. Text REtrieval Conference. http://trec.nist.gov/.
4. World Wide Web Conference. http://www2004.org.
5. How much information, 2003. http://www.sims.berkeley.edu/howmuch-info-2003.
6. Medlars test collection, December 2003. Available at http://www.cs.utk.edu/ ̃lsi/.
7. Why does my page's rank keep changing? Google PageRank information. http://www.google.com/webmasters/4.html, 2003.
8. Eytan Adar, Li Zhang, Lada A. Adamic, and Rajan M. Lukose. Implicit structure and the dynamics of blogspace. In The Thirteenth International World Wide Web Conference, New York, 2004. ACM Press.
9. Arvind Arasu, Junghoo Cho, Hector Garcia-Molina, Andreas Paepcke, and Sriram Raghavan. Searching the Web. ACM Transactions on Internet Technology, 2001.
10. Arvind Arasu, Jasmine Novak, Andrew Tomkins, and John Tomlin. PageRank computation and the structure of theWeb: Experiments and algorithms. In The Eleventh International WWW Conference, New York, May 2002. ACM Press.
11. Konstantin Avrachenkov and Nelly Litvak. Decomposition of the Google PageRank and optimal linking strategy. Technical report, INRIA, January 2004.
12. Konstantin Avrachenkov and Nelly Litvak. The effect of new links on Google PageRank. Technical report, INRIA, July 2004.
13. Ricardo Baeza-Yates and Emilio Davis. Web page ranking using link attributes. In The Thirteenth International World Wide Web Conference, pages 328-29, New York, 2004. ACM Press. Poster.
14. Ricardo Baeza-Yates and Berthier Ribeiro-Neto. Modern Information Retrieval. ACM Press, New York, 1999.
15. Ziv Bar-Yossef, Andrei Z. Broder, Ravi Kumar, and Andrew Tomkins. Sic transit gloria telae: Towards an understanding of the Web's decay. In The Thirteenth International World Wide Web Conference, New York, 2004. ACM Press.
16. Albert-Laszlo Barabasi. Linked: The New Science of Networks. Plume, 2003.
17. Albert-Laszlo Barabasi, Reka Albert, and Hawoong Jeong. Scale-free characteristics of random networks: The topology of theWorld-WideWeb. Physica A, 281:69-77, 2000.
18. R. Barrett, M. Berry, T. F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. Van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, 2nd edition, 1994.
19. Luiz Andre Barroso, Jeffrey Dean, and Urs Holzle. Web search for a planet: The Google cluster architecture. IEEE Micro, pages 22-28, 2003.
20. Gely P. Basharin, Amy N. Langville, and Valeriy A. Naumov. The life and work of A. A. Markov. Linear Algebra and Its Applications, (386):3-26, 2004.
21. Abraham Berman and Robert J. Plemmons. Nonnegative Matrices in the Mathematical Sciences. Academic Press, 1979.
22. Michael W. Berry, editor. Computational Information Retrieval. SIAM, Philadelphia, 2001.
23. Michael W. Berry and Murray Browne. Understanding Search Engines: Mathematical Modeling and Text Retrieval. SIAM, Philadelphia, 2nd edition, 2005.
24. Michael W. Berry, Zlatko Drmac, and Elizabeth R. Jessup. Matrices, vector spaces and information retrieval. SIAM Review, 41:335-62, 1999.
25. Krishna Bharat, Andrei Broder, Monika Henzinger, Puneet Kumar, and Suresh Venkatasubramanian. The connectivity server: Fast access to linkage information on the Web. In The Seventh World Wide Web Conference, pages 469-77, Brisbane, Australia, 1998.
26. Krishna Bharat and Monika R. Henzinger. Improved algorithms for topic distillation in hyperlinked environments. In 21st International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), pages 104-11, 1998.
27. Krishna Bharat, Farzin Maghoul, and Raymie Stata. The term vector database: Fast access to indexing terms for webpages. Computer Networks, 33:247-255, 2000.
28. Monica Bianchini, Marco Gori, and Franco Scarselli. PageRank: A circuital analysis. In The Eleventh International WWW Conference, May 2002.
29. Monica Bianchini, Marco Gori, and Franco Scarselli. Inside PageRank. ACM Transactions on Internet Technology, 5(1), 2005. To appear.
30. Nancy Blachman, Eric Fredricksen, and Fritz Schneider. How to Do Everything with Google. McGraw-Hill, 2003.
31. Paolo Boldi, Massimo Santini, and Sebastiano Vigna. Do your worst to make the best: Paradoxical effects in PageRank incremental computations. In Proceedings of WAW 2004, Lecture Notes in Computer Science, number 3248, pages 168-80. Springer-Verlag, 2004.
32. Paolo Boldi, Massimo Santini, and Sebastiano Vigna. PageRank as a function of the damping factor. In The Fourteenth International World Wide Web Conference, New York, 2005. ACM Press.
33. Paolo Boldi and Sebastiano Vigna. The WebGraph framework II: Codes for the World Wide Web. Technical Report 294-03, Universita di Milano, Dipartimento di Scienze dell' Informazione Engineering, 2003.
34. Paolo Boldi and Sebastiano Vigna. The Web Graph framework I: Compression techniques. In The Thirteenth International World Wide Web Conference, pages 595-602, New York, 2004. ACM Press.
35. Jorge Luis Borges. The Library of Babel. David R. Godine, 2000. Translated by Andrew Hurley.
36. Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, and Panayiotis Tsaparas. Finding authorities and hubs from link structures on the World Wide Web. The Eleventh International World Wide Web Conference, pages 415-29, 2001.
37. P. Bradley. Multi-search engines-a comparison. webpage, January 2002. http://www.philb.com/msengine.htm.
38. Sergey Brin, Rajeev Motwani, Lawrence Page, and Terry Winograd. What can you do with a Web in your pocket? Data Engineering Bulletin, 21:37-47, 1998.
39. Sergey Brin and Lawrence Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 33:107-17, 1998.
40. Sergey Brin, Lawrence Page, R. Motwami, and Terry Winograd. The PageRank citation ranking: Bringing order to the Web. Technical Report 1999-0120, Computer Science Department, Stanford University, 1999.
41. Andrei Broder, Ravi Kumar, and Marzin Maghoul. Graph structure in the Web. In The Ninth International World Wide Web Conference, pages 309-320, New York, May 2000. ACM Press.
42. Andrei Broder, Ronny Lempel, Farzin Maghoul, and Jan Pedersen. Efficient PageRank approximation via graph aggregation. In The Thirteenth International World Wide Web Conference, pages 484-85, New York, 2004. ACM Press. Poster.
43. Vannevar Bush. As we may think. Atlantic Monthly, 176(1):101-8, 1945.
44. Tara Calishain and Rael Dornfest. Google Hacks: 100 Industrial-Strength Tips and Tricks. O'Reilly, 2003.
45. Lord John Campbell. The Lives Of the Chief Justices of England, volume 3. John Murray, Albemarle Street, London, 1868.
46. Steven Campbell and Carl D. Meyer. Generalized Inverses of Linear Transformations. Pitman, San Francisco, 1979.
47. Yen-Yu Chen, Qingqing Gan, and Torsten Suel. I/O-efficient techniques for computing PageRank. In Proceedings of the Eleventh International Conference on Information and Knowledge Management (CIKM'02), pages 549-557, Virginia, 2002.
48. Steve Chien, Cynthia Dwork, Ravi Kumar, and D. Sivakumar. Towards exploiting link evolution. In Workshop on Algorithms and Models for the Web Graph, 2001.
49. Grace E. Cho and Carl D. Meyer. Markov chain sensitivity measured by mean first passage times. Linear Algebra and Its Applications, 313:21-28, 2000.
50. Grace E. Cho and Carl D. Meyer. Comparison of perturbation bounds for the stationary distribution of a Markov chain. Linear Algebra and Its Applications, 335(1-3):137-150, 2001.
51. Grace E. Cho and Carl D. Meyer. Aggregation/disaggregation errors for nearly uncoupled Markov chains. Technical report, NCSU Tech. Report #102301, 2003.
52. Junghoo Cho and Hector Garcia-Molina. The evolution of the Web and implications for an incremental crawler. In Proceedings of the Twenty-sixth International Conference on Very Large Databases, pages 200-209, New York, 2000. ACM Press.
53. David Cohn and Huan Chang. Learning to probabilistically identify authoritative documents. In Proceedings of the 17th International Conference on Machine Learning, pages 167-174, Stanford, CA, 2000.
54. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. MIT Press, 2001.
55. G. M. Del Corso, A. Gulli, and F. Romani. Exploiting Web matrix permutations to speedup PageRank computation. Technical Report IIT TR-04/2004, Istituto di Informatica e Telematica, May 2004.
56. P. J. Courtois. Decomposability. Academic Press, New York, 1977.
57. James W. Demmel. Applied Numerical Linear Algebra. SIAM, 1997.
58. Michelangelo Diligenti, Marco Gori, and Marco Maggini. Web page scoring systems for horizontal and vertical search. In The Eleventh International World Wide Web Conference, pages 508-516, Honolulu, HI, 2002. ACM Press.
59. Chris Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, and Horst Simon. Link analysis: Hubs and authorities on the World Wide Web. Technical Report 47847, Lawrence Berkeley National Laboratory, May 2001.
60. Chris Ding, Xiaofeng He, Hongyuan Zha, and Horst Simon. PageRank, HITS and a unified framework for link analysis. In Proceedings of the 25th ACM SIGIR Conference, pages 353-354, Tampere, Finland, August 2002.
61. Chris H. Q. Ding, Hongyuan Zha, Xiaofeng He, Parry Husbands, and Horst D. Simon. Link analysis: Hubs and authorities on theWorldWideWeb. SIAM Review, 46(2):256-68, 2004.
62. Martin Dodge and Rob Kitchins. Atlas of Cyberspace. Addison-Wesley, 2001.
63. Debora Donato, Luigi Laura, Stefano Leonardi, and Stefano Millozzi. Large scale properties of the webgraph. The European Physical Journal B, 38:239-43, 2004.
64. Susan T. Dumais. Improving the retrieval of information from external sources. Behavior Research Methods, Instruments and Computers, 23:229-236, 1991.
65. Cynthia Dwork, Ravi Kumar, and Moni Naor and D. Sivakumar. Rank aggregation methods for the Web. In The Tenth International World Wide Web Conference, New York, 2001. ACM Press.
66. Nadav Eiron, Kevin S. McCurley, and John A. Tomlin. Ranking theWeb frontier. In The Thirteenth International World Wide Web Conference, New York, 2004. ACM Press.
67. Ronald Fagin, Anna R. Karlin, Jon Kleinberg, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Madhu Sudan, and Andrew Tomkins. Random walks with "back buttons". In 32nd ACM Symposium on Theory of Computing, 2000.
68. Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, and David P. Williamson. Searching the workplace web. In The Twelfth International World Wide Web Conference, pages 366-75, New York, 2003. ACM Press.
69. Ronald Fagin, Ravi Kumar, and D. Sivakumar. Comparing top k lists. In ACMSIAM Symposium on Discrete Algorithms, pages 28-36, 2003.
70. Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251-62, 1999.
71. Ayman Farahat, Thomas Lofaro, Joel C. Miller, Gregory Rae, F. Schaefer, and Lesley A. Ward. Modifications of Kleinberg's HITS algorithm using matrix exponentiation and web log records. In ACM SIGIR Conference, pages 444-45, September 2001.
72. Ayman Farahat, Thomas Lofaro, Joel C. Miller, Gregory Rae, and Lesley A. Ward. Authority rankings from HITS, PageRank, and SALSA: Existence, uniqueness, and effect of initialization. SIAM Journal on Scientific Computing, 27(4):1181-201, 2006.
73. Graham Farmelo. It Must Be Beautiful: Great Equations of Modern Science. Granta Books, 2002.
74. Dennis Fetterly, Mark Manasse, Marc Najork, and Janet L. Wiener. A large-scale study of the evolution of web pages. In The Twelfth International World Wide Web Conference, 2003.
75. William B. Frakes and Ricardo Baeza-Yates. Information Retrieval: Data Structures and Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1992.
76. Robert E. Funderlic and Carl D. Meyer. Sensitivity of the stationary distribution vector for an ergodic Markov chain. Linear Algebra and Its Applications, 76:1-17, 1986.
77. Robert E. Funderlic and Robert J. Plemmons. Updating LU factorizations for computing stationary distributions. SIAM Journal on Algebraic and Discrete Methods, 7(1):30-42, 1986.
78. Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung. The Google file system. In Proceedings of the Nineteenth ACMsymposium on Operating Systems Principles, pages 29-43, New York, 2003.
79. James Gillies and Robert Cailliau. How the Web Was Born: The Story of the World Wide Web. Oxford University Press, 2000.
80. David Gleich, Leonid Zhukov, and Pavel Berkhin. Fast parallel PageRank: A linear system approach. In The Fourteenth International World Wide Web Conference, New York, 2005. ACM Press.
81. Gene H. Golub and Chen Greif. Arnoldi-type algorithms for computing stationary distribution vectors, with application to PageRank. Technical Report SCCM-2004-15, Scientific Computation and Computational Mathematics, Stanford University, 2004.
82. Gene H. Golub and Charles F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, 1996.
83. Gene H. Golub and Carl D. Meyer. Using the QR factorization and group inverse to compute, differentiate and estimate the sensitivity of stationary probabilities for Markov chains. SIAM Journal on Algebraic and Discrete Methods, 17:273-81, 1986.
84. Zoltan Gyongyi and Hector Garcia-Molina. Web spam taxonomy. Technical report, Stanford University, 2004.
85. D. J. Hartfiel and Carl D. Meyer. On the structure of stochastic matrices with a subdominant eigenvalue near 1. Linear Algebra and Its Applications, 272:193-203, 1998.
86. Taher H. Haveliwala. Efficient computation of PageRank. Technical Report 1999-31, Computer Science Department, Stanford University, 1999.
87. Taher H. Haveliwala. Efficient encodings for document ranking vectors. Technical report, Computer Science Department, Stanford University, November 2002.
88. Taher H. Haveliwala. Topic-sensitive PageRank. In The Eleventh International WWW Conference, New York, May 2002. ACM Press.
89. Taher H. Haveliwala. Topic-sensitive PageRank: A context-sensitive ranking algorithm for web search. IEEE Transactions on Knowledge and Data Engineering, 15(4):784-96, July/August 2003.
90. Taher H. Haveliwala and Sepandar D. Kamvar. The second eigenvalue of the Google matrix. Technical Report 2003-20, Stanford University, 2003.
91. Taher H. Haveliwala, Sepandar D. Kamvar, and Glen Jeh. An analytical comparison of approaches to personalizing PageRank. Technical report, Stanford University, 2003.
92. Moshe Haviv. Aggregation/disaggregation methods for computing the stationary distribution of a Markov chain. SIAM Journal on Numerical Analysis, 22:952-66, 1987.
93. Kevin Hemenway and Tara Calishain. Spidering Hacks: 100 Industrial-Strength Tips and Tricks. O'Reilly, 2003.
94. Monika R. Henzinger, Hannes Marais, Michael Moricz, and Craig Silverstein. Analysis of a very large Alta Vista query log. Technical Report 1998-014, Digital SRC, October 1998.
95. Hermann Hesse. Siddhartha. New Directions Publishing Co., New York, 1951. Translated by Hilda Rosner.
96. Jeffrey J. Hunter. Stationary distributions of perturbed Markov chains. Linear Algebra and Its Applications, 82:201-214, 1986.
97. Ilse C. F. Ipsen and Steve Kirkland. Convergence analysis of a PageRank updating algorithm by Langville and Meyer. SIAM Journal on Matrix Analysis and Applications, 2005. To appear.
98. Ilse C. F. Ipsen and Carl D. Meyer. Uniform stability of Markov chains. SIAM Journal on Matrix Analysis and Applications, 15(4):1061-74, 1994.
99. Glen Jeh and Jennifer Widom. Scaling personalized web search. Technical report, Stanford University, 2002.
100. Sepandar D. Kamvar and Taher H. Haveliwala. The condition number of the PageRank problem. Technical report, Stanford University, 2003.
101. Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. Exploiting the block structure of the Web for computing PageRank. Technical Report 2003-17, Stanford University, 2003.
102. Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. Extrapolation methods for accelerating PageRank computations. In Twelfth International World Wide Web Conference, New York, 2003. ACM Press.
103. James P. Keener. The Perron-Frobenius theorem and the ranking of football teams. SIAM Review, 35(1):80-93, 1993.
104. John G. Kemeny and Laurie J. Snell. Finite Markov Chains. D. Van Nostrand, New York, 1960.
105. Maurice G. Kendall and B. Babington Smith. On the method of paired comparisons. Biometrica, 31, 1939.
106. Jon Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46, 1999.
107. Robert R. Korfhage. Information Storage and Retrieval. Wiley, New York, 1997.
108. Amy N. Langville and Carl D. Meyer. Deeper inside PageRank. Internet Mathematics Journal, 1(3):335-80, 2005.
109. Amy N. Langville and Carl D. Meyer. A reordering for the PageRank problem. SIAM Journal on Scientific Computing, 2005. To appear.
110. Amy N. Langville and Carl D. Meyer. A survey of eigenvector methods of web information retrieval. The SIAM Review, 47(1):135-61, 2005.
111. Amy N. Langville and Carl D. Meyer. Updating the stationary vector of an irreducible Markov chain with an eye on Google's PageRank. SIAM Journal on Matrix Analysis and Applications, 27:968-987, 2006.
112. Chris Pan-Chi Lee, Gene H. Golub, and Stefanos A. Zenios. A fast two-stage algorithm for computing PageRank and its extensions. Technical Report SCCM-2003-15, Scientific Computation and Computational Mathematics, Stanford University, 2003.
113. Hyun Chul Lee and Allan Borodin. Perturbation of the hyperlinked environment. In Lecture Notes in Computer Science: Proceedings of the Ninth International Computing and Combinatorics Conference, volume 2697, Heidelberg, 2003. Springer-Verlag.
114. Ronny Lempel and Shlomo Moran. The stochastic approach for link-structure analysis (SALSA) and the TKC effect. In The Ninth International World Wide Web Conference, New York, 2000. ACM Press.
115. Ronny Lempel and Shlomo Moran. Rank-stability and rank-similarity of link-based web ranking algorithms in authority-connected graphs. In Second Workshop on Algorithms and Models for the Web-Graph (WAW 2003), Budapest, Hungary, May 2003.
116. Yizhou Lu, Benyu Zhang, Wensi Xi, Zheng Chen, Yi Liu, Michael R. Lyu, and Wei-Ying Ma. The PowerRank Web link analysis algorithm. In The Thirteenth International World Wide Web Conference, pages 254-55, New York, 2004. ACM Press. Poster.
117. Michael S. Malone. The complete guide to Googlemania. Wired, 12.03, 2004.
118. Bundit Manaskasemsak and Arnon Rungsawang. Parallel PageRank computation on a gigabit pc cluster. In 18th International Conference on Advanced Information Networking and Applications, pages 273-277. IEEE, 2004.
119. Fabien Mathieu and Mohamed Bouklit. The effect of the back button in a random walk: Application for PageRank. In The Thirteenth International World Wide Web Conference, pages 370-71, New York, 2004. Poster.
120. Alberto O. Mendelzon and Davood Rafiei. An autonomous page ranking method for metasearch engines. In The Eleventh International WWW Conference, May 2002.
121. Carl D. Meyer. The character of a finite Markov chain. Linear Algebra, Markov Chains, and Queueing Models, IMA Volumes in Mathematics and Its Applications.
122. Carl D. Meyer. The role of the group generalized inverse in the theory of finite Markov chains. SIAM Review, 17:443-64, 1975.
123. Carl D. Meyer. The condition of a finite Markov chain and perturbation bounds for the limiting probabilities. SIAM Journal on Algebraic and Discrete Methods, 1:273-83, 1980.
124. Carl D. Meyer. Analysis of finite Markov chains by group inversion techniques. Recent Applications of Generalized Inverses, Research Notes in Mathematics, 66:50-81, 1982.
125. Carl D. Meyer. Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems. SIAM Review, 31(2):240-72, 1989.
126. Carl D. Meyer. Sensitivity of the stationary distribution of a Markov chain. SIAM Journal on Matrix Analysis and Applications, 15(3):715-28, 1994.
127. Carl D. Meyer. Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia, 2000.
128. Carl D. Meyer and Robert J. Plemmons. Linear Algebra, Markov Chains, and Queueing Models. Springer-Verlag, New York, 1993.
129. Carl D. Meyer and James M. Shoaf. Updating finite Markov chains by using techniques of group matrix inversion. Journal of Statistical Computation and Simulation, 11:163-81, 1980.
130. Carl D. Meyer and G. W. Stewart. Derivatives and perturbations of eigenvectors. SIAM Journal on Numerical Analysis, 25:679-691, 1988.
131. Cleve Moler. The world's largest matrix computation. Matlab News and Notes, pages 12-13, October 2002.
132. Cleve B. Moler. Numerical Computing with MATLAB. SIAM, 2004.
133. Andrew Y. Ng, Alice X. Zheng, and Michael I. Jordan. Link analysis, eigenvectors and stability. In The Seventh International Joint Conference on Artificial Intelligence, 2001.
134. Andrew Y. Ng, Alice X. Zheng, and Michael I. Jordan. Stable algorithms for link analysis. In Proceedings of the 24th Annual International ACM SIGIR Conference. ACM, 2001.
135. Andrew Orlowski. Google founder dreams of Google implant in your brain. The Register, March 3, 2004.
136. Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal. Using PageRank to characterize Web structure. In The Eighth Annual International Computing and Combinatorics Conference (COCOON), 2002.
137. Beresford N. Parlett. The Symmetric Eigenvalue Problem. SIAM, 1998.
138. Luca Pretto. A theoretical analysis of google's PageRank. In Proceedings of the Ninth International Symposium on String Processing and Information Retrieval, pages 131-144, Lisbon, Portugal, September 2002.
139. Sriram Raghavan and Hector Garcia-Molina. Compressing the graph structure of the Web. In Proceedings of the IEEE Conference on Data Compression, pages 213-22, March 2001.
140. Sriram Raghavan and Hector Garcia-Molina. Towards compressing web graphs. In Proceedings of the IEEE Conference on Data Compression, pages 203-212, March 2001.
141. Sriram Raghavan and Hector Garcia-Molina. Representing web graphs. In Proceedings of the 19th IEEE Conference on Data Engineering, Bangalore, India, March 2003.
142. Matthew Richardson and Petro Domingos. The intelligent surfer: Probabilistic combination of link and content information in PageRank. Advances in Neural Information Processing Systems, 14:1441-8, 2002.
143. Chris Ridings. PageRank explained: Everything you've always wanted to know about PageRank. http://www.rankwrite.com/. Accessed on May 22, 2002.
144. Chris Ridings and Mike Shishigin. PageRank uncovered. www.voelspriet2.nl/PageRank.pdf. Accessed on September 19, 2002.
145. Yousef Saad. Iterative Methods for Sparse Linear Systems. SIAM, 2003.
146. Gerard Salton, editor. The SMART Retrieval System: Experiments in Automatic Document Processing. Prentice Hall, Englewood Cliffs, NJ, 1971.
147. Gerard Salton and Chris Buckley. Introduction to Modern Information Retrieval. McGraw-Hill, New York, 1983.
148. Eugene Seneta. Sensivity analysis, ergodicity coefficients, and rank-one updates for finite Markov chains. In William J. Stewart, editor, Numerical Solution of Markov Chains, pages 121-129. Marcel Dekker, 1991.
149. Claude E. Shannon. A mathematical theory of communication. The Bell System Technical Journal, 27:379-423, 1948.
150. Chris Sherman. Teoma vs. Google, round 2. Silicon Valley Internet, 2002. http://dc.internet.com/news/print.php/1002061.
151. Herbert A. Simon and Albert Ando. Aggregation of variables in dynamic systems. Econometrica, 29:111-38, 1961.
152. G. W. Stewart. Matrix Algorithms, volume 2. SIAM, 2001.
153. G. W. Stewart and Ji-guang Sun. Matrix Perturbation Theory. Academic Press, 1990.
154. William J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
155. William J. Stewart and Wei Wu. Numerical experiments with iteration and aggregation for Markov chains. ORSA Journal on Computing, 4(3):336-50, 1992.
156. Danny Sullivan. Searches per day. Search Engine Watch, 2003. http://searchenginewatch.com/reports/article.php/2156461.
157. Marcin Sydow. Random surfer with back step. In The Thirteenth International World Wide Web Conference, pages 352-53, New York, 2004. Poster.
158. Kristen Thorson. Modeling theWeb and the computation of PageRank. Undergraduate thesis, Hollins University, 2004.
159. John A. Tomlin. A new paradigm for ranking pages on the World Wide Web. In The Twelfth International World Wide Web Conference, New York, 2003. ACM Press.
160. Michael Totty and Mylene Mangalindan. As Google becomes web's gatekeeper, sites fight to get in. Wall Street Journal, CCXLI(39), 2003. February 26.
161. T. H. Wei. The algebraic foundations of ranking theory. PhD thesis, Cambridge University, 1952.
162. James H. Wilkinson. The Algebraic Eigenvalue Problem. Clarendon Press, 1965.
163. Ian H. Witten, Alistair Moffat, and Timothy C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, 1999.
164. Hui Zhang, Ashish Goel, Ramesh Govindan, Kahn Mason, and Benjamin Van Roy. Making eigenvector-based reputation systems robust to collusion. In Proceedings of WAW 2004, Lecture Notes in Computer Science, number 3243, pages 92-104. Springer-Verlag, 2004.
165. Xiaoyan Zhang, Michael W. Berry, and Padma Raghavan. Level search schemes for information filtering and retrieval. Information Processing and Management, 37:313-34, 2001.