A random graph model for power law graphs

Experimental Mathematics

Volumn 10, Issue 1, 2001, Pages 53-66

  Aiello, William ^a   Chung, Fan ^b   Lu, Linyuan ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035627527     PISSN: 10586458     EISSN: 1944950X     Source Type: Journal    
DOI: 10.1080/10586458.2001.10504428     Document Type: Article

References (20)

1. J. Abello, A. L. Buchsbaum, and J. R. Westbrook, "A functional approach to external graph algorithms", pp. 332-343 in Algorithms-ESA '98 (Venice, 1998), edited by G. Bilardi et al., Lecture Notes in Compo Sci. 1461, Springer, Berlin, 1998.
2. W. Aiello, F. Chung, and L. Lu, "A random graph model for massive graphs", pp. 171-180 in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (Portland, OR, 2000), ACM Press, New York, 2000.
3. W. Aiello, F. Chung, and L. Lu, "Random evolution of power law graphs", in Handbook of massive data sets, vol. 2, edited by J. Abello et al. To appear.
4. R. Albert, H. Jeong, and A. Barabasi, "Diamet er of the World Wide Web", Nature 401 (September 9, 1999).
5. N. Alon and J. H. Spencer, The probabilistic method, Wiley, New York, 1992.
6. A. Barabasi and R. Albert, "Emergence of scaling in random networks", Science 286 (October 15, 1999).
7. A.-L. Barabasi, R. Albert, and H. Jeong, "Scale-free characteristics of random networks: The topology of the World Wide Web", Physica A 281 (2000). See http://www.nd.edu/-hjeong/./paper.html.
8. P. Erdős and A. Renyi, "On the evolution of random graphs", Magyar Tud. Akad. Mat. Kutató Int. Kozl. 5 (1960), 17-61.
9. P. Erdos and A. R'eryi, "On the strength of connectedness of a random graph", Acta Math. Acad. Sci. Hungar. 12 (1961), 261-267.
10. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the internet topology", pp. 251-262 in ACM SIGCOMM '99 Conference: applications, technologies, architectures, and protocols for computer communications (Cambridge, MA, 1999), ACM Press, New York, 1999.
11. B. Hayes, "Graph theory in practice, II", A merican Scientist 88 (March-April 2000), 104-109.
12. J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. S. Tomkins, "The web as a graph: measurements, models, and methods", pp. 1-17 in Computing and combinatorics (Tokyo, 1999), edited by T. Asano et al., Lecture Notes in Compo Sci. 1627, Springer, Berlin, 1999.
13. S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "Trawling the web for emerging cyber communities", in Proceedings of the 8th World Wide Web Conference (Toronto, 1999), Elsevier, Amsterdam, 1999.
14. S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "Ext ract ing largescale knowledge bases from the web", pp. 639-650 in VLDB'99, Proceedings of 25th International Conference on Very Large Data Bases (Edinburgh, 1999), edited by M. P. Atkinson et al., Morgan Kaufmann, San Francisco, 1999. See http://www.informatik.unitrier.de/-Iey/db/conf'/vldb/vldb99.html.
15. S. 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 Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000), IEEE, Los Alamitos, CA, 2001.
16. T. Luczak, "Sparse random graphs with a given degree sequence", pp. 165-182 in Random graphs (Poznan, 1989), vol. 2, edited by A. Frieze and T. Luczak, Wiley, New York, 1992.
17. M. Molloy and B. Reed, "A critical point for random graphs with a given degree sequence", Random Structures and Algorithms 6:2-3 (1995), 161-179.
18. M. Molloy and B. Reed, "T he size of the giant component of a random graph with a given degree sequence", Combin. Probab. Comput. 7:3 (1998), 295-305.
19. N. C. Wormald, "The asymptotic connectivity of labelled regular graphs", J. Combin. Theory Ser. B 31:2 (1981), 156-167.
20. N. C. Wormald, "Models of random regular graphs", pp. 239-298 in Surveys in combinatorics (Canterbury, 1999), edited by J. D. Lamb and D. A. Preece, London Math. Soc. Lecture Note Series 267, Cambridge Univ. Press, Cambridge, 1999.