You are currently viewing a new version of our website. To view the old version click .
Future Internet
  • Article
  • Open Access

16 June 2022

Co-Authorship Networks Analysis to Discover Collaboration Patterns among Italian Researchers

,
,
and
Dipartimento di Ingegneria Elettrica Elettronica Informatica, Università di Catania, Viale Andrea Doria, 9-95127 Catania, Italy
*
Author to whom correspondence should be addressed.
This article belongs to the Special Issue Collaborative Networks, Decision Systems, Web Applications and Services for Supporting Engineering and Production Management

Abstract

The study of the behaviors of large community of researchers and what correlations exist between their environment, such as grouping rules by law or specific institution policies, and their performance is an important topic since it affects the metrics used to evaluate the quality of the research. Moreover, in several countries, such as Italy, these metrics are also used to define the recruitment and funding policies. To effectively study these topics, we created a procedure that allow us to craft a large dataset of Italian Academic researchers, having the most important performance indices together with co-authorships information, mixing data extracted from the official list of academic researchers provided by Italian Ministry of University and Research and the Elsevier’s Scopus database. In this paper, we discuss our approach to automate the process of correct association of profiles and the mapping of publications reducing the use of computational resources. We also present the characteristics of four datasets related to specific research fields defined by the Italian Ministry of University and Research used to group the Italian researchers. Then, we present several examples of how the information extracted from these datasets can help to achieve a better understanding of the dynamics influencing scientist performances.

1. Introduction

In the last years, the use of bibliometrics [1] gained greater and greater importance in the evaluation of researchers and scientific projects, and it is currently used in several countries (such as Italy) to rank researches and universities, and the attempts at performing this kind of quantitative analysis have often been referred to as “science of science” [2,3,4]. However, the use of citation indexes is quite old as witnessed by pioneering works of Garfield [5] in the 1950s, and de Solla Price [6]. Today, there are several metrics that tries to quantify the quality and impact of researchers [7,8,9,10]. On the other hand, co-authorship networks, i.e., networks where nodes represent scientists and a link between any couple of nodes means the corresponding researchers have co-authored at least a paper, have been extensively studied with the aim of understanding the collaboration patterns among scientists. To approach such a task there are many challenging issues as, for instance, data collection and filtering, definition of domain-specific metrics and algorithms, data visualization, and mining. Co-authorship networks have been widely explored from the perspective of complex networks [11,12], since such representation allows discovering structural and dynamic patterns of scientific collaborations, often hidden, or neglected in the bibliometric approach. Barabási et al. [13] and Newman [14,15] examined the “small-world” and “scale-free” features in the co-authorship networks using the datasets in the disciplines of mathematics, neuro-science, physics, biomedical studies, and computer science. Several works followed the path of these pioneering papers deepening the “scale-free” and “small-world” characteristics [16,17,18] or investigating the mechanisms for the evolution of the co-authorship networks [19,20,21].
The enrichment of co-authorship networks with bibliometrics indices allow studying the characteristics and dynamics of such complex networks. In this work, we discuss why and how we created a co-authorship dataset from the Italian academic context. In particular, each academic working in an Italian university belongs to an academic discipline (i.e., a grouping by topic imposed by law), which is also used for evaluation and career advancement, and we believe that this fact has a strong impact on both bibliometrics and how academic collaborations arise. Here, we selected four academic disciplines (Mathematical Analysis—mat/05, Economics—secs-p/01, Information Processing Systems—ing-inf/05, and Informatics—inf/01) that have almost the same number of researchers but cover different research topics. We built the dataset starting from the profile of Italian researchers and obtaining all the available bibliometrics querying the Scopus database, and we extracted all the bibliometrics up to end of 2021. This paper presents the details of the datasets crafting, such as mapping, solving ambiguity, etc., some preliminary analysis and, finally, a discussion about their characteristics.
The next section briefly summarizes the state-of-the-art, Section 3 deals with method and materials used to create datasets, while Section 4 presents the above-mentioned example and conclusions reports about results, open problems, and further development.

3. Data Collection

