Collaboration Distance and Erdős Number Analysis
Collaboration distance analysis measures how closely connected scientists are through chains of co-authorship. Two researchers who have written a paper together are at distance 1; if they share a co-author but never wrote together, distance 2; and so on. The most famous instance is the Erdős number, the collaboration distance to the prolific mathematician Paul Erdős, popularized by the Erdős Number Project and analyzed by Rodrigo de Castro and Jerrold Grossman. M. E. J. Newman's landmark 2001 PNAS study generalized this idea, constructing large co-authorship networks across physics, biomedicine, and computer science and showing that they are 'small worlds': despite millions of authors, typical shortest paths are short and local clustering is high. Collaboration distance analysis thus characterizes the connectivity and reach of scientific communities through the geometry of their co-authorship graphs.
원본 기록
방법의 원본 기록에서 그대로 복사된 인용입니다. 이로부터 수준별 검증이 추론되지 않습니다.
- Newman, M. E. J. (2001). The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences, 98(2), 404-409. · DOI 10.1073/pnas.98.2.404
- De Castro, R., & Grossman, J. W. (1999). Famous trails to Paul Erdős. The Mathematical Intelligencer, 21(3), 51-63. · DOI 10.1007/BF03025416
큐레이션된 주장
각각 자체 평가와 함께 증거 원장에 유지된 주장입니다.
원장에 주장 평가가 없는 경우 이 보기에서는 주장 평가를 만들지 않습니다.
관련 방법
방법 그래프에서 생성되었으며 기계가 제안한 관계로 표시됩니다 — 증거 주장이 추론되지 않습니다.