A General Model of Web Graphs

Random Structures and Algorithms

Volumn 22, Issue 3, 2003, Pages 311-335

  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: 0037275663     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10084     Document Type: Article

References (26)

1. R. Albert, A. Barabasi, and H. Jeong, Diameter of the World Wide Web, Nature 401 (1999), 103-131.
2. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
3. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády, The degree sequence of a scale-free random graph process, Random Struct Alg 18 (2001), 279-290.
4. B. Bollobás and O. Riordan, The diameter of a scale free random graph, Combinatorica, to appear.
5. R. Bollobás and O. Riordan, "Mathematical results on scale-free graphs," Handbook of graphs and networks, S. Bornholdt and H. Schuster (Editors), Wiley-VCH, Berlin, 2002.
6. S. Brin and L. Page, The anatomy of a large scale hypertextual web search engine, Comput Networks 30 (1998), 107-117.
7. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, Graph structure in the web, Proc 9th Int World Wide Web Conf, Amsterdam, 2000, pp. 309-320.
8. P. Buckley and D. Osthus, Popularity based random graph models leading to a scale-free degree sequence, preprint, http://www.informatik.hu-berlin.de/̃osthus/.
9. C. Cooper and A. M. Frieze, Crawling on web graphs, Proc 34th Annu ACM Symp Theory of Computing, 2002, pp. 419-427.
10. C. Cooper, Distribution of vertex degree in web graphs, submitted, 2002.
11. S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, Structure of growing networks with preferential linking, Phys Rev Lett 85 (2000), 4633.
12. E. Drinea, M. Enachescu, and M. Mitzenmacher, Variations on random graph models for the web, Technical Report, Department of Computer Science, Harvard University, Cambridge, MA, 2001.
13. P. Erdo″s and A. Rényi, On random graphs I, Publ Math Debrecen 5 (1959), 290-297.
14. P. Erdo″s and A. Rényi, On the evolution of random graphs, Mag Tud Akad Mat Kut Intez Közl 5 (1960), 17-61.
15. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM 1999, Comput Commun Rev 29 (1999), 251.
16. B. Hayes, Graph theory in practice: Part II, Am Sci 88 (2000), 104-109, http://www.sigmaxi.org/amsci/issues/Comsci00/compsci2000-03.html.
17. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Am Stat Assoc 58 (1913), -30.
18. J. Kleinberg, Authoritative sources in a hyperlinked environment, Proc 9th ACM-SIAM Symp Discrete Algorithms, San Francisco, 1998, J ACM 46 (1999).
19. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal, The web as a graph, Proc 19th ACM Symp Principles of Database Systems, Dallas, 2000, pp. 1-10.
20. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal, Stochastic models for the web graph, Proc 41th IEEE Symp Foundations of Computer Science, Redondo Beach, 2000, pp. 57-65.
21. I. M. Milne-Thomson, The calculus of finite differences, Macmillian, London, 1951.
22. M. Mitzenmacher, A brief history of generative models for power law and lognormal distributions, to appear.
23. G. Pólya and G. Szego″, Problems and theorems in analysis I, Springer-Verlag, Berlin, 1970.
24. H. A. Simon, On a class of skew distribution functions, Biometrika 42 (1955), 425-440.
25. D. Watts, Small worlds: The dynamics of networks between order and randomness, Princeton University Press, Princeton, NJ, 1999.
26. G. Yule, A mathematical theory of evolution based on the conclusions of Dr. J. C. Willis, Phil Trans Roy Soc Lond Ser B 213 (1925), 21-87.