메뉴 건너뛰기




Volumn 64, Issue 1, 2001, Pages 7-

Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84898073807     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.64.016132     Document Type: Article
Times cited : (120)

References (17)
  • 2
    • 0004112038 scopus 로고
    • Addison-Wesley, Reading, MA
    • R. Sedgewick, Algorithms (Addison-Wesley, Reading, MA, 1988).
    • (1988) Algorithms
    • Sedgewick, R.1
  • 6
    • 85035257082 scopus 로고    scopus 로고
    • private communication
    • S.H. Strogatz (private communication).
    • Strogatz, S.H.1
  • 15
    • 0034299710 scopus 로고    scopus 로고
    • In the study of affiliation networks it is standard to weight ties by the number of common groups to which two actors belong 5, which would be equivalent in our case to taking frequency of collaboration into account but not number of co-workers. In the physics literature this method has been used, for example, to study the network of movie actors [M. Marchiori and V. Latora, Physica A 285, 539 (2000)].
    • (2000) Physica A , vol.285 , pp. 539
    • Marchiori, M.1    Latora, V.2
  • 17
    • 85035282315 scopus 로고    scopus 로고
    • University of Konstanz report, 2000 (unpublished)
    • U. Brandes, University of Konstanz report, 2000 (unpublished).
    • Brandes, U.1


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