메뉴 건너뛰기




Volumn 12, Issue 1, 2003, Pages 61-72

The largest eigenvalue of sparse random graphs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; PROBABILITY; THEOREM PROVING;

EID: 0037258888     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548302005424     Document Type: Article
Times cited : (170)

References (13)
  • 1
    • 84949221689 scopus 로고    scopus 로고
    • Spectral techniques in graph algorithms
    • LATIN'98: Theoretical Informatics (Campinas 1998), Springer, Berlin
    • Alon, N. (1998) Spectral techniques in graph algorithms. In LATIN'98: Theoretical Informatics (Campinas 1998), Vol. 1380 of Lecture Notes in Computer Science, Springer, Berlin, pp. 206-215.
    • (1998) Lecture Notes in Computer Science , vol.1380 , pp. 206-215
    • Alon, N.1
  • 2
    • 0037825135 scopus 로고    scopus 로고
    • On the concentration of eigenvalues of random symmetric matrices
    • in press
    • Alon, N., Krivelevich, M. and Vu, V. H. On the concentration of eigenvalues of random symmetric matrices. Israel J. Math., in press.
    • Israel J. Math.
    • Alon, N.1    Krivelevich, M.2    Vu, V.H.3
  • 7
    • 51249182622 scopus 로고
    • The eigenvalues of random symmetric matrices
    • Füredi, Z. and Komlós, J. (1981) The eigenvalues of random symmetric matrices. Combinatorica 1 233-241.
    • (1981) Combinatorica , vol.1 , pp. 233-241
    • Füredi, Z.1    Komlós, J.2
  • 9
    • 0035271983 scopus 로고    scopus 로고
    • Sparse random matrices: Spectral edge and statistics of rooted trees
    • Khorunzhy, A. (2001) Sparse random matrices: Spectral edge and statistics of rooted trees. Adv. Appl. Probab. 33 1-18.
    • (2001) Adv. Appl. Probab. , vol.33 , pp. 1-18
    • Khorunzhy, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.