The collection of meaningful and useful data is a task with many challenges. When dealing with collaborations among researchers, the key issues come from the multiple data sources and the data not being structured, which translates, for instance, into ambiguous names or duplicate author profiles. In this section, we introduce the data sources and the data-collection methodology used to build the collaboration networks.

3.1. Data Sources

The sources of data used to create the dataset are: the list of researchers employed in Italian public universities provided by Italian Ministry of University and Research (MUR) [35] and the well-known Elsevier’s Scopus database. Data were collected at the end of 2021 and contains all records presents in Scopus and Ministry’s list at the moment. In particular, the former—which is updated daily and provides the profile of the researchers that are employed in the Italian academia—are used as seed data, and the latter are used to retrieve all the researchers’ publications and bibliometrics. As shown in Figure 1, reporting a slice of the data, the information is partially structured, all fields are in Italian language and some of them—such as department or structure—are in free form that do not allow to directly use them to query Scopus. To build a coherent dataset, we build a network starting from the (seed) researchers that belong to a given academic discipline, i.e., the group of people that belong to the research area, as defined by the Italian Law. Specifically, we selected the academic researchers belonging to mat/05 “Mathematical Analysis” (“Analisi matematica”), secs-p/01 “Economics” (“Economia politica”), ing-inf/05 “Information Processing Systems” (“Sistemi di elaborazione delle informazioni”), and inf/01 “Informatics” (“Informatica”). We selected these academic disciplines because they have a similar number of academics that allows performing a thorough analysis in a reasonable amount of time, they are all scientific disciplines and share some research topics, but are significantly different from each other. Moreover, the authors of this paper belong to one of them (ing-inf/05) and, thus, are aware of some of its dynamics, which can help in the analysis of the academics’ habits. Of course, other academic disciplines share these characteristics and would allow to extend the dataset in the future.
Figure 1. Excerpt of data as provided by MUR. Column labels are role, family and given name, gender, university, school, sector, department, or structure, and note about service.
The Elsevier’s Scopus database, according to their fact sheet [28], holds more than 1.8 billion of cited references dating back to 1970, more than 17.6 million of author profiles, and more than 84 million of records. We queried the database using the provided APIs, which expose curated abstracts and citation data from all journals indexed by Scopus, in agreement to their policies [36,37].

3.2. Mapping and Ambiguity

Once chosen the academic disciplines and collected information from both sources we must combine them into a unique dataset that contains the information related to academic discipline and all bibliometrics. Unfortunately, no unique identifier, such as OrcID, is present in Ministry’s list therefore the ambiguity must be resolved using the information related to affiliation (columns Ateneo, the University’s name, and Struttura di appartenenza, the department). Moreover, the Scopus database is built from the information present in published papers and has multiple profiles for the same author (often already linked), homonyms and partial registrations (researchers registered with partial names or omitted information), and each of those issues can lead to the wrong network representation.
The Scopus Search API is organized into three clusters: Affiliation that has Affiliation Profile, Author that contains Author Profiles, and Scopus contains the abstracts and relevant metadata. Searching against Author cluster retrieves the following attributes useful to uniquely identify the author: “dc:identifier” that is the Scopus unique identifier associated with profile, “OrcID” if any, “surname”, “given-name”, and “affiliation” split into name, city and country. Despite the details of information given by the query, there are still some problems in mapping the data from the MUR’s list to a unique Scopus profile. We report the most important ones in the following:
  • The surname and given-name in the Ministry list is always the legal name while the corresponding fields in Scopus may be abbreviated, misspelled, alias, reverted, and incomplete. For instance, Ministry List refer to “Michele Giuseppe Malgeri” while Scopus profile only contains “Michele Malgeri”, some authors have more than one profile that often are not combined, sometimes surname and given-name are inverted, and, of course, several authors with same (or similar) names may exist.
  • The Ministry list affiliation reports the official name of the institution, meaning that the name is always in Italian, while Scopus often contains the abbreviations, acronyms, or the English translation of the University’s name. Of course, again, misspelling and typos may be always present.
  • Spaces, stippling, national characters (e.g., the use of accented vocals).
  • Authors during their activity may change affiliation several times, therefore multiple profile could be present.
