The structure of collaboration in the Journal of Finance
- 437 Downloads
This paper studies the structure of collaboration in the Journal of Finance for the period 1980–2009 using publication data from the Social Sciences Citation Index (SSCI). There are 3,840 publications within this period, out of which 58% are collaborations. These collaborations form 405 components, with the giant component capturing approximately 54% of total coauthors (it is estimated that the upper limit of distinct JF coauthors is 2,536, obtained from the total number of distinct author keywords found within the study period). In comparison, the second largest component has only 13 members. The giant component has mean degree 3 and average distance 8.2. It exhibits power-law scaling with exponent α = 3.5 for vertices with degree ≥5. Based on the giant component, the degree, closeness and betweenness centralization score, as well as the hubs/authorities score is determined. The findings indicate that the most important vertex on the giant component coincides with Sheridan Titman based on his top ten ranking on all four scores.
KeywordsCo-authorship Collaboration Network structure
- Batagelj, V., & Mrvar, A. (1998). Pajek—Program for large network analysis. Connections, 21, 47–57.Google Scholar
- Correa, C., Crnovrsanin, T., Kwan, L. M., Keeton, K. (2009). The derivatives of centrality and their applications in visualizing social networks. Technical Report, UC Davis Department of Computer Science. Available online: http://www.cs.ucdavis.edu/research/tech-reports/2009/CSE-2009-5.pdf.
- Csardi, G., Nepusz, T. (2006). The igraph software package for complex network research. InterJournal Complex Systems 1695. http://igraph.sf.net.
- de Nooy, W., Mrvar, A., & Batagelj, V. (2004). Exploratory network analysis with Pajek. Cambridge: Cambridge University Press.Google Scholar
- Ding, C., Xiaofeng, H., Husbands, P., Hongyuan, Z., & Simon, H. D. (2002). PageRank, HITS and a unified framework for link analysis. In Proceedings of the 25th annual international ACM SIGIR conference on research and development in information retrieval, 11–15 Aug 2002, Tampere, Finland.Google Scholar
- Grossman, J. W. (1996). The Erdős Number Project. http://www.oakland.edu/enp/.
- Hoffman, P. (1998). The man who loved only numbers: The story of Paul Erdős and the search for mathematical truth. New York: Hyperion.Google Scholar
- Kleinberg, J. (1998). Authoritative sources in a hyperlinked environment. In Proceedings of the 9th ACM-SIAM symposium on discrete Algorithms.Google Scholar
- Krichel, T., & Bakkalbasi, N. (2006), A social network analysis of research collaboration in the economics community. In International workshop on webometrics, informetrics and scientometrics & seventh COLLNET meeting, 10–12 May 2006, Nancy, France.Google Scholar
- Milgram, S. (1967). The small world problem. Psychology Today, 2, 60–67.Google Scholar
- Newman, M. E. J. (2004b). Who is the best connected scientist? A study of scientific coauthorship networks. In E. Ben-Naim, H. Frauenfelder, & Z. Toroczkai (Eds.), Complex networks (pp. 337–370). Berlin: Springer.Google Scholar