The size of the largest strongly connected component of a random digraph with a given degree sequence

Combinatorics Probability and Computing

Volumn 13, Issue 3, 2004, Pages 319-337

  Cooper, Colin ^a   Frieze, Alan ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; FUNCTION EVALUATION; MATHEMATICAL MODELS; PROBABILITY; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

BOW-TIE DIGRAPHS; CONNECTED COMPONENTS; DICHOTOMY; RANDOM DIGRAPHS;

GRAPH THEORY;

EID: 3142649583     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354830400611X     Document Type: Article

References (16)

1. Aiello, W., Chung, F. R. and Lu, L. (2000) A random graph model for massive graphs. In Proc. 32nd Annual ACM Symposium on Theory of Computing, pp. 171-180.
2. Arratia, R., Goldstein, L. and Gordon, L. (1989) Two moments suffice for Poisson approximations: The Chen-Stein method. Ann. Probab. 17 9-25.
3. Bollobás, B. (2001) Random Graphs, 2nd edn, Academic Press.
4. Bollobás, B. (1984) The evolution of random graphs. Trans. Amer. Math. Soc. 286 257-274.
5. Bollobás, B. (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Europ. J. Combin. 1 311-316.
6. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A. and Wiener, J. (2000) Graph structure in the web. Proc. 9th WWW Conf. 309-320.
7. Cooper, C. (2002) The size of the cores of a random graph with a given degree sequence. Submitted to RSA.
8. Erdös, P. and Rényi, A. (1960) On the evolution of random graphs. Publ. Math. Inst. Hangar. Acad. Sci. 5 17-61.
9. Janson, S., Knuth, D. E., Łuczak, T. and Pittel, B. G. (1993) The birth of the giant component. Random Struct. Alg. 4 233-358.
10. Janson, S., Łuczak, T. and Rucinski, A. (2000) Random Graphs, Wiley, New York.
11. Karp, R. M. (1990) The transitive closure of a random digraph. Random Struct. Alg. 1 73-94.
12. Łuczak, T. (1990) Components behavior near the critical point of the random graph process. Random Struct. Alg. 1 287-310.
13. Łuczak, T., Pittel, B. G. and Wierman, J. C. (1994) The structure of a random graph near the point of the phase transition. Trans. Amer. Math. Soc. 341 721-748.
14. Molloy, M. and Reed, B. A. (1995) A critical point for random graphs with a given degree sequence. Random Struct. Alg. 6 161-180.
15. Molloy, M. and Reed, B. A. (1998) The size of the largest component of a random graph on a fixed degree sequence. Combin. Probab. Comput. 7 295-306.
16. Uno, Y. and Ibaraki, T. Reachability problems of random digraphs. Graphs and Networks, E81-A 2694.