To face the problems connected with misspelling, stippling, and typos, before the processing each name is cleaned removing all punctuation, unnecessary spaces, and mapping national characters, if any, to a normalized form. Comparisons are performed using the Levenshtein distance [38]. The prepare_queries setups the set of queries using the author’s surname and the shuffle of the given name (if more than one) and the initials of the name, for instance “Malgeri Michele Giuseppe”, where the surname is “Malgeri”, generates the queries listed in Listing 1:
Listing 1. List of queries generates by Malgeri Michele Giuseppe. If they fail third condition about affiliation is discarded and queries will be repeated.
Futureinternet 14 00187 i001
We describe the algorithm used to search for the Scopus profile of Italian researchers from the Ministry’s list in Algorithm 1. Please note that, for sake of simplicity, the algorithm does not include the use of the researcher’s affiliation and the validation of data, which is performed when few matches are found.
Algorithm 1 Searching for a matching profile between Ministry’s list and Scopus Authors’ cluster.
  • proceduresearch_for_author(profile)
  •     matches ← []
  •     queriesprepare_queries(profile)
  •     for all queryqueries do
  •         resultsearch_against_Author_Cluster(query_string)
  •         if surname == result.surname then
  •            result.distanceLevenshtein_distance(pro f ile.given_name, result.givenname)
  •            append(match, result)
  •         end if
  •     end for
  •     if match ≠ ∅ and min(distance) < threshold then
  •         return(Found)
  •     else
  •         return(Failed)
  •     end if
  • end procedure
Table 1 reports the dimension of data from Ministry’s list and the relative consolidated data. Let us note that, by law, a researcher, at a given time, must belong to one academic discipline, therefore, we use that value from Ministry’s list. The last column reports the percentage of authors that could not be associated to any Scopus profile either because of failed disambiguation or because the author is not even present in the database. Let us also note that, while it may be possible to recover some of the missed profiles, for instance by manually inserting the researcher’s OrcID or Scopus identifier, we simply discard these few records since the error introduced not affect significantly the dataset being created.
Table 1. The results of searching and mapping.

3.3. Making the Coauthorship Network

After matching and recovering the profile of Italian academic researchers from the MUR’s list, the next step is to retrieve the publication list of each of them and build the co-authorship networks. Specifically, we build a network for each of the “academic disciplines” (SSDs) under study, where nodes are researchers and links among them represent collaborations. More in detail, given two nodes u and v, the edge ( u , v ) represents the fact that researchers u and v have co-authored a paper. We enrich the networks with bibliometrics about the researchers (such as H-index, number of published documents, of citations and of co-authors, Years of activity, etc.) from the Scopus’ database, and also associate the number of co-authored papers as the edge weight w ( u , v ) .
Although the algorithm used to obtain the publications and build the networks is quite trivial, it must be optimized to reduce the number and the complexity of the queries to avoid filling the query quotas provided by Elsevier and avoid throttling. Please note that such queries were performed against the Scopus cluster instead of Scopus Author because the information about each publication is useful for further processing and verification. Let us also note that, to reduce the number of API calls, we query 25 documents with each call, and we cache result to avoid to repeat a query.
The algorithm, described in Algorithm 2, was executed three times to explore the co-authorship at different “depths”, that is, the maximum number of hops from the seed nodes to explore:
  • Depth-zero: that is the co-authorship of Italian researchers only, i.e., it contains only vertices that belong to Ministry’s list.
  • Depth-one: in this step we added only authors that have direct connections with Italian researchers.
  • Depth-two: starting from deep-two we also included the co-authors of co-authors (’two’ means that we stopped the deep first search at the second step).
