메뉴 건너뛰기




Volumn 38, Issue 2, 2004, Pages 163-168

Betweenness centrality in large complex networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANISOTROPY; BOUNDARY VALUE PROBLEMS; BROWNIAN MOVEMENT; CIRCUIT THEORY; COMPUTATIONAL METHODS; GRAPH THEORY; PARAMETER ESTIMATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SPURIOUS SIGNAL NOISE;

EID: 2942566632     PISSN: 14346028     EISSN: None     Source Type: Journal    
DOI: 10.1140/epjb/e2004-00111-4     Document Type: Conference Paper
Times cited : (651)

References (27)
  • 10
    • 2942536947 scopus 로고    scopus 로고
    • D. Wilkinson, B.A. Huberman, cond-mat/0210147
    • D. Wilkinson, B.A. Huberman, cond-mat/0210147
  • 12
    • 2942584085 scopus 로고    scopus 로고
    • M.E.J. Newman, cond-mat/0309045
    • M.E.J. Newman, cond-mat/0309045
  • 16
    • 2942557589 scopus 로고    scopus 로고
    • note
    • For networks with peaked connectivity distributions such as the random graph, the centrality is also peaked and the exponent δ is not defined
  • 24
    • 0004219960 scopus 로고
    • Academic Press, New York
    • B. Bollobas, Random Graph (Academic Press, New York. 1985)
    • (1985) Random Graph
    • Bollobas, B.1
  • 27
    • 2942559366 scopus 로고    scopus 로고
    • note
    • It would be interesting to quantify for different types of networks the degree of anisotropy - measured by the Ni's - versus the connectivity


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