메뉴 건너뛰기




Volumn 68, Issue 3 2, 2003, Pages 361121-3611213

Class of correlated random networks with hidden variables

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; PROBABILITY;

EID: 0242663620     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (373)

References (56)
  • 37
    • 33645053620 scopus 로고    scopus 로고
    • note
    • k/N, although, for the sake of simplicity, we will obviate the limit here and in the following.
  • 38
    • 33645072838 scopus 로고    scopus 로고
    • note
    • Note that the probability pk′,k″ will in general depend on the particular network considered, and can also be a function of the degree k of the common vertex.
  • 40
    • 33645091740 scopus 로고    scopus 로고
    • e-print cond-mat/0305192
    • B. Söderberg, e-print cond-mat/0305192.
    • Söderberg, B.1
  • 44
    • 33645064943 scopus 로고    scopus 로고
    • note
    • But not generally at the actual degree level.
  • 47
    • 33645086773 scopus 로고    scopus 로고
    • note
    • The difference between ensembles can be of importance in cases where the fluctuations of the number of vertices does not vanish in the thermodynamic limit.
  • 51
  • 54
    • 33645063054 scopus 로고    scopus 로고
    • note
    • We consider here a linear growth of new vertices.
  • 55
    • 33645066218 scopus 로고    scopus 로고
    • note
    • t(t′), which measures the average degree of the same vertex at an intermediate time t′>t.


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