Of course, depth-two network contains depth-one that, in turn, contains depth-zero.
Algorithm 2 Deep first search of common publications.
  • procedureCreate_Coauthorship(author_list)
  •     vertices ← []
  •     edges ← []
  •     for all authorauthor_list do
  •         if authorvertices then
  •            append(vertices, author)
  •         end if
  •         resultsearch_against_Scopus_Cluster(authors)  ▹ search for all author’s documents
  •         for all documentresult do
  •            for all coauthor ∈ extract_authors(result) do  ▹ extracts list of authors from result
  •                if (author, coauthor) ∉ edges then
  •                     append(edges, (author, coauthor))
  •                    weight((author, coauthor)) ← 1
  •                     append(document, seto f _documents((author, coauthor)))
  •                else if documentseto f _documents((author, coauthor)) then
  •                    weight((author, coauthor)) = weight((author, coauthor)) + 1)
  •                end if
  •            end for
  •         end for
  •     end for
  • end procedure

4. Inside the Data

In this section, we briefly analyze the topology of 12 networks (built as described in the previous section) and the bibliometrics of the authors, and highlight some characteristics of the collected samples.

4.1. Structure of the Networks

As detailed in the previous sections, we have built the co-authorship networks using the list of Italian academic researchers from four different “academic disciplines” as seeds: for each discipline, we build three subnetworks where we include all the researchers separated by up to one, two, or three degrees of collaborations. As shown in Table 2, reporting the number of nodes and edges of the three datasets, the networks built at different depths have different size. This is expected, since the networks may also include researchers from other institutions or countries. We also extract the Giant Connected Component (GCC, also known as Largest Connected Component, LCC) of the networks, i.e., the largest cluster of connected nodes, capturing the largest group of researchers that have a finite degree of separation from each other. The sizes of such components are shown in Table 3.
Table 2. Italian co-authorship networks size of the academic disciplines under analysis.
Table 3. Giant Connected Components size of the Italian co-authorship networks of the academic disciplines under analysis.
We also plot the GCC of the depth-one networks (for the sake of readability, as the larger networks would be unintelligible) in Figure 2 that highlights the Italian researchers. Let us note that the co-authorship networks of ing-inf/05 and inf/01 disciplines show similar collaboration patterns, which is expected considering the large overlap in research interests and topics between them.
Figure 2. These figures highlight the core of co-authorship networks (orange/clear) with respect to direct coauthors (blue/darker).
In Table 4, we report some topological characteristics of the depth-two networks, describing their size, edge density, and connection patterns. As the Reader may notice, although the computer science-related fields have comparable size, the networks show a very different number of nodes and edges among academic fields. On the other hand, the average degree, strength, and link weight are comparable. Another interesting difference among the disciplines is in the average local clustering coefficient and in the transitivity, which shows that the researchers in computer science-related fields are more prone to collaborate. We also compute the degree and strength assortativity, as defined in [39,40].
Table 4. Characteristics of the Largest Connected Component of the Depth 1 networks.

4.2. Bibliometrics

In this Subsection, we analyze the bibliometrics associated to the authors. Figure 3 represents the depth-0 networks with a node and edge size proportional to the author’s H-index and number of coauthored publications, respectively. Such figures allow to appreciate that relevant nodes are often heavily connected, i.e., they are hubs, and also the different habits and policies of the academic disciplines is clearly show by this representation: researchers in the secs-p/01 discipline collaborate with other Italian researchers belonging to the same discipline less than others, which also translates into a larger number of small Connected Components; mat/05 shows a very small core with a sort of “tail”, a chain of collaborations; inf/01 and ing-inf/05 exhibit a large core and a far denser collaboration network.
Figure 3. Italian academics’ co-authorship networks at depth-0. Vertices and edge widths are proportional to the author’s H-index edge weights, respectively. The Giant Connected Component colored in orange/clear. For sake of readability, the nodes with degree d i < 5 have been filtered out.
The distributions of the most relevant bibliometrics indices contained in the dataset are shown in Figure 4 with darker color standing for larger density. Again, a strong similarity can be observed between computer science-related fields, while the economics and mathematical analysis disciplines show different distributions. For instance, the H-index range is wider in the ing-inf/05 and inf/01 than the other disciplines, and the distribution is fat-tailed. Regarding the number of documents, of citations and of coauthors the distributions of inf/01 and secs-p/01 show a very dense area around small value. On the other hand, number of years activity is similar across all disciplines.
Figure 4. Distribution of some bibliometric indices in the academic disciplines.
Another interesting analysis that could be performed on the networks is related to the “Science of Success”. Here, we show, in Figure 5, the correlation between H-index and some indices. More specifically, the figure plots the relation between H-index and the other features in the four dataset using a linear model regression and a confidence interval. Table 5 shows the Pearson product-moment correlation coefficient between H-index and the other features in the four dataset. Once again, the table highlights a very strong overlap of ing-inf/05 and inf/01 disciplines for all the bibliometric indices whilst the Pearson’s correlation of secs-p/01 is markedly different.
Figure 5. Correlation among H-index and bibliometric indices in the academic disciplines, from left to right academic disciplines are: mat/05, secs-p/01, ing-inf/05, and inf/01.
Table 5. Pearson’s correlation among H-index and bibliometric indices in the academic disciplines.

