Abstract
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.
Similar content being viewed by others
References
Albert, R., Jeong, H., & Barabási, A.-L. (2000). Error and attack tolerance of complex networks. Nature, 406, 378–482.
Barabási, A.-L., Albert, R., & Jeong, H. (1999). Mean-field theory for scale-free random networks. Physica A, 272, 173–187.
Barabási, A. L., Jeong, H., Neda, Z., Ravasz, E., Schubert, A., & Vicsek, T. (2002). Evolution of the social network of scientific collaborations. Physica A, 311, 590–614.
Batagelj, V., & Mrvar, A. (1998). Pajek—Program for large network analysis. Connections, 21, 47–57.
Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2, 113–120.
Borokhovich, K. A., Bricker, R. J., & Simkins, B. J. (1994). Journal communication and influence in financial research. The Journal of Finance, 49, 713–725.
Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30, 107–117.
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.
Ding, C., **aofeng, 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.
Freeman, L. C. (1979). Centrality in social networks I: Conceptual clarification. Social Networks, 1, 215–239.
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.
Kleinberg, J. (1998). Authoritative sources in a hyperlinked environment. In Proceedings of the 9th ACM-SIAM symposium on discrete Algorithms.
Kretschmer, H. (2004). Author productivity and geodesic distance in bibliographic co-authorship networks, and visibility on the Web. Scientometrics, 60, 409–420.
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.
Lu, H., & Feng, Y. (2009). A measure of authors’ centrality in co-authorship networks based on the distribution of collaborative relationships. Scientometrics, 81, 499–511.
Milgram, S. (1967). The small world problem. Psychology Today, 2, 60–67.
Newman, M. E. J. (2001a). The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences USA, 98, 404–409.
Newman, M. E. J. (2001b). Scientific collaboration networks: I. Network construction and fundamental results. Physical Review E, 64, 016131.
Newman, M. E. J. (2001c). Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality. Physical Review E, 64, 016132.
Newman, M. E. J. (2004a). Coauthorship networks and patterns of scientific collaboration. Proceedings of the National Academy of Sciences USA, 101, 5200–5205.
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.
Pennock, D., Flake, G. W., Lawrence, S., Glover, E. J., & Giles, C. L. (2002). Winners don’t take all: Characterizing the competition for links on the web. Proceedings of the National Academy of Sciences USA, 99, 5207–5211.
Price, D. J. D. (1976). General theory of bibliometric and other cumulative advantage processes. Journal of the American Society for Information Science, 27, 292–306.
Rousseau, R., & Zhang, L. (2008). Betweenness centrality and Q-measures in directed valued networks. Scientometrics, 75, 575–590.
Shafer, P., Isganitis, T., & Yona, G. (2006). Hubs of knowledge: Using the functional link structure in Biozon to mine for biologically significant entities. BMC Bioinformatics, 7, 71.
Simon, H. A. (1955). On a class of skew distribution functions. Biometrika, 42, 425–440.
Author information
Authors and Affiliations
Corresponding author
Appendix I
Appendix I
Consider a graph G = (V, E) where E is the set of edges connecting vertices defined in vertex set V. The construction of a binary network model (Krichel and Bakkalbasi 2006) based on G requires that each e ij ∈ E encodes the presence or absence of a connection between vertex i and j. For the case of a directed graph: we set the edge weight \( {e_{ij} = 1} \) if a link exists from vertex i to j, and \( {e_{ij} = 0} \) if i and j are unconnected (i ≠ j). For the case of an undirected graph: \( {e_{ij} = e_{ji} = 1} \) if vertex i and j are connected (i ≠ j), while \( {e_{ij} = e_{ji} = 0} \) if unconnected. For both directed and undirected graphs, we set \( {e_{ii} = 0} \) so that G does not contain any loops.
Degree centrality
The degree centrality of vertex v is simply given by the number of edges incident upon it. Suppose that there are n vertices in vertex set V, then the degree centralization is defined by the following formula (Freeman 1979):
Closeness centrality
The closeness centrality of vertex v is defined as the average number of steps required to reach every other reachable vertex in the graph. Specifically, it is the inverse of the mean geodesic distance (length of shortest paths) to/from all the other vertices in the graph, as defined by the following formula (Freeman 1979):
where d(i, j) = distance between vertex i and j.
Betweenness centrality
The betweenness centrality of vertex v is defined as the number of geodesics (shortest paths) on the graph that pass through it. Its value can be computed by the following formula (Freeman 1979):
where σ ij (v) is the number of shortest paths from vertex i to j that pass through v, while σ ij is the number of shortest paths from vertex i to j. The betweenness centralization is given by the betweenness centrality divided by \( {\left( {n - 1} \right)\left( {n - 2} \right)} \) for directed graphs and \( {\frac{1}{2}\left( {n - 1} \right)\left( {n - 2} \right)} \) for undirected graphs.
HITS algorithm: hubs/authorities score
Hyperlink-Induced Topic Search, or HITS (Kleinberg 1998), is a link analysis algorithm originally designed to rank webpages by using the method of eigenvector centrality (Bonacich 1972). HITS assigns two scores to each vertex on graph G: a hub score y i and an authority scorex i . The underlying logic behind the method is that a good authority is cited by many good hubs, while a good hub cites many good authorities. This mutual reinforcement between authority and hub vertices can be represented by two operations I and O. The I operation updates the x-weights (authorities score) as follows.
The O operation updates the y-weights (hubs score) as follows.
In matrix representation, these two operations can be written succinctly as:
By recursively updating the x- and y-weights, the authority and hub scores of each vertex eventually converge at their final values. At the tth iteration, we obtain the following expressions:
The final solutions x*, y* are the principal eigenvectors of L T L (authority matrix) and LL T (hub matrix), which are the singular decomposition of L (Ding et al. 2002). For undirected graphs, L is symmetric and therefore \( {L^{T} L = LL^{T} = L^{ 2} } \) (Shafer et al. 2006).
Rights and permissions
About this article
Cite this article
Fatt, C.K., Ujum, E.A. & Ratnavelu, K. The structure of collaboration in the Journal of Finance. Scientometrics 85, 849–860 (2010). https://doi.org/10.1007/s11192-010-0254-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11192-010-0254-0