PageRank and the Random Surfer Model

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 1010-1018

  Chebolu, Prasad ^a   Melsted, Páll ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; GROWTH (MATERIALS); INFORMATION RETRIEVAL; INTERNET; PHASE TRANSITIONS; WORLD WIDE WEB;

GOOGLE SEARCH ENGINE; PAGE RANKS; PAGERANK ALGORITHMS; PHASE TRANSITION; RANDOM GRAPH MODELS; SEARCH RESULTS; SELECTION MODELS;

SEARCH ENGINES;

EID: 58449096749     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Google technology overview [http://www.google.com /intl/en/corporate/ tech.html], 2004
2. R. Albert, H. Jeong, and A.-L. Barabasi. The diameter of the world wide web. Nature, 401:130, 1999.
3. N. Alon, J. H. Spencer, and P. Erdös. The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley and Sons, Inc., 1992.
4. K. Avrachenkov and D. Lebedev. Pagerank of scale-free growing networks. Internet Math., 3(2):207-231, 2007.
5. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509, 1999.
6. L. Becchetti and C. Castillo. The distribution of page R- ank follows a power-law only for particular values of the damping factor. In WWW '06: Proceedings of the 15th international conference on World Wide Web, pages 941-942. Edinburgh, Scotland. ACM Press.
7. A. Blum, T.-H. H. Chan, and M. R. Rwebangira. A random-surfer web-graph model. In ANALCO '06: Proceedings of the eigth Workshop on Algorithm Engineering and Experiments and the third Workshop on Analytic Algorithmics and Combinatorics, pages 238-246, Philadelphia, PA, USA, 2006. Society for Industrial and Applied Mathematics.
8. B. Bollobás, O, Riordan, J. Spencer, and G. Tusnády. The degree sequence of a scale-free random graph process. Random Struct. Algorithms, 18(3):279-290, 2001.
9. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
10. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web. In Proceedings of the 9th international World Wide Web conference on Computer networksx: the international journal of computer and telecommunications networking, pages 309-320, Amsterdam, The Netherlands, 2000. North- Holland Publishing Co.
11. S. Chakrabarti, A. Frieze, and J. Vera. The influence of search engines on preferential attachment. In SODA '05: Proceedings of the sixteenth annual ACM- SIAM symposium on Discrete algorithms, pages 293-300, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
12. C. Cooper and A. Frieze. A general model of web graphs. Random Struct. Algorithms, 22(3):311-335, 2003.
13. K. Csalogány, D. Fogaras, B. Rácz, and T. Sarlós. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Math., 2(3):333-358, 2005.
14. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pages 251-262, New York, NY, USA, 1999. ACM Press.
15. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. In FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer- Science, page 57, Washington, DC, USA, 2000. IEEE Computer Society.
16. A. Langville and C. Meyer. Deeper inside pagerank. Internet Math., 1(3):335-380, 2003.
17. M. Mitzenmacher. A brief history of generative models for power law and lognormal distributions. Internet Math., 1(2):226-251, 2004.
18. G. Pandurangan, P. Raghavan, and E. Upfal. Using pagerank to characterize web structure. In Computing and Combinatorics: 8th Annual International Conference, pages 330-339, Singapore, August 15-17, 2002.