4.3. Multidisciplinarity

In this subsection, we aim at answering the following questions: do researchers belonging to different academic disciplines work together? and does the grouping imposed by the Italian law affect the collaboration patterns among researchers? To do so, we merge the networks of the different disciplines together and show the resulting networks in Figure 6.
Figure 6. Co-authorship network of the four academic disciplines (ing-inf/05 dark orange, inf/01 cyan, mat/05 is orange, and secs-p/01 is violet).
At first, we limit the analysis to the depth-zero networks Figure 6a, which only include Italian academic researchers. As shown in the plot, the number of collaborations across the disciplines under study is very low. More in detail, there is almost no cooperation between researchers in mat/05, secs-p/01, and the computer-science related ones, while researchers ing-inf/05 and inf/01 have coauthored more papers, which is expected since the strong overlap in the research topics [44]. We later extend the networks by including the direct coauthors, i.e., by merging the depth-one networks. The resulting network, depicted in Figure 6b, shows that there is some (indirect) collaboration among groups, and a very strong overlap in the groups of inf/01 and ing-inf/05. (Let us note that in depth-1 and depth-2 some authors can be coauthors of researchers belonging to different academic disciplines, so they are present in both networks; we represent them as blue points). By merging the networks at depth-two, the size of the largest cluster grows a lot, which shows that other researchers (e.g., researchers from the same field but working for private institutions or living abroad) bridge the various groups. Please note that we omit the resulting figure since the network would be too large and dense.

5. Conclusions

The collaboration patterns among researchers, and also their relation to higher performance metrics are widely investigated problems, with applications, for instance, in the science of success. In this work, we propose and briefly study a new dataset of collaboration among Italian academic researchers. In particular, we first describe the data-collection process, the challenges and the solution to various problems. Then, we build and analyze the collaboration networks, in search of the different characteristics of four different academic disciplines (groups of researchers defined by the Italian law), however we mainly focused on the approach to build the datasets giving some example of the analysis that could be completed leaving explanation of the results to further works. Our results show similar collaboration patterns among researchers of computer science-related fields (ing-inf/05 and inf/01) and, even if with a limited extent, collaborations among them. On the other hand, researchers from Economics (secs-p/01) and Mathematical analysis (mat/05), tend to collaborate less with other Italian colleagues.

5.1. Discussion

