Crawling on simple models of web graphs

Internet Mathematics

Volumn 1, Issue 1, 2004, Pages 57-90

  Cooper, Colin ^a   Frieze, Alan ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906235216     PISSN: 15427951     EISSN: 19449488     Source Type: Journal    
DOI: 10.1080/15427951.2004.10129078     Document Type: Article

References (29)

1. [Achlioptas et al. 01] D. Achlioptas, A. Fiat, A.R. Karlin, and F. McSherry. "Web Search via Hub Synthesis". In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 500-509. Los Alamitos: IEEE Press, 2001.
2. [Adler and Mitzenmacher 01] M. Adler and M. Mitzenmacher. "Toward Compressing Web Graphs". In Proceedings of the 2001 Data Compression Conference, pp. 203-212. Los Alamitos: IEEE Press, 2001.
3. [Aiello et al. 01a] W. Aiello, F. Chung, and L. Lu. "Random Evolution in Massive Graphs". In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 510-519. Los Alamitos: IEEE Press, 2001.
4. [Aiello et al. 01b] W. Aiello, F. Chung, and L. Lu. "A Random Graph Model for Power Law Graphs". Experiment. Math. 10 (2001), 53-66.
5. [Albert et al. 99] R. Albert, A. Barabasi, and H. Jeong. "Diameter of the World Wide Web". Nature 401 (1999), 103-131 (1999). Available from World Wide Web (http://xxx.lanl.gov/abs/cond-mat/9907038), 1999.
6. [Barabassi et al. 99] A. Barabasi, R. Albert, and H. Jeong. "Scale-Free Characteristics of Random Networks: The Topology of the World Wide Web". Physics A 272 (1999), 173-187.
7. [Barabasi and Albert 99] A. Barabasi and R. Albert. "Emergence of Scaling in Random Networks. Science 286 (1999), 509-512.
8. [Bollobás and Riordan 01] B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády. "The Degree Sequence of a Scale Free Random Graph Process". Random Structures and Algorithms 18 (2001), 279-290.
9. [Bollobás and Riordan 02] B. Bollobás and O. Riordan. "Mathematical Results on Scale-Free Graphs". In Handbook of Graphs and Networks, edited by S. Bornholdt and H. Schuster. Berlin: Wiley-VCH, 2002.
10. [Bollobás and Riordan 03] B. Bollobás and O. Riordan. " Robustness and Vulnerability of Scale-Free Random Graphs", Internet Mathematics 1:1, (2003), 69-102.
11. [Bollobás and Riordan to appear] B. Bollobás and O. Riordan. "The Diameter of a Scale Free Random Graph". To appear.
12. [Brin and Page 98] S. Brin and L. Page, The Anatomy of a Large Scale Hypertextual Web Search Engine". Computer Networks 30 (1998), 107-117.
13. [Broder et al. 00] A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. "Graph Structure in the Web". In Proc. of 9th Intl. WWW Conf., pp. 309-320. Amsterdam: Elsevier Science, 2000. Available from World Wide Web (http://gatekeeper.dec.com/pub/DEC/SRC/ publications/stata/www9.htm).
14. [Buckley and Osthus 01] P. G. Buckley and D. Osthus. "Popularity Based Random Graph Models Leading to a Scale-Free Degree Sequence". Preprint available from (http://www.informatik.hu-berlin.de/~osthus/), 2001.
15. [Chung and Lu to appear] F. Chung and L. Lu. "Connected Components in a Random Graph with Given Degree Sequences". To appear in Annals of Combinatorics.
16. [Chung and Lu 02] F. Chung and L. Lu. "The Average Distances in Random Graphs with Given Expected Degrees". PNAS 99 (2002), 15879-15882.
17. [Cooper and Frieze 01] C. Cooper and A. M. Frieze. "A General Model of Web Graphs". In Proceedings of ESA 2001, pp. 500-511. Berlin/Heidelberg/New York: Springer, 2001.
18. [Drinea et al. 01] E. Drinea, M. Enachescu, and M. Mitzenmacher. Variations on Random Graph Models for the Web. Harvard Computer Science Technical Report TR-06-01, Cambridge: Harvard University, 2001.
19. [Erdo{double acute}s and Rényi 59] P. Erdo{double acute}s and A. Rényi. "On Random Graphs I". Publicationes Mathematicae Debrecen 5 (1959), 290-297.
20. [Erdo{double acute}s and Rényi 60] P. Erdo{double acute}s and A. Rényi. "On the Evolution of Random Graphs". Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 (1960), 17-61.
21. [Fagin et al. 00] R. Fagin, A. Karlin, J. Kleinberg, P. Raghavan, S. Rajagopalan, R. Rubinfeld, M. Sudan, and A. Tomkins. "Random Walks with Back Buttons". In STOC 2000, pp. 484-493. New York: ACM Press, 2000.
22. [Faloutsos et al. 99] M. Faloutsos, P. Faloutsos, and C. Faloutsos. "On Power-Law Relationships of the Internet Topology". SIGCOMM 1999, Comput. Commun. Rev. 29 (1999), 251.
23. [Henzinger et al. 99] M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. "Measuring Index Quality Using Random Walks on the Web". WWW8 / Computer Networks 31 (1999), 1291-1303.
24. [Hoeffding 63] W. Hoeffding. Probability Inequalities for Sums of Bounded Random Variables. Journal of the American Statistical Association 58 (1963), 13-30.
25. [Kumar et al. 00a] R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. "The Web as a Graph". In Proceedings of the 19th Annual ACM Symposium on Principles of Database Systems, pp. 1-10. New York: ACM Press, 2000.
26. [Kumar et al. 00b] R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. "Stochastic Models for the Web Graph". In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 57-65. Los Alamitos: IEEE Press, 2000.
27. [Lu 01] L. Lu. "The Diameter of Random Massive Graphs". In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 912-921. New York: ACM Press, 2001.
28. [Sinclair and Jerrum 89] A. Sinclair and M. Jerrum. "Approximate Counting, Uniform Generation, and Rapidly Mixing Markov Chains". Information and Computation 82 (1989), 93-133.
29. [Watts 99] D. Watts. Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton: Princeton University Press, 1999.