Using pagerank to characterize web structure

Internet Mathematics

Volumn 3, Issue 1, 2006, Pages 1-

  Pandurangan, Gopal ^a   Raghavan, Prabhakar ^b   Upfal, Eli ^c  

^a Purdue University   (United States)

^b YAHOO RESEARCH   (United States)

^c Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79956143308     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2006.10129114     Document Type: Article

References (27)

1. L. Adamic and B. Huberman. “Power Law Distribution of the World Wide Web.” Technical Comment on [Barab´asi and Albert 99], Science 287 (2000), 2115a.
2. W. Aiello, F. Chung-Graham and L. Lu. “Random Evolution of Massive Graphs.” In Handbook on Massive Data Sets, edited by James Abello et al., pp. 97–122. Dordrecht: Kluwer Academic Publishers, 2002.
3. W. Aiello, F. Chung-Graham, and L. Lu. “A Random Graph Model forMassive Graphs.” In Proceedings of the Thirty-Second Annual ACM Symposium Downloaded by on Theory of Computing, pp. 171–180. New York: ACM Press, 2000. Journal version: “A Random Graph Model for Massive Graphs.” Experimental Math. 10 (2001), 53–66.
4. 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. A Barabási and R. Albert. “Emergence of Scaling in Random Networks.” Science 286 (1999), 509–512.
6. A Barabási, R. Albert, and H. Jeong. “Scale-Free Characteristics of Random Networks: The Topology of the World Wide Web.” Physica A 281 (2000), 69–77.
7. A Barabás, R. Albert, and H. Jeong. “Mean-Field Theory for Scale-Free Random Graphs.” Physica A 272 (1999), 173–187.
8. B Bollobas. Random Graphs. Cambridge, UK: Cambridge University Press, 2001.
9. B Bollobas, O. Riordan, J. Spencer, and G. Tusnady. “The Degree Sequence of a Scale-Free Random Graph Process.” Random Structures and Algorithms 18:3 (2001), 279–290.
10. B Bollobas and O. Riordan. “The Diameter of a Scale-Free Random Graph.” Combinatorica 4 (2004), 5–34.
11. S. Brin and L. Page. “The Anatomy of a Large-Scale Hypertexual Web Search Engine.” In Proceedings of the Seventh International World-Wide Web Conference, special issue of Computer Networks and ISDN Systems 30:1–7 (1998), 107–117.
12. A Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, Andrew Tomkins, and J. Weiner. “Graph Structure in the Web.” Computer Networks and ISDN Systems 30 (2000), 309–320.
13. C Cooper and A. Frieze. “A General Model of Web Graphs.” Random Structures and Algorithms 22 (2002), 311–335.
14. S. Dill, R. Kumar, K. McCurley, S. Rajagopalan, D. Sivakumar, and A. Tomkins. “Self-Similarity in the Web.” In Proceedings of the 27th International Conference on Very Large Databases (VLDB), pp. 69–78. San Francisco: Morgan Kaufmann, 2001.
15. E Drinea, M. Enachescu, and M. Mitzenmacher. “Variations on Random Graph Models for the Web.” Harvard Technical Report TR-06-01, 2001.
16. D Gibson, J. M. Kleinberg, and P. Raghavan. “Inferring Web Communities from Link Topology.” In Proceedings of the Ninth ACM Conference on Hypertext and Hypermedia, pp. 225–234. New York: ACM Press, 1998.
17. “Google Technology Overview.” Available from World Wide Web (http://www.google.com/intl/en/corporate/tech.html), 2004.
18. M. Henzinger. “Algorithmic Challenges in Web Search Engines.” Internet Mathematics 1:1 (2003), 115–126.
19. J. Kleinberg, S. Ravi Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. “The Web as a Graph: Measurements, Models And Methods.” In Computing and Combinatorics: Proceedings of the 5th Annual International Conference (COCOON’99), pp. 1–17. Lecture Notes in Computer Science 1627. New York: Springer, 1999.
20. R Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. “Trawling the Web for Emerging Cyber-Communities.” In Proceedings of the Eighth International World-Wide Web Conference, special edition of Computer Networks and ISDN Systems 31:11–16 (1999), 1481–1493.
21. R Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. “Stochastic Models for the Web.” In Proceedings of the 41st Annual Symposium on the Foundations of Computer Science, pp. 57–65. Los Alamitos, CA: IEEE Press, 2000.
22. A Langville and C. Meyer. “Deeper Inside PageRank.” Internet Mathematics 1:3 (2003), 335–380.
23. M. Levene, T.I. Fenner, G. Loizou, and R. Wheeldon. “A Stochastic Model for the Evolution of the Web.” Computer Networks and ISDN Systems 39 (2002), 277–287.
24. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge, UK: Cambridge University Press, 1995.
25. L. Page, S. Brin, R. Motwani, and T. Winograd. “The PageRank Citation Ranking: Bringing Order to the Web.” Technical Report, Computer Science Department, Stanford University, 1998.
26. H. Papadimitriou. “Lecture Notes.” Available from World Wide Web (http://www.cs.berkeley.edu/∼christos/games/powerlaw.ps), 2003.
27. “TREC Web Corpus: WT10g.” Available from World Wide Web (http://es.csiro.au/TRECWeb/wt10g.html), 2003.