The first eigenvalue of random graphs

Combinatorics Probability and Computing

Volumn 14, Issue 5-6, 2005, Pages 815-828

  Janson, Svante ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; GRAPH THEORY; NUMBER THEORY; PROBLEM SOLVING; RANDOM PROCESSES;

ASYMPTOTIC VARIANCE; RANDOM GRAPHS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 26644473461     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548305007030     Document Type: Article

References (7)

1. Alon, N., Krivelevich, M. and Vu, V. H. (2002) On the concentration of eigenvalues of random symmetric matrices. Israel J. Math. 131 259-267.
2. Füredi, Z. and Komlós, J. (1981) The eigenvalues of random symmetric matrices. Combinatorica 1 233-241.
3. Janson, S. (1994) Orthogonal Decompositions and Functional Limit Theorems for Random Graph Statistics, Mem. Amer. Math. Soc., Vol. 111, no. 534, AMS, Providence, RI.
4. Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley, New York.
5. Kallenberg, O. (2002) Foundations of Modern Probability, 2nd edn, Springer, New York.
6. Krivelevich, M. and Sudakov, B. (2003) The largest eigenvalue of sparse random graphs. Combin. Probab. Comput. 12 61-72.
7. Stanley, R. P. (1999) Enumerative Combinatorics, Vol. 2, Cambridge University Press.