In this section we provide a brief discussion on contribution of this paper that mainly lies in the datasets and their features, the analysis of them have the purpose to inspire further researches aiming at both studying this specific co-authorship with a well established approach and to explore new approaches, such us the use of the network science tools, to understand hidden mechanism that drive the behavior of scientist communities.
The creation of new dataset represents an important contribution itself, however, it must cover a real world case that exploits some new characteristics and creation strategies to add to previous studies. The case described in this paper has the following peculiarities:
  • The scientist community is stable and well-defined since it is defined by law;
  • The four dataset share some characteristics (scientific/technical topics, publication areas) but have different publication policy (e.g., number of authors, type of contribution);
  • The algorithm, as discussed, can be used to easily extract more academic disciplines in a reasonable time;
  • Almost all problems dealing with ambiguity and wrong classification has been solved (the error are ≈5%, of course, the error can be reduced by human involvement, but it does not modify the structure of co-authorship network;
Measuring the performance of scientist using performance indices, such us bibliometrics, is widely debated but, since it is adopted by more and more institution any contribute that study the correlation between network structure and bibliometrics, if any, permit defining more correct policies (such as recruitment policies) or limit abuses (e.g., publishing “salami slices” with similar methods and slightly different results). However, the exploratory examples of analysis provided in this paper simply aim at validating the datasets and show its effectiveness in highlight specific characteristics.

5.2. Future Works and Limitations

Future works may involve enriching and improving the dataset, for instance, by extending the groups analyzed either to other academic disciplines or to more collaboration hops. Moreover, further analysis can be performed, for example, with data science and network science approaches. Finally, an attempt to explain both the internal behaviors and the difference among academic disciplines is a further step in the comprehension of some dynamics and could lead to understand why some people are more successful than others.
The dataset, since covers several years and long-lasting collaborations could be used to explore the trust relationship among scientists and the impacts of aging [45], or strategies and the cost to build strong communities [46].
The dataset proposed in this paper, as well as the proposed analysis, does not include any studies on the content of the co-authored paper and on the different contribution of each author (if any are documented). Some additional features, present in Scopus DB, such as abstracts and keywords using text analytic techniques [47], could allow searching for very similar publication, and, for instance, to evaluate the impact in bibliometrics but also in co-authorship. However, the dataset contains all information useful to enhance and complete the included information since it includes most of the unique key universally adopted (e.g., OrcID, Scopus-id) that can be used to query both Scopus itself and other archives.

Author Contributions

The authors contributed equally to each stage of this work. All authors have read and agreed to the published version of the manuscript.

Funding

This work has been partially supported by the project of University of Catania PIACERI, PIAno di inCEntivi per la RIcerca di Ateneo.

Data Availability Statement

The networks analyzed in this study were derived from Elsevier’s Scopus DB and are available upon request.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Li, W.; Aste, T.; Caccioli, F.; Livan, G. Early coauthorship with top scientists predicts success in academic careers. Nat. Commun. 2019, 10, 5170. [Google Scholar] [CrossRef] [PubMed]
  2. Zeng, A.; Shen, Z.; Zhou, J.; Wu, J.; Fan, Y.; Wang, Y.; Stanley, H.E. The science of science: From the perspective of complex systems. Phys. Rep. 2017, 714, 1–73. [Google Scholar] [CrossRef]
  3. Clauset, A.; Larremore, D.B.; Sinatra, R. Data-driven predictions in the science of science. Science 2017, 355, 477–480. [Google Scholar] [CrossRef] [Green Version]
  4. Fortunato, S.; Bergstrom, C.T.; Börner, K.; Evans, J.A.; Helbing, D.; Milojević, S.; Petersen, A.M.; Radicchi, F.; Sinatra, R.; Uzzi, B.; et al. Science of science. Science 2018, 359, eaao0185. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  5. Garfield, E. Citation indexes for science: A new dimension in documentation through association of ideas. Science 1955, 122, 108–111. [Google Scholar] [CrossRef]
  6. Price, D.J.D.S. Networks of scientific papers: The pattern of bibliographic references indicates the nature of the scientific research front. Science 1965, 149, 510–515. [Google Scholar] [CrossRef]
  7. Elkana, Y. Toward a Metric of Science; Wiley: Hoboken, NJ, USA, 1978. [Google Scholar]
  8. Hirsch, J.E. An index to quantify an individual’s scientific research output. Proc. Natl. Acad. Sci. USA 2005, 102, 16569–16572. [Google Scholar] [CrossRef] [Green Version]
  9. Lehmann, S.; Jackson, A.D.; Lautrup, B.E. Measures for measures. Nature 2006, 444, 1003–1004. [Google Scholar] [CrossRef] [PubMed]
  10. Garfield, E. The history and meaning of the journal impact factor. JAMA 2006, 295, 90–93. [Google Scholar] [CrossRef]
  11. Watts, D.J.; Strogatz, S.H. Collective dynamics of ‘small-world’networks. Nature 1998, 393, 440–442. [Google Scholar] [CrossRef]
  12. Barabási, A.L.; Albert, R. Emergence of scaling in random networks. Science 1999, 286, 509–512. [Google Scholar] [CrossRef] [Green Version]
  13. Barabâsi, A.L.; Jeong, H.; Néda, Z.; Ravasz, E.; Schubert, A.; Vicsek, T. Evolution of the social network of scientific collaborations. Phys. A Stat. Mech. Its Appl. 2002, 311, 590–614. [Google Scholar] [CrossRef] [Green Version]
  14. Newman, M.E. Scientific collaboration networks. I. Network construction and fundamental results. Phys. Rev. E 2001, 64, 016131. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  15. Newman, M.E. Coauthorship networks and patterns of scientific collaboration. Proc. Natl. Acad. Sci. USA 2004, 101, 5200–5205. [Google Scholar] [CrossRef] [Green Version]
  16. Liu, X.; Bollen, J.; Nelson, M.L.; Van de Sompel, H. Co-authorship networks in the digital library research community. Inf. Process. Manag. 2005, 41, 1462–1480. [Google Scholar] [CrossRef] [Green Version]
  17. Tomassini, M.; Luthi, L. Empirical analysis of the evolution of a scientific collaboration network. Phys. A Stat. Mech. Its Appl. 2007, 385, 750–764. [Google Scholar] [CrossRef]
  18. Franceschet, M. Collaboration in computer science: A network science approach. J. Am. Soc. Inf. Sci. Technol. 2011, 62, 1992–2012. [Google Scholar] [CrossRef]
  19. Powell, W.W.; White, D.R.; Koput, K.W.; Owen-Smith, J. Network dynamics and field evolution: The growth of interorganizational collaboration in the life sciences. Am. J. Sociol. 2005, 110, 1132–1205. [Google Scholar] [CrossRef] [Green Version]
  20. Chandra, A.K.; Hajra, K.B.; Kumar Das, P.; Sen, P. Modeling temporal and spatial features of collaboration network. Int. J. Mod. Phys. C 2007, 18, 1157–1172. [Google Scholar] [CrossRef] [Green Version]
  21. Evans, T.; Lambiotte, R.; Panzarasa, P. Community structure and patterns of scientific collaboration in business and management. Scientometrics 2011, 89, 381–396. [Google Scholar] [CrossRef] [Green Version]
  22. Carchiolo, V.; Grassia, M.; Malgeri, M.; Mangioni, G. Analysis of the Co-authorship Sub-networks of Italian Academic Researchers. Stud. Comput. Intell. 2022, 1015, 321–327. [Google Scholar] [CrossRef]
  23. Hâncean, M.G.; Perc, M.; Lerner, J. The coauthorship networks of the most productive European researchers. Scientometrics 2021, 126, 201–224. [Google Scholar] [CrossRef]
  24. Carchiolo, V.; Grassia, M.; Malgeri, M.; Mangioni, G. Preliminary Characterization of Italian Academic Scholars by Their Bibliometrics. In Intelligent Distributed Computing XIV; Camacho, D., Rosaci, D., Sarné, G.M.L., Versaci, M., Eds.; Springer International Publishing: Cham, Switzerland, 2022; pp. 343–354. [Google Scholar]
  25. Baji, F.; Mostafavi, I.; Parsaei-Mohammadi, P.; Sabaghinejad, Z. Partnership ability and co-authorship network of information literacy field. Scientometrics 2021, 126, 8205–8216. [Google Scholar] [CrossRef]
  26. Parish, A.J.; Boyack, K.W.; Ioannidis, J.P. Dynamics of co-authorship and productivity across different fields of scientific research. PLoS ONE 2018, 13, e0189742. [Google Scholar] [CrossRef]
  27. Xie, Z. A distributed hypergraph model for simulating the evolution of large coauthorship networks. Scientometrics 2021, 126, 4609–4638. [Google Scholar] [CrossRef]
  28. Scopus Fact Sheet. Available online: https://www.elsevier.com/__data/assets/pdf_file/0017/114533/Scopus-fact-sheet-2022_WEB.pdf (accessed on 30 April 2022).
  29. Web of Science: Welcome. Available online: https://clarivate.libguides.com/home (accessed on 30 April 2022).
  30. Google Scholar. Available online: https://scholar.google.com/ (accessed on 30 April 2022).
  31. Molontay, R.; Nagy, M. Two Decades of Network Science: As Seen through the Co-Authorship Network of Network Scientists. In Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Vancouver, BC, Canada, 27–30 August 2019; pp. 578–583. [Google Scholar] [CrossRef] [Green Version]
  32. Di Bella, E.; Gandullia, L.; Preti, S. Analysis of scientific collaboration network of Italian Institute of Technology. Scientometrics 2021, 126, 8517–8539. [Google Scholar] [CrossRef]
  33. Pradhan, B.; Sahoo, S.; Padhan, A. A Scientometrics Study of Research Productivity of VSS University of Technology (VSSUT) as Reflected in Scopus Database during 2015–2020. Libr. Philos. Pract. 2021, 1–14. Available online: https://www.proquest.com/openview/a13e015440804a2138394f8dc36a68b4/1?pq-origsite=gscholar&cbl=54903 (accessed on 30 April 2022).
  34. Fujita, Y.; Vitevitch, M. Using network analyses to examine the extent to which and in what ways psychology is multidisciplinary. Humanit. Soc. Sci. Commun. 2022, 9, 168. [Google Scholar] [CrossRef]
  35. Ministero dell’Universit’a e delle Ricerca (MUR). Professori e Ricercatori. Available online: https://www.miur.it/0002Univer/0030Profes/index_cf2.htm (accessed on 30 April 2022).
  36. Elsevier. Elsevier Developer—Academic Research. Available online: https://dev.elsevier.com/api_service_agreement.html (accessed on 30 April 2022).
  37. Elsevier. Elsevier Developer—API Service Agreement. Available online: https://dev.elsevier.com/academic_research_scopus.html (accessed on 30 April 2022).
  38. Navarro, G. A Guided Tour to Approximate String Matching. ACM Comput. Surv. 1999, 33, 2001. [Google Scholar] [CrossRef]
  39. Squartini, T.; Fagiolo, G.; Garlaschelli, D. Randomizing world trade. I. A binary network analysis. Phys. Rev. E 2011, 84, 046117. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  40. Squartini, T.; Fagiolo, G.; Garlaschelli, D. Randomizing world trade. II. A weighted network analysis. Phys. Rev. E 2011, 84, 046118. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  41. Newman, M.E.J. The Structure and Function of Complex Networks. SIAM Rev. 2003, 45, 167–256. [Google Scholar] [CrossRef] [Green Version]
  42. Seidman, S.B. Network structure and minimum degree. Soc. Netw. 1983, 5, 269–287. [Google Scholar] [CrossRef]
  43. Batagelj, V.; Zaveršnik, M. Fast algorithms for determining (generalized) core groups in social networks. Adv. Data Anal. Classif. 2011, 5, 129–145. [Google Scholar] [CrossRef]
  44. Ministero Dell’Istruzione (MIUR). Declaratorie dei Settori Concorsuali. Available online: http://attiministeriali.miur.it/media/174801/allegato%20b_def.pdf (accessed on 30 April 2022).
  45. Carchiolo, V.; Longheu, A.; Malgeri, M.; Mangioni, G. Searching for experts in a context-aware recommendation network. Comput. Hum. Behav. 2015, 51, 1086–1091. [Google Scholar] [CrossRef]
  46. Carchiolo, V.; Longheu, A.; Malgeri, M.; Mangioni, G. The cost of trust in the dynamics of best attachment. Comput. Inform. 2015, 34, 167–184. [Google Scholar]
  47. Correa, E.A., Jr.; Silva, F.N.; da F. Costa, L.; Amancio, D.R. Patterns of authors contribution in scientific manuscripts. J. Inf. 2017, 11, 498–510. [Google Scholar] [CrossRef] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.