메뉴 건너뛰기




Volumn 26, Issue 1-2, 2005, Pages 224-236

Concentration of vertex degrees in a scale-free random graph process

Author keywords

[No Author keywords available]

Indexed keywords


EID: 22144494124     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20065     Document Type: Conference Paper
Times cited : (14)

References (13)
  • 1
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
    • (1999) Science , vol.286 , pp. 509-512
    • Barabási, A.-L.1    Albert, R.2
  • 2
    • 18744421488 scopus 로고    scopus 로고
    • Mean-field theory for scale-free random networks
    • A.-L. Barabási, R. Albert, and H. Jeong, Mean-field theory for scale-free random networks, Physica A 272 (1999), 173-187.
    • (1999) Physica A , vol.272 , pp. 173-187
    • Barabási, A.-L.1    Albert, R.2    Jeong, H.3
  • 3
    • 0342521525 scopus 로고    scopus 로고
    • Scale-free characteristics of random networks: The topology of the world-wide web
    • A.-L. Barabási, R. Albert, and H. Jeong, Scale-free characteristics of random networks: The topology of the world-wide web, Physica A 281 (2000), 69-77.
    • (2000) Physica A , vol.281 , pp. 69-77
    • Barabási, A.-L.1    Albert, R.2    Jeong, H.3
  • 8
    • 84899841718 scopus 로고    scopus 로고
    • The web as a graph: Measurements, models, and methods
    • Computing and combinatorics (Tokyo, 1999), Springer, New York
    • J. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "The web as a graph: Measurements, models, and methods," Computing and combinatorics (Tokyo, 1999), Lecture Notes in Comput Sci, 1627, 1-17. Springer, New York, 1999.
    • (1999) Lecture Notes in Comput Sci , vol.1627 , pp. 1-17
    • Kleinberg, J.1    Kumar, S.R.2    Raghavan, P.3    Rajagopalan, S.4    Tomkins, A.5
  • 10
    • 0039606828 scopus 로고    scopus 로고
    • Strong consistency of the number of vertices of given degrees in nonuniform random recursive trees
    • J. L. Lu and Q. Feng, Strong consistency of the number of vertices of given degrees in nonuniform random recursive trees, Yokohama Math J 45 (1998), 61-69.
    • (1998) Yokohama Math J , vol.45 , pp. 61-69
    • Lu, J.L.1    Feng, Q.2
  • 12
    • 84990634414 scopus 로고
    • On the structure of plane-oriented recursive trees and their branches
    • H. Mahmoud, R. Smythe, and J. Szymański, On the structure of plane-oriented recursive trees and their branches, Random Structures Algorithms 4 (1993), 151-176.
    • (1993) Random Structures Algorithms , vol.4 , pp. 151-176
    • Mahmoud, H.1    Smythe, R.2    Szymański, J.3
  • 13
    • 0040792724 scopus 로고
    • On the nonuniform random recursive tree
    • J. Szymański, On the nonuniform random recursive tree, Ann Discrete Math 33 (1987), 297-306.
    • (1987) Ann Discrete Math , vol.33 , pp. 297-306
    • Szymański, J.1


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