Deeper inside Pagerank

Internet Mathematics

Volumn 1, Issue 3, 2004, Pages 335-380

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

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906232105     PISSN: 15427951     EISSN: 19449488     Source Type: Journal    
DOI: 10.1080/15427951.2004.10129091     Document Type: Article

References (116)

1. [Abiteboul et al. 03] Serge Abiteboul, Mihai Preda, and Gregory Cobena. "Adaptive On-Line Page Importance Computation". In Proc. of Twelfth International Conference on World Wide Web (WWW12), pp. 280-290. New York: ACM Press, 2003.
2. [Achlioptas et al. 01] Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, and Frank Mc-Sherry. "Web Search via Hub Synthesis". In IEEE Symposium on Foundations of Computer Science, pp. 500-509. Los Alamitos: IEEE Press, 2001.
3. [Aldous 83] David Aldous. "Random Walks on Finite Groups and Rapidly Mixing Markov Chains". In Seminar on Probability XVII, Lecture Notes in Mathematics 986, pp. 243-297. Berlin: Springer-Verlag, 1983.
4. [Arasu et al. 01] Arvind Arasu, Junghoo Cho, Hector Garcia-Molina, Andreas Paepcke, and Sriram Raghavan. "Searching the Web". ACM Transactions on Internet Technology 1:1 (2001), 2-43.
5. [Arasu et al. 02] Arvind Arasu, Jasmine Novak, Andrew Tomkins, and John Tomlin. "PageRank Computation and the Structure of the Web: Experiments and Algorithms". The Eleventh International World Wide Web Conference, Posters. Available from World Wide Web (http://www2002.org/CDROM/poster/ 173.pdf), 2002.
6. [Avrachenkov and Litvak 04] Konstantin Avrachenkov and Nelly Litvak. "Decomposition of the Google Pagerank and Optimal Linking Strategy". Technical report, INRIA, January 2004.
7. [Baeza-Yates and Davis 04] Ricardo Baeza-Yates and Emilio Davis. "Web Page Ranking Using Link Attributes". In International World Wide Web Conference archive Proceedings of the 13th international World Wide Web conference, Alternate Track Papers & Posters, pp. 328-329. New York: ACM Press, 2004.
8. [Barabasi 03] Albert-Laszlo Barabasi. Linked: The New Science of Networks. New York: Plume Books, 2003.
9. [Barabasi et al 00] Albert-Laszlo Barabasi, Reka Albert, and Hawoong Jeong. "Scale-Free Characteristics of Random Networks: The Topology of the World-Wide Web". Physica A 281 (2000), 69-77.
10. [Barrett et al. 94] 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, 2nd Edition. Philadelphia, PA: SIAM, 1994.
11. [Barroso et al. 03] Luiz Andre Barroso, Jeffrey Dean, and Urs Holzle. "Web Search for a Planet: The Google Cluster Architecture". IEEE Micro 23:2 (2003), 22-28.
12. [Berman and Plemmons 79] Abraham Berman and Robert J. Plemmons. Nonnegative Matrices in the Mathematical Sciences. New York: Academic Press, Inc., 1979.
13. [Bharat et al. 98] Krishna Bharat, Andrei Broder, Monika Henzinger, Puneet Kumar, and Suresh Venkatasubramanian. "The Connectivity Server: Fast Access to Linkage Information on the Web". In Proceedings of the Seventh International Conference on World Wide Web, pp. 469-477. New York: ACM Press, 1998.
14. [Bharat and Henzinger 98] 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), pp. 104-111, New York: ACM Press, 1998.
15. [Bharat and Mihaila 02] Krishna Bharat and George A. Mihaila. "When Experts Agree: Using Non-Affiliated Experts to Rank Popular Topics". ACM Transactions on Information Systems 20:1 (2002), 47-58.
16. [Bianchini et al. 02] Monica Bianchini, Marco Gori, and Franco Scarselli. "PageRank: A Circuital Analysis". The Eleventh International World Wide Web Conference, Posters. Available from World Wide Web (http://www2002.org/CDROM/poster/165.pdf), 2002.
17. [Bianchini et al. 03] Monica Bianchini, Marco Gori, and Franco Scarselli. "Inside PageRank". Preprint 2003; to appear in ACM Transactions on Internet Technology 4:4, February 2005.
18. [Blachman 03] Nancy Blachman, Eric Fredricksen, and Fritz Schneider. How to Do Everything with Google. New York: McGraw-Hill, 2003.
19. [Boldi et al. 02] Paolo Boldi, Bruno Codenotti, Massimo Santini, and Sebastiano Vigna. "Structural Properties of the African Web". The Eleventh International World Wide Web Conference, Posters. Available from World Wide Web (http://www2002.org/CDROM/poster/164/index.html), 2002.
20. [Boldi and Vigna 03] 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.
21. [Boldi and Vigna 04] Paolo Boldi and Sebastiano Vigna. "The WebGraph Framework I: Compression Techniques". In Proc. of the Thirteenth International World Wide Web Conference, pp. 595-601. New York: ACM Press, 2004.
22. [Borodin 01] Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, and Panayiotis Tsaparas. "Finding Authorities and Hubs from Link Structures on the World Wide Web". In Proc. of the Tenth International World Wide Web Conference, pp. 415-429. New York: ACM Press, 2001.
23. [Brin et al. 98a] Sergey Brin, Rajeev Motwani, Lawrence Page, and Terry Winograd. "What Can You Do With a Web in Your Pocket?" Data Engineering Bulletin 21 (1998), 37-47.
24. [Brin and Page 98] Sergey Brin and Lawrence Page. "The Anatomy of a Large-Scale Hypertextual Web Search Engine". Computer Networks and ISDN Systems 33 (1998), 107-117.
25. [Brin et al. 98b] Sergey Brin, Lawrence Page, R. Motwami, and Terry Winograd. "The PageRank Citation Ranking: Bringing Order to the Web". Technical report, Computer Science Department, Stanford University, 1998.
26. [Broder et al. 00] Andrei Broder, Ravi Kumar, and Marzin Maghoul. "Graph Structure in the Web". In Proc. of the Ninth International World Wide Web Conference, pp. 309-320. New York: ACM Press, 2000.
27. [Broder et al. 04] Andrei Broder, Ronny Lempel, Farzin Maghoul, and Jan Pedersen. "Efficient Pagerank Approximation via Graph Aggregation". In Proceedings of the 13th International World Wide Web conference. Alternate Track Papers & Posters. pp. 484-485. New York: ACM Press, 2004.
28. [Chakrabarti et al. 98] Soumen Chakrabarti, Byron Dom, David Gibson, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. "Spectral Filtering for Resource Discovery". Presented at the ACM SIGIR Workshop on Hypertext Information Retrieval on the Web, 1998. Revised version available as "Topic Distillation and Spectral Filtering". Artificial Intelligence Review 13 (1999), 409-435.
29. [Chen et al. 02a] 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), pp. 549-557. New York: ACM Press, 2002.
30. [Chen et al. 02b] Zheng Chen, Jidong Wang, Liu Wenyin, and Wei-Ying Ma. "A Unified Framework for Web Link Analysis". In Proc. of Web Information Systems Engineering 2002, p. 63. New York: ACM Press, 2002.
31. [Chien et al. 01] Steve Chien, Cynthia Dwork, Ravi Kumar, and D. Sivakumar. "Towards Exploiting Link Evolution". Unpublished manuscript, 2001.
32. [Cho and Meyer 00] Grace E. Cho and Carl D. Meyer. "Markov Chain Sensitivity Measured by Mean First Passage Times". Linear Algebra and its Applications 313 (2000), 21-28.
33. [Cho and Meyer 01] 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 (2001), 137-150.
34. [Cho and Garcia-Molina 00] 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, pp. 200-209. New York: ACM Press, 2000.
35. [Cohn and Chang 00] David Cohn and Huan Chang. "Learning to Probabilistically Identify Authoritative Documents". In Proceedings of the 17th International Conference on Machine Learning, pp. 167-174. San Francisco: Morgan Kaufmann, 2000.
36. [Cohn and Hofmann 01] David Cohn and Thomas Hofmann. "The Missing Link: A Probabilistic Model of Document Content and Hyperlink Connectivity". In Advances in Neural Information Processing Systems 13, edited by T. Leen, T. Dietterich and V. Tresp, pp. 430-436. Cambridge, MA: MIT Press, 2001.
37. [Craven 03] Phil Craven. "Google's PageRank Explained". Web Workshop. Available from World Wide Web (http://www.webworkshop.net/), 2003.
38. [Davison et al. 99] Brian D. Davison, Apostolos Gerasoulis, Konstantinos Kleisouris, Yingfang Lu, Hyun ju Seo, Wei Wang, and Baohua Wu. "Discoweb: Applying Link Analysis to Web Search". In Proc. Eighth International World Wide Web Conference, pp. 148-149. New York: ACM Press, 1999.
39. [Diligenti et al. 02] Michelangelo Diligenti, Marco Gori, and Marco Maggini. "Web Page Scoring Systems for Horizontal and Vertical Search". In Proceedings of the Eleventh International Conference on World Wide Web, pp. 508-516. New York: ACM Press, 2002.
40. [Ding et al. 01] 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, 2001.
41. [Ding et al. 02] 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, pp. 353-354. New York: ACM Press, 2002. [Dwork et al. 01] Cynthia Dwork, Ravi Kumar, and Moni Naor and D. Sivakumar. "Rank Aggregation Methods for the Web". In Proceedings of the Tenth International Conference on World Wide Web (WWW10), pp. 613-622. New York: ACM Press, 2001.
42. [Dwork et al. 01] Cynthia Dwork, Ravi Kumar, and Moni Naor and D. Sivakumar. "Rank Aggregation Methods for the Web. " InProceedings of the Tenth International Conference on World Wide Web (WWW10), pp. 613-622. New York: ACM Press, 2001.
43. [Erdos and Renyi 59] Paul Erdos and Alfred Renyi. "On Random Graphs I". Math. Debrechen 6 (1959), 290-297.
44. [Fagin et al. 00] 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, pp. 484-493. New York: ACM Press, 2000.
45. [Fagin et al. 03a] Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, and David P. Williamson. "Searching the Workplace Web". In Proceedings of the Twelfth International Conference on World Wide Web (WWW12), pp. 366-375. New York: ACM Press, 2003.
46. [Fagin et al. 03b] Ronald Fagin, Ravi Kumar, and D. Sivakumar. "Comparing Top k Lists". In ACM SIAM Symposium on Discrete Algorithms, pp. 28-36. Philadelphia, PA: SIAM, 2003.
47. [Faloutsos et al. 99] Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. "On Power-law Relationships of the Internet Topology". In SIGCOMM, pp. 251-262. New York: ACM Press, 1999.
48. [Farahat et al. 01] 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, pp. 444-445. New York: ACM Press, 2001.
49. [Farahat et al. 04] Ayman Farahat, Thomas Lofaro, Joel C. Miller, Gregory Rae, and Lesley A. Ward. "Existence and Uniqueness of Ranking Vectors for Linear Link Analysis". Preprint, 2004; to appear in SIAM Journal on Scientific Computing.
50. [Farkas et al. 01] Illes J. Farkas, Imre Derenyi, Albert-Laszlo Barabasi, and Tamas Vicsek. "Spectra of Real-World Graphs: Beyond the Semicircle Law". Physical Review E 64 (2001), 026704-1-026704-12.
51. [Fetterly et al. 03] Dennis Fetterly, Mark Manasse, Marc Najork, and Janet L. Wiener. "A Large-Scale Study of the Evolution of Web Pages". Software-Practice and Experience 34:2 (2004), 213-217.
52. [Funderlic and Meyer 86] Robert E. Funderlic and Carl D. Meyer. "Sensitivity of the Stationary Distribution Vector for an Ergodic Markov Chain". Linear Algebra and its Applications 76 (1986), 1-17.
53. [Funderlic and Plemmons 86] Robert E. Funderlic and Robert J. Plemmons. "Updating LU Factorizations for Computing Stationary Distributions". SIAM Journal on Algebraic and Discrete Methods 7:1 (1986), 30-42.
54. [Ghemawat et al. 03] Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung. "The Google File System". In Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles, pp. 29-43. New York: ACM Press, 2003.
55. [Golub and Meyer 86] 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 (1986), 273-281.
56. [Google 03] Google. "Why Does My Page's Rank Keep Changing?" Google PageRank Information. Available on Word Wide Web (http://www.google.com/ webmasters/4.html), 2003.
57. [Haveliwala 99] Taher H. Haveliwala. "Efficient Computation of PageRank". Technical Report. Computer Science Department, Stanford University, 1999.
58. [Haveliwala 02a] Taher H. Haveliwala. "Efficient Encodings for Document Ranking Vectors". Technical Report. Computer Science Department, Stanford University, November 2002.
59. [Haveliwala 02b] Taher H. Haveliwala. "Topic-Sensitive PageRank". In Proceedings of the Eleventh International Conference on World Wide Web, pp. 517-526. New York: ACM Press, 2002.
60. [Haveliwala and Kamvar 03] Taher H. Haveliwala and Sepandar D. Kamvar. "The Second Eigenvalue of the Google Matrix". Technical report. Stanford University, 2003.
61. [Haveliwala et al. 03] Taher H. Haveliwala, Sepandar D. Kamvar, and Glen Jeh. "An Analytical Comparison of Approaches to Personalizing Pagerank". Technical report. Stanford University, 2003.
62. [Henzinger 03] Monika Henzinger. "Algorithmic Challenges in Web Search Engines". Internet Mathematics 1:1 (2003), 115-126.
63. [Henzinger et al. 03] Monika Henzinger, Bay-Wei Chang, Brian Milch, and Sergey Brin. "Query-Free News Search". In Proceedings of the Twelfth International Conference on World Wide Web (WWW12), pp. 1-10. New York: ACM Press, 2003.
64. [Henzinger et al. 02] Monika Henzinger, Rajeev Motwani, and Craig Silverstein. "Challenges in Web Search Engines". SIGIR Forum 36:2 (2002), 11-22.
65. [Ipsen and Meyer 94] Ilse C. F. Ipsen and Carl D. Meyer. "Uniform Stability of Markov Chains". SIAM Journal on Matrix Analysis and Applications 15:4 (1994), 1061-1074.
66. [Jeh and Widom 02] Glen Jeh and Jennifer Widom. "Scaling Personalized Web Search". Technical report. Stanford University, 2002.
67. [Kamvar and Haveliwala 03] Sepandar D. Kamvar and Taher H. Haveliwala. "The Condition Number of the PageRank Problem". Technical report. Stanford University, 2003.
68. [Kamvar et al. 03a] Sepandar D. Kamvar, Taher H. Haveliwala, and Gene H. Golub. "Adaptive Methods for the Computation of PageRank". Technical Report. Stanford University, 2003.
69. [Kamvar et al. 03b] 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. Stanford University, 2003.
70. [Kamvar et al. 03c] Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning, and Gene H. Golub. "Extrapolation Methods for Accelerating PageRank Computations". In Proc. of the Twelfth International Conference on World Wide Web, pp. 261-270. New York: ACM Press, 2003.
71. [Kao et al. 02] Hung-Yu Kao, Ming-Syan Chen, Shian-Hua Lin, and Jan-Ming Ho. "Entropy-Based Link Analysis for Mining Web Informative Structures". In Proceedings of the Eleventh International Conference on Information and Knowledge Management, pp. 574-581. New York: ACM Press, 2002.
72. [Kemeny and Snell 60] John G. Kemeny and Laurie J. Snell. Finite Markov Chains. New York: D. Van Nostrand, 1960.
73. [Kleinberg 99] Jon Kleinberg. "Authoritative Sources in a Hyperlinked Environment". Journal of the ACM 46:5 (1999), 604-632.
74. [Langville and Meyer 02a] Amy N. Langville and Carl D. Meyer. "Updating PageRank Using the Group Inverse and Stochastic Complementation". Technical Report. North Carolina State University, Mathematics Department, 2002.
75. [Langville and Meyer 02b] Amy N. Langville and Carl D. Meyer. "Updating the Stationary Vector of an Irreducible Markov Chain". Technical Report. N. C. State, Mathematics Dept., 2002.
76. [Langville and Meyer 03] Amy N. Langville and Carl D. Meyer. "A Survey of Eigenvector Methods of Web Information Retrieval". To appear in The SIAM Review.
77. [Langville and Meyer 04] Amy Langville and Carl Meyer. "A Reordering for the PageRank Problem". CRSC Tech Report. Center For Research in Scientific Computation, 2004.
78. [Lee et al. 03] Chris Pan-Chi Lee, Gene H. Golub, and Stefanos A. Zenios. "Partial State Space Aggregation Based on Lumpability and Its Application to PageRank". Technical Report. Stanford University, 2003.
79. [Lee and Borodin 03] Hyun Chul Lee and Allan Borodin. "Perturbation of the Hyperlinked Environment". In Computing and Combinatorics: 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, Lecture Notes in Computer Science 2697, edited by T. Warnow and B. Zhu, pp. 272-283. Heidelberg: Springer-Verlag, 2003.
80. [Lempel and Moran 00] Ronny Lempel and S. Moran. The Stochastic Approach for Link-Structure Analysis (SALSA) and the TKC Effect. Computer Netwroks 33:1-6 (2000) 387-401.
81. [Lempel and Moran 04] Ronny Lempel and Shlomo Moran. "Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs". Preprint available from World Wide Web (http://www.cs.technion.ac.il/~moran/r/PS/stab-kluwer.pdf), 2004; to appear in Information Retrieval, 2005.
82. [Lu et al. 04] Yizhou Lu, Benyu Zhang, Wensi Xi, Zheng Chen, Yi Liu, Michael R. Lyu, and Wei-Ying Ma. "The PowerRank Web Link Annalysis Algorithm". In Proceedings of the 13th International World Wide Web Conference. Alternate Track Papers & Posters, pp. 254-255. New York: ACM Press, 2004.
83. [Mathieu and Bouklit 04] Fabien Mathieu and Mohamed Bouklit. "The Effect of the Back Button in a Random Walk: Application for PageRank". In Proceedings of the 13th International World Wide Web Conference. Alternate Track Papers & Posters, pp. 370-371. New York: ACM Press, 2004.
84. [Mendelzon and Rafiei 00] Alberto O. Mendelzon and Davood Rafiei. "What Do the Neighbours Think? ComputingWeb Page Reputations". IEEE Data Engineering Bulletin 23:3 (2000), 9-16.
85. [Mendelzon and Rafiei 02] Alberto O. Mendelzon and Davood Rafiei. "An Autonomous Page Ranking Method for Metasearch Engines". The Eleventh International Conference on World Wide Web, Posters. Available from World Wide Web (http://www2002.org/CDROM/poster/48.pdf), 2002.
86. [Meyer 93] Carl D. Meyer. "The Character of a Finite Markov Chain". In Linear Algebra, Markov Chains, and Queueing Models, IMA Volumes in Mathematics and its Applications 48, pp. 47-58. Berlin: Springer-Verlag 1993.
87. [Meyer 94] Carl D. Meyer. "Sensitivity of the Stationary Distribution of a Markov Chain". SIAM Journal on Matrix Analysis and Applications 15:3 (1994), 715-728.
88. [Meyer 00] Carl D. Meyer. Matrix Analysis and Applied Linear Algebra. Philadelphia, PA: SIAM, 2000.
89. [Meyer and Shoaf 80] 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 (1980), 163-181.
90. [Meyer and Stewart 88] Carl D. Meyer and G.W. Stewart. "Derivatives and Perturbations of Eigenvectors". SIAM Journal on Numerical Analysis 25 (1988), 679-691.
91. [Moler 02] Cleve Moler. "The World's Largest Matrix Computation". In Matlab News and Notes, October 2002, pp. 12-13.
92. [Moler 04] Cleve B. Moler. Numerical Computing with MATLAB. Philadelphia, PA: SIAM, 2004.
93. [Ng et al. 01a] Andrew Y. Ng, Alice X. Zheng, and Michael I. Jordan. "Link Analysis, Eigenvectors and Stability". In Proc. of the Seventeenth International Joint Conference on Artificial Intelligence, pp. 903-910. San Francisco, CA: Morgan Kaufmann, 2001.
94. [Ng et al. 01b] 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, pp. 258-266. New York: ACM Press, 2001.
95. [Pandurangan et al. 02] Gopal Pandurangan, Prabhakara Raghavan, and Eli Upfal. "Using PageRank to Characterize Web Structure". In 8th Annual International Computing and Combinatorics Conference (COCOON), pp. 330-339. New York: ACM Press, 2002.
96. [Pretto 02a] Luca Pretto. "Link Analysis Techniques for Ranking Webpages". PhD thesis. University of Padua, 2002.
97. [Pretto 02b] Luca Pretto. "A Theoretical Analysis of PageRank". In Proceedings of the Ninth International Symposium on String Processing and Information Retrieval, pp. 131-144. New York: Springer-Verlag, 2002.
98. [Rafiei and Mendelzon 00] Davood Rafiei and Alberto O. Mendelzon. "What is this Page Known For? Computing Webpage Reputations". In The Ninth International WWW Conference, pp. 823-835. New York: Elsevier Science, 2000.
99. [Raghavan and Garcia-Molina 01a] Sriram Raghavan and Hector Garcia-Molina. "Compressing the Graph Structure of the Web". In Proceedings of the IEEE Conference on Data Compression, pp. 213-222. Los Alamitos: IEEE Press, 2001.
100. [Raghavan and Garcia-Molina 01b] Sriram Raghavan and Hector Garcia-Molina. "Towards Compressing Web Graphs". In Proceedings of the IEEE Conference on Data Compression, pp. 203-212. Los Alamitos: IEEE Press, 2001.
101. [Raghavan and Garcia-Molina 03] Sriram Raghavan and Hector Garcia-Molina. "Representing Web Graphs". In Proceedings of the 19th IEEE Conference on Data Engineering, pp. 405-416. Los Alamitos, CA: IEEE Press, 2003.
102. [Richardson and Domingos 02] Matthew Richardson and Petro Domingos. "The Intelligent Surfer: Probabilistic Combination of Link and Content Information in PageRank". In Advances in Neural Information Processing Systems 14, pp. 1441-1448. Cambridge, MA: MIT Press, 2001.
103. [Ridings 02] Chris Ridings. "PageRank Explained: Everything You've Always Wanted to Know About PageRank". Black Box Group: Rank Write Roundtable. Available from World Wide Web (http://www.rankwrite.com/), 2002.
104. [Ridings and Shishigin 02] Chris Ridings and Mike Shishigin. "PageRank Uncovered". White paper available from World Wide Web (http://www.voelspriel2.nl/ PageRank.pdf), 2002.
105. [Seneta 91] Eugene Seneta. "Sensivity Analysis, Ergodicity Coefficients, and Rank-One Updates for Finite Markov Chains". In Numerical Solution of Markov Chains, edited by William J. Stewart, pp. 121-129. New York: Marcel Dekker, 1991.
106. [Sherman 02] Chris Sherman. "Teoma vs. Google, Round 2". Silicon Valley Internet. Available from World Wide Web (http://dc.internet.com/ news/print.php/1002061), 2002.
107. [Stewart 94] William J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton: Princeton University Press, 1994.
108. [Sydow 04] Marcin Sydow. "Random Surfer with Back Step". In International World Wide Web Conference Archive Proceedings of the 13th International World Wide Web Conference. Alternate Track Papers & Posters, pp. 352-353. New York: ACM Press, 2004.
109. [Thorson 04] Kristen Thorson. "Modeling the Web and the Computation of PageRank". Undergraduate thesis, Hollins University, 2004.
110. [Tomlin 03] John A. Tomlin. "A New Paradigm for Ranking Pages on the World Wide Web". In Proceedings of the Twelfth International Conference on World Wide Web, pp. 350-355. New York: ACM Press, 2003.
111. [Totty and Mangalindan 03] Michael Totty and Mylene Mangalindan. "As Google BecomesWeb's Gatekeeper, Sites Fight to Get In". Wall Street Journal, CCXLI(39), February 26, 2003.
112. [Tsoi et al. 03] Ah Chung Tsoi, Gianni Morini, Franco Scarselli, and Markus Hagenbuchner. "Adaptive Ranking of Web Pages". In Proceedings of the Twelfth International Conference on World Wide Web, pp. 356-365. New York: ACM Press, 2003.
113. [Watts 99] Duncan J. Watts. Small Worlds. Princeton: Princeton University Press, 1999.
114. [WebRankInfo 03] WebRankInfo. "PageRank Explained". Available on World Wide Web (http://www.webrankinfo.com/english/pagerank), 2003.
115. [Wilkenson 65] James H. Wilkinson. The Algebraic Eigenvalue Problem. Oxford, UK: Clarendon Press, 1965.
116. [Zhang and Dong 00] Dell Zhang and Yisheng Dong. "An Efficient Algorithm to Rank Web Resources". Computer Networks 33 (2000), 449-455.