A random graph model for massive graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 171-180

  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

CONNECTED COMPONENT; DEGREE SEQUENCE; GIANT COMPONENTS; HIGH PROBABILITY; MASSIVE GRAPH; RANDOM GRAPH MODELS; RANDOM GRAPHS; THRESHOLD FUNCTIONS;

COMPUTATION THEORY; PROBABILITY DISTRIBUTIONS; COMPUTATIONAL METHODS; DATA STRUCTURES; MATHEMATICAL MODELS; RANDOM PROCESSES;

GRAPH THEORY;

MASSIVE GRAPHS; RANDOM GRAPH MODELS;

EID: 0033687763     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335326     Document Type: Conference Paper

References (18)

1. J. Abello, A. Buchsbaum, and J. Westbrook, A functional approach to external graph algorithms, Proc. 6th European Symposium on Algorithms, pp. 332-343, 1998.
2. W. Aiello, F. Chung, L. Lu, Random evolution of power law graphs, manuscript.
3. R. Albert, H. Jeong and A. Barabási, Diameter of the World Wide Web, Nature, 401, September 9, 1999.
4. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley and Sons, New York, 1992.
5. A. Baxabási, and R. Albert, Emergence of scaling in random networks, Science, 286, October 15, 1999.
6. A. Barabási, R. Albert, and H. Jeong Scale-free characteristics of random networks: the topology of the world wide web, Elsevier Preprint August 6, 1999.
7. P. Erdo{combining double acute accent}s and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci. 5 (1960), 17-61.
8. P. Erdo{combining double acute accent}s and A. Rényi, On the strength of connectedness of random graphs, Acta Math. Acad. Sci. Hungar. 12 (1961), 261-267.
9. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, Proceedings of the ACM SIGCOM Conference, Cambridge, MA, 1999.
10. J. Kleinberg, S. R. Kumar, P. Raphavan, S. Rajagopalan and A. Tomkins, The web as a graph: Measurements, models and methods, Proceedings of the International Conference on Combinatorics and Computing, July 26-28, 1999.
11. S. R. Kumar, P. Raphavan, S. Rajagopalan and A. Tomkins, Trawling the web for emerging cyber communities, Proceedings of the 8th World Wide Web Conference, Edinburgh, Scotland, May 15-19, 1999.
12. S.R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins, Extracting large-scale knowledge bases from the web, Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, September 7-10, 1999.
13. Tomasz Luczak, Sparse random graphs with a given degree sequence, Random Graphs, vol 2 (Poznań, 1989), 165-182, Wiley, New York, 1992.
14. Michael Molloy and Bruce Reed, A critical point for random graphs with a given degree sequence. Random Structures and Algorithms, Vol. 6, no. 2 and 3 (1995). 161-179.
15. Michael Molloy and Bruce Reed, The size of the giant component of a random graph with a given degree sequence, Combin. Probab. Comput. 7, no. (1998), 295-305.
16. P. Raghavan, personal communication.
17. N. C. Wormald, The asymptotic connectivity of labeled regular graphs, J. Comb. Theory (B) 31 (1981), 156-167.
18. N. C. Wormald, Models of random regular graphs, Surveys in Combinatorics, 1999 (LMS Lecture Note Series 267, Eds J.D.Lamb and D.A.Preece), 239-298.