Evolution of page popularity under random web graph models

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 134-142

  Motwani, Rajeev ^a   Xu, Ying ^a  

^a Stanford University   (United States)

Author keywords

Page popularity; Random graph; Web graph

Indexed keywords

PAGE POPULARITY; PAGE QUALITY; QUALITY DISTRIBUTIONS; RANKING SCHEME;

COMPUTER GRAPHICS; DATA STRUCTURES; PROBABILITY; TELECOMMUNICATION LINKS;

WEBSITES;

EID: 34250652161     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142372     Document Type: Conference Paper

References (18)

1. A-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(15), pp. 509-512, 1999.
2. G.Bianconi and A-L. Barabasi. Competition and Multiscaling in evolving Networks. Europhysics Letters, 54(4), pp. 436-442, 2001.
3. B. Bollobas, C. Borgs, T. Chayes and O. Riordan. Directed scale-free graphs. Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
4. S. Brin, R. Motwani, L. Page, and T. Winograd. What can you do with a Web in your Pocket? Data Engineering Bulletin, 21: 37-47, 1998.
5. B. Bollobas and O. Riordan. Robustness and vulnerability of scale-free random graphs. Internet Mathematics, 1: 1-35, 2003.
6. C. Cooper and A. Frieze. A general model of web graphs. Random Structures and Algorithms, 22(3), pp. 311-335, 2003.
7. C. Cooper, A. Frieze and J. Vera. Random deletion in a scale-free random graph process. Internet Mathematics, 1: 463-483, 2003.
8. S. Chakrabarti, Alan Frieze and Juan Vera. The influence of search engines on preferential attachment. Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
9. J. Cho and S. Roy. Impact of Web search engines on page popularity. Proceedings of the Thirteenth International WWW Conference, 2004.
10. J. Cho, S. Roy and R.E. Adams. Page quality: In search of an unbiased web ranking. Proceedings of the ACM SIGMOD International Conference on Management of Data, 2005.
11. E. Drinea, M. Enachescu and M. Mitzenmacher. Variations on random graph models of the Web. Harvard Computer Science Technical Report TR-06-01.
12. E. Drinea, A. Frieze and M. Mitzenmacher. Balls and Bins Models with Feedback. Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.
13. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan and A.S. Tomkins. The Web as a Graph: measurements, models and methods. Proceedings of the 5th Annual International Conference on Computing and Combinatorics, 1999.
14. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal. Stochastic Models for the Web Graph. Proceedings of 41st IEEE Symposium on Foundations of Computer Science (FOCS), 2000.
15. R. Motwani and P. Raghavan. Randomized Algorithm. Cambridge University Press, 1995.
16. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report, Stanford Digital Libraries, 1998.
17. G. Pandurangan, P. Raghavan and E. Upfal. Using PageRank to Characterize Web Structure. Proceedings of the 8th Annual International Conference on Computing and Combinatorics, 2002.
18. S. Pandey, S. Roy, C. Olston, J. Cho and S. Chakrabarti. Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results. Proceedings of the 31st International Conference on Very Large Data Base (VLDB), 2005.