A survey of models of the web graph

Lecture Notes in Computer Science

Volumn 3405, Issue , 2005, Pages 159-172

  Bonato, Anthony ^a  

^a WILFRID LAURIER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; RANDOM PROCESSES;

STOCHASTIC MODELS; WEB GRAPHS;

WORLD WIDE WEB;

EID: 24344463510     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527954_16     Document Type: Conference Paper

References (47)

1. A. Adler, M. Mitzenmacher, Towards compressing web graphs, In: Proceedings of the Data Compression Conference, 2001.
2. W. Aiello, F. Chung, L. Lu, A random graph model for massive graphs, Experimental Mathematics 10 (2001) 53-66.
3. W. Aiello, F. Chung, L. Lu, Random evolution in massive graphs, Handbook on Massive Data Sets (James Abello et al. eds.), Kluwer Academic Publishers, (2002), 97-122.
4. R. Albert, A. Barabási, H. Jeong, Diameter of the World-Wide Web, Nature 401 (1999) 130.
5. R. Albert, A. Barabási, Emergence of scaling in random networks, Science 286 (1999) 509-512.
6. P. Baldi, P. Frasconi, P. Smyth, Modeling the Internet and the Web, Probabilistic Methods and Algorithms, John Wiley & Sons, Ltd, Chichester, West Sussex, England, 2003.
7. A. Barabási, Linked: How Everything Is Connected to Everything Else and What It Means, Perseus Publishing, Cambridge MA, 2002.
8. B. Bollobás, Modern Graph Theory, Springer-Verlag, New York 1998.
9. B. Bollobás, Random graphs, Second edition, Cambridge Studies in Advanced Mathematics 73 Cambridge University Press, Cambridge, 2001.
10. B. Bollobás, O. Riordan, Mathematical results on scale-free graphs, Handbook of graphs and networks (S. Bornholdt, H. Schuster eds.), Wiley-VCH, Berlin (2002).
11. B. Bollobás, O. Riordan, Robustness and vulnerability of scale-free random graphs, Internet Mathematics 1 (2004) 1-35.
12. B. Bollobás, O. Riordan, The diameter of a scale-free random graph, Combinatorica 24 (2004) 5-34.
13. B. Bollobás, C. Borgs, T. Chayes, O. Riordan, Directed scale-free graphs, submitted.
14. B. Bollobás, O. Riordan, J. Spencer, G. Tusnády, The degree sequence of a scalefree random graph process, Random Structures Algorithms 18 (2001) 279-290.
15. A. Bonato, J. Janssen, Infinite limits of copying models of the web graph, Internet Mathematics 1 (2004) 193-213.
16. A. Bonato, J. Janssen, Limits and power laws of models for the web graph and other networked information spaces, accepted to the Proceedings of Combinatorial and Algorithmic Aspects of Networking, 2004.
17. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, J. Wiener, Graph structure in the web, Computer Networks 33 (2000) 309-320.
18. P.G. Buckley, D. Osthus, Popularity based random graph models leading to a scale-free degree sequence, submitted.
19. G. Caldarelli, P. De Los Rios, L. Laura, S. Leonardi, S. Millozzi, A study of stochastic models for the Web Graph, Technical Report 04-03, dipartimento di Informatica e Sistemistica, Universita' di Roma "La Sapienza", 2003.
20. P.J. Cameron, The random graph, Algorithms and Combinatorics (R.L. Graham and J. Nešetřil, eds.), Springer Verlag, New York (1997) 333-351.
21. P.J. Cameron, The random graph revisited, in: European Congress of Mathematics, Vol. I (Barcelona, 2000), 267-274,
22. Progr. Math., 201, Birkhäuser, Basel, 2001.
23. S. Chakrabarti, Mining the Web, Discovering Knowledge from Hypertext Data, Morgan Kauffman Publishers, San Francisco, 2003.
24. F. Chung, G. Dewey, D. J. Galas, L. Lu, Duplication models for biological networks, Journal of Computational Biology 10 (2003) 677-688.
25. F. Chung, L. Lu, Connected components in random graphs with given degree sequences, Annals of Combinatorics 6 (2002) 125-145.
26. F. Chung, L. Lu, The average distances in random graphs with given expected degrees, Internet Mathematics 1 (2004) 91-114.
27. F. Chung, L. Lu, The small world phenomenon in hybrid power law graphs, Complex Networks, (Eds. E. Ben-Naim et. al.), Springer-Verlag (2004) 91-106.
28. F. Chung, L. Lu, Coupling on-line and on-line analyses for random power law graphs, submitted.
29. C. Cooper, A. Frieze, On a general model of web graphs, Random Structures Algorithms 22 (2003) 311-335.
30. C. Cooper, A. Frieze, J. Vera, Random deletions in a scale free random graph process, submitted.
31. R. Diestel, Graph theory, Springer-Verlag, New York, 2000.
32. S.N. Dorogovtsev, J.F.F. Mendes, Evolution of networks: ¿From biological nets to the Internet and WWW, Oxford University Press, Oxford, 2003.
33. S.N. Dorogovtsev, J.F.F. Mendes, A.N. Samukhin, Structure of growing networks with preferential linking, Physical Review Letters 85 (2000) 4633-4636.
34. E. Drinea, M. Enachescu, M. Mitzenmacher, Variations on random graph models for the web, technical report, Department of Computer Science, Harvard University, 2001.
35. P. Erdös, A. Rényi, On random graphs I, Publ. Math. Debrecen 6 (1959) 290-297.
36. P. Erdös, A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960) 17-61.
37. A. Fabrikant, E. Koutsoupias, C. Papadimitriou, Heuristically optimized Tradeoffs: a new paradigm for power laws in the internet, In: Proceedings of the 34th Symposium on Theory of Computing, 2002.
38. A. Flaxman, A. Frieze, J. Vera, Adversarial deletions in a scale free random graph process, submitted.
39. E.N. Gilbert, Random graphs, Annals of Mathematical Statistics 30 (1959) 1141-1144.
40. M.R. Henzinger, Algorithmic challenges in web search engines, Internet Mathematics 1 (2004) 115-126.
41. S. Janson, T. Luczak, A. Ruciński, Random Graphs, John Wiley and Sons, New York, 2000.
42. J. Kleinberg, S.R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins, The web as a graph: Measurements, models and methods, In: Proceedings of the International Conference on Combinatorics and Computing, 1627 in LNCS, Springer-Verlag, 1999.
43. R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins, Trawling the web for emerging cyber-communities, In: Proceedings of the 8th WWW Conference, 1999.
44. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, E. Upfal, Stochastic models for the web graph, In: Proceedings of the 41th IEEE Symp. on Foundations of Computer Science, 57-65, 2000.
45. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, E. Upfal, The web as a graph, In: Proc. 19th ACM SIGACT-SIGMOD-AIGART Symp. Principles of Database Systems, Publ., Dordrecht, 2002.
46. M. Mitzenmacher, A brief history of generative models for power law and lognormal distributions, Internet Mathematics 1 (2004) 226-251.
47. S.H. Strogatz, D.J. Watts, Collective dynamics of 'small-world' networks, Nature 393 (1998) 440-442.