The average distance in a random graph with given expected degrees

Internet Mathematics

Volumn 1, Issue 1, 2004, Pages 91-113

  Chung, Fan ^a   Lu, Linyuan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906264352     PISSN: 15427951     EISSN: 19449488     Source Type: Journal    
DOI: 10.1080/15427951.2004.10129081     Document Type: Article

References (24)

1. [Aiello et al. 00] W. Aiello, F. Chung, and L. Lu. "A Random Graph Model for Massive Graphs". Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 171-180. New York: ACM Press, 2000.
2. [Aiello et al. 01a] W. Aiello, F. Chung, and L. Lu. "A Random Graph Model for Power Law Graphs". Experimental Math. 10 (2001), 53-66.
3. [Aiello et al. 01b] W. Aiello, F. Chung, and L. Lu. "Random Evolution in Massive Graphs". In Handbook of Massive Data Sets, Vol. 2, pp. 97-122. Dordrecht: Kluwer Academic Publishers, 2002. An extended abstract appeared in The 42th Annual Symposium on Foundation of Computer Sciences, pp. 510-519. Los Alamitos: IEEE Computer Society, 2001.
4. [Alon and Spencer 92] N. Alon and J. H. Spencer. The Probabilistic Method. NewYork: Wiley and Sons, 1992.
5. [Albert et al. 99] R. Albert, H. Jeong, and A. Barabási. "Diameter of the World Wide Web". Nature 401 (1999), 130-131.
6. [Barabási and Albert 99] Albert-László Barabási and Réka Albert. Emergence of Scaling in Random Networks. Science 286 (1999), 509-512.
7. [Broder et al. 00] A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tompkins, and J. Wiener. "Graph Structure in the Web". In Proceedings of the WWW9 Conference, pp. 309-320. Amsterdam: Elsevier Science, 2000.
8. [Chung and Lu 01] Fan Chung and Linyuan Lu. "The Diameter of Random Sparse Graphs". Advances in Applied Math. 26 (2001), 257-279.
9. [Chung and Lu 03] Fan Chung and Linyuan Lu. "Connected Components in a Random Graph with Given Degree Sequences". To appear in Annals of Combinatorics.
10. [Erdo{double acute}s and Gallai 59] P. Erdo{double acute}s and T. Gallai. "Gráfok elo{double acute}írt fokú pontokkal (Graphs with Points of Prescribed Degrees, in Hungarian)". Mat. Lapok 11 (1961), 264-274.
11. [Erdo{double acute}s and Rényi 59] P. Erdo{double acute}s and A. Rényi. "On Random Graphs I". Publ. Math. Debrecen 6 (1959), 290-291.
12. [Faloutsos et al. 99] M. Faloutsos, P. Faloutsos, and C. Faloutsos. "On Power-Law Relationships of the Internet Topology". In SIGCOMM 1999, pp. 251-262. New York: ACM Press, 1999.
13. [Grossman et al. 03] Jerry Grossman, Patrick Ion, and Rodrigo De Castro. "Facts about Erdo{double acute}s Numbers and the Collaboration Graph". Available from the World Wide Web: (http://www.oakland.edu/~grossman/trivia.html), 2003.
14. [Jeong et al. 00] H. Jeong, B. Tomber, R. Albert, Z. Oltvai, and A. L. Babárasi. "The Large-Scale Organization of Metabolic Networks". Nature 407 (2000), 378-382.
15. [Kleinberg et al. 99] J. Kleinberg, S. R. Kumar, P. Raphavan, S. Rajagopalan, and A. Tomkins. "The Web as a Graph: Measurements, Models and Methods". In Proceedings of the International Conference on Combinatorics and Computing, Berlin-Heidelberg-New York: Springer-Verlag, 1999.
16. [Lotka 26] A. J. Lotka. "The Frequency Distribution of Scientific Productivity". The Journal of the Washington Academy of the Sciences 16 (1926), 317.
17. [Lu 01] Linyuan Lu. "The Diameter of Random Massive Graphs". In Proceedings of the Twelfth ACM-SIAM Symposium on Discrete Algorithms, pp. 912-921. New York: ACM Press, 2001.
18. [Lu 02] Linyuan Lu. "Probabilistic Methods in Massive Graphs and Internet Computing". Ph. D. diss., University of California, 2002. Available from the World Wide Web: (http://math.ucsd.edu/~llu/thesis.pdf), 2002.
19. [Milgram 67] S. Milgram. "The Small World Problem". Psychology Today 2 (1967), 60-67.
20. [Molloy and Reed 95] Michael Molloy and Bruce Reed. "A Critical Point for Random Graphs with a Given Degree Sequence". Random Structures and Algorithms 6:2-3 (1995), 161-179.
21. [Molloy and Reed 98] Michael Molloy and Bruce Reed. "The Size of the Giant Component of a Random Graph with a Given Degree Sequence". Combin. Probab. Comput. 7 (1998), 295-305.
22. [Newman et al. 00] M. E. J. Newman, S. H. Strogatz, and D. J. Watts. "Random Graphs with Arbitrary Degree Distribution and their Applications". Available from the World Wide Web: (http://xxx.lanl.gov/abs/cond-mat/0007235), 2000.
23. [Pareto 1897] V. Pareto. Cours d'economie politique. Lausanne et Paris: Rouge, 1897.
24. [Zipf 49] G. K. Zipf. Human Behaviour and the Principle of Least Effort. New York: Hafner, 1949.