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.
Baca kaedah sepenuhnya
Log masuk dengan akaun percuma untuk membaca bahagian ini.
Peta kaedah
Kejiranan kaedah berkaitan — pilih satu nod untuk meneroka.
Sumber
- 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 ↗
Cara memetik halaman ini
ScholarGate. (2026, June 23). Collaboration Distance and Erdős Number Analysis (Geodesics in Co-Authorship Networks). ScholarGate. https://scholargate.app/ms/bibliometrics/collaboration-distance-analysis
Kaedah yang mana?
Letakkan kaedah ini di sebelah kaedah yang paling rapat dengannya dan baca secara bersebelahan — perpustakaan menyusun buku di atas meja; pilihan terletak pada anda.
- Garfield's Law of ConcentrationBibliometrik↔ banding
- Relative Specialization / Activity IndexBibliometrik↔ banding
- Scientific Collaboration Index (Co-Authorship Intensity)Bibliometrik↔ banding
Dirujuk oleh
Kaedah serupa
Terjumpa masalah pada halaman ini? Laporkan atau cadangkan pembetulan →