Identifying Key Opinion Leaders in Evolving Co-authorship Networks—A Descriptive Study of a Proxy Variable for Betweenness Centrality

Part of the Studies in Computational Intelligence book series (SCI, volume 644)


Many researchers identify influentials in a network by their betweenness centrality. Whereas betweenness centrality can be calculated in small, static, connected networks, its calculation in complex, large, evolving networks frequently causes some problems. Hence, we propose a proxy variable for a node’s betweenness centrality that can be calculated in large, evolving networks. We illustrate our approach using the example of Key Opinion Leader (KOL) identification in an evolving co-authorship network of researchers who have published articles about PCSK9 (a protein that regulates cholesterol levels).

1 Introduction

The analysis of complex networks has become one of the main research topics in contemporary computer science. The analysis of evolving networks has been a particular focus of attention (see [1] for a literature review). In this context, one main research question has been to identify the most important nodes (hubs, influentials) in a network. One of the most prominent measures of a node’s importance in a network is a node’s betweenness centrality [12].

Whereas a node’s betweenness centrality can be calculated in small, static, connected networks, the calculation of a node’s betweenness centrality in complex, large, evolving networks frequently causes some problems. For example, betweenness centrality can be calculated in connected graphs only. However, the early evolutionary stages of a network are often characterised by a few edges and nodes. Consequently, the corresponding graph consists of many disconnected components (compare [17]), and the measure of betweenness centrality is either undefined (at the whole network level) or can be calculated separately for each of the unconnected components only. Furthermore, calculating betweenness centrality is computationally too costly to allow for dynamic analyses in large networks (compare [10, 18] for the execution times of betweenness centrality calculations on commodity machines).1

Nevertheless, many application scenarios require some knowledge about the nodes’ betweenness centrality in the (early) evolutionary stages of a network. Therefore, in this paper we propose a proxy variable for a node’s betweenness centrality that can also be calculated in the early evolutionary stages of a network and that allows for dynamic analyses.

We illustrate our approach using the example of key opinion leader (KOL) identification in PCSK9 research (see Sect. 3, Data). KOLs are physicians and researchers who influence the treatments prescribed by their peers. Pharmaceutical enterprises spend considerable time and effort identifying KOLs and maintaining a good relationship with them. However, to best build relationships, pharmaceutical enterprises have to identify KOLs in the early stages of the emergence of a new research field and track their importance over time. We suppose that KOLs can be identified through their embeddedness in a co-authorship network. In the network, authors serve as nodes, and a tie is assumed between two authors who have co-authored a publication (compare, for example, [20, 21]).

To summarise, our paper has two research objectives. Our main objective is to answer the research question of whether there is a proxy variable for the KOLs’ betweenness centrality that can also be calculated in the (early) evolutionary stages of a co-authorship network. However, to answer this question, we first have to identify who the researchers/KOLs are that have the highest betweenness centrality in the PCSK9 co-authorship network.

The remainder of this paper is structured as follows. The next section reviews the related literature. Section 3, Data, introduces the dataset used for our analyses. Section 4 presents our analyses. The last section, Discussion, addresses the theoretical and managerial implications of our work, notes the limitations of this study, and points to further research.

2 Related Work

In this literature review, we particularly focus on two streams of thought. The first is literature about evolutionary network analysis in computer science. An extensive literature review about this kind of work can be found in a recent paper by Aggarwal and Subbian [1]. Hence, a review about this kind of work is beyond the scope of this paper.

The second stream of thought is research that analyses scientific co-authorship by the means of network analysis (e.g. [20, 21, 23]). In this context, it is particularly interesting to highlight papers that examine the evolution of a co-authorship network. For example, Barabási et al. [5] analyse in a seminal paper the small world properties of an evolving co-authorship network (i.e. they examine whether the network has a larger clustering coefficient [28] than expected for a random network and a small average separation/shortest-path-length).

Backstrom et al. [2] examine how communities/groups develop and evolve in networks using data from DBLP.2 They are particularly interested in determining who will join which community in the future and how people and topics move between communities.

Also, Franceschet [11] uses data from DBLP for his analyses, in which he distinguishes between the author-paper affiliation network and the (author) collaboration network. Whereas the author-paper affiliation network is a bipartite graph with two types of nodes (authors and papers (and an edge from an author to a paper if the author has written the paper)), the

collaboration network is an undirected graph obtained from the projection of the author paper affiliation network on the author set of nodes. Nodes of the collaboration network represent authors and there is an edge between two authors if they have collaborated in at least one paper

(p. 1995). Like Franceschet [11], we focus on the authors’ collaboration network in this paper.

Although the collaboration network is a coarser representation with respect to the affiliation network ... [it] is highly informative since many collaboration patterns can be captured by analyzing this form of representation

([11, p. 1995]). For example, Franceschet [11] analyses the temporal evolution of the connectivity of the collaboration network, the distribution of the number of scholar collaborators, network clustering, the average separation distance among scholars, as well as assortativity by the number of collaborators. He finds that the network is a widely connected small world. Furthermore, he finds the distribution of collaboration among scholars to be highly skewed and concentrated (i.e. there are a few highly productive collaborators responsible for a relatively high share of collaborations). However, he finds the network to be resilient to the removal of these highly productive collaborators.

Liu and Xia [17] examine the structure and evolution of the co-authorship network in the interdisciplinary field of “evolution of cooperation”. They illustrate how small clusters evolve into a giant component that can be considered as a small-world network.

Whereas most of the studies presented above focus on network topology and macro-level network properties (such as diameter, distance, components, clustering coefficient etc.) [29], Yan and Ding [29] take a different approach by studying micro-level network properties (i.e. centrality measures). Specifically, they examine how authors’ centrality measures change over time. Yan and Ding’s [29] study is probably the one the most related to our research.

Finally, Yang et al. [31] infer a node’s future centrality in a network by a Node Prominence Profile (NPP). They base the NPP on the principles of preferential attachment [4] and triadic closure [14]. However, in their study, Yang et al. [31] focus on degree centrality. In this work, we intend to infer a node’s betweenness centrality from a single, easily available proxy variable.

3 Data

To analyse KOLs in an evolving complex network, we analysed the co-authorship network of researchers who published an article about PCSK9.3 In the network, authors serve as nodes of the network, and a tie is assumed between two authors who have co-authored at least one publication. To obtain this network, we searched the PubMed/MEDLINE database4 for all articles that contain the phrase “PCSK9” in any search field. PubMed/MEDLINE is a comprehensive scholarly bibliographic database maintained by the United States National Library of Medicine that also has been used in comparable research (e.g. [23]).

The decision to analyse the PSCK9 network was taken as we wanted to analyse a network with several thousand nodes only to ensure a high data quality and a clear boundary specification of the network (compare [26] for additional advantages of studying a collaboration network of this size). In total, 952 articles were retrieved from the Pubmed/MEDLINE database. These articles were reported to have been written by 4213 authors. (Two of the articles did not provide any authorship information). Since PubMed did not provide a unique researcher ID for many authors, we manually checked the data for inconsistencies. Indeed, many names that were recognised as belonging to different individuals by our system in fact belonged to the same individual. In most of these cases, an author used her or his initial for some of the publications but not others (e.g. we assumed that the names “Abdiche, Yasmina” and “Abdiche, Yasmina N” belong to the same individual; compare [29] for this procedure). After data cleansing, 3905 authors remained in the database.

The average author of these 3905 authors has written 1.742 articles about PCSK9. This number seems rather low. For example, Yan and Ding [29] find in their co-authorship analyses that the average author in the field of “library and information science” has written 2.4 articles. Newman [22] finds numbers between 2.55 and 11.6 articles for different research domains. The low number in the case of PCSK9 research can be explained by the fact that PCSK9 is a rather new, narrow research field and authors also publish papers about different research subjects.

In contrast, the average PCSK9 article has been written by 7.14 authors. This number seems rather high. In comparison, Yan and Ding [29] report that the average article in the field of library and information science has 1.8 authors. Newman [22] finds numbers between 1.99 (for the field of theoretical high-energy physics) and 8.96 authors per paper (for the field of high energy physics in general). The high number of 7.14 in the case of biomedical research can be explained by the fact that experimental bio-medical research requires a large group of collaborators (similar to those of experimental high-energy physics). For example, large scale clinical trials are conducted by more than 100 people. In this context, the PubMed/MEDLINE database contains a single PCSK9 paper with 186 authors. (However, this number is still low compared with experimental high-energy physics for which Newman [22] reports a single paper with 1,681 authors.)

The articles about PCSK9 were written between 1993 and 2015. However, only a single article about PCSK9 was published in 1993 and none was published between 1994 and 2003. Table 1 lists the number of articles published per year.
Table 1

Number of articles per year


Number of articles


Number of articles





























4 Analyses

Using this data sample, we calculated a series of network statistics (including betweenness centrality) for all authors in the network using the R libraries “sna” [8] and “igraph” [9], as well as the software Gephi 0.8.2 beta.5 During the analyses, we aggregated the network from year to year, which means we assumed that a tie between two authors who co-authored a paper in the past endured till the year of analysis (and was not resolved).6 Consequently, we studied the cumulative network structure in one-year intervals (i.e. the network from 1993 to 2003, the network from 1993 to 2004, the network from 1993 to 2005, and so on) (compare [17]). This approach is also taken by most comparable studies (e.g. [26]).

However, also in 2015 (the last year of our analyses), the network consisted of several components, and it is not meaningful to compare the authors’ betweenness centrality scores between components of different size.7 Therefore, we decided to focus our further analyses on all authors that belong to the main component of the network in 2015.8 The main component of the network comprised 2,836 authors (i.e. 72.62 % of all authors).9 Between these authors were 43,183 edges (i.e. 91.21 % of all edges). Focusing on the main component of a network for further analyses is a valid approach taken by many comparable studies (e.g. [19, 29]).
Table 2

Top-Authors by betweenness centrality


Betweenness centrality


Betweenness centrality

Seidah Nabil G


Wasserman Scott M


Rader Daniel J


Hovingh G Kees


Robinson Jennifer


Boileau Catherine


Humphries Steve E


Zelcer Noam


Boerwinkle Eric


Jukema J Wouter


Kathiresan Sekar


Park Sahng Wook


Lambert Gilles


Horton Jay D


Thompson John R


Cariou Bertrand


Konrad Robert J


Stein Evan A


Davis Harry R Jr


Ballantyne Christie M


Kastelein John J P


Averna Maurizio


Chen Wei


Rabes Jean-Pierre


Hubbard Brian


Table 2 shows the 25-top-authors of this main component by their betweenness centrality. Interviews with managers responsible for PCSK9 from the pharmaceutical industry confirmed that most of these authors are among the most influential people in PCSK9 research.10

The main research question of this paper was whether these authors can be identified in the early evolutionary stages of a network by taking a variable as a proxy for the authors’ betweenness centrality in the future.

In this paper, we propose the number of an author’s unclosed triads as a proxy for her or his betweenness centrality. Figure 1 illustrates an unclosed triad. In the unclosed triad, author A has published a paper jointly with node B and another paper jointly with node C. However, node B and node C have not published any paper together. Hence, node A lies between nodes B and C and should have a high betweenness centrality in the final network.11
Fig. 1

Unclosed triad

Table 3

Spearman correlation between the number of an author’s unclosed triads and this author’s betweenness centrality in 2015


Spearman’s rho


Spearman’s rho





























Table 3 illustrates Spearman’s [25] rank correlation coefficients between the author’s betweenness centrality in 2015 and the number of an author’s unclosed triads in the respective years. It is defined as
$$\begin{aligned} \rho = \frac{\sum (rk(BC_i)-\overline{rk_{BC}})(rk(UT_i)-\overline{rk_{UT}})}{\sqrt{\sum (rk(BC_i)-\overline{rk_{BC}})^2} \sqrt{(rk(UT_i)-\overline{rk_{UT}})^2}} \end{aligned}$$

is the rank of author i’s betweenness centrality,


is the rank of author i’s number of unclosed triads,


is the mean rank of all betweenness centrality scores, and


is the mean rank of all number of unclosed triads.

  We decided to use Spearman’s rho instead of Pearson’s correlation coefficient since we expected the association between betweenness centrality and the number of an author’s unclosed triads to be monotonic, but did not want outliers or a nonlinear relationship to bias the results. However, we are aware that we lose some information by treating interval-scaled variables as ordinal.

Since there was only a single publication by two authors between 1993 and 2002, a calculation of Spearman’s rho for these years is not meaningful. Also the correlation coefficient for 2003 should be viewed with caution as there were only two publications about PCSK9 in 2003. However, for the remaining years, Spearman’s rho indicates a strong to very strong correlation between the author’s betweenness centrality in 2015 and the number of the author’s unclosed triads in the respective years.

As betweenness centrality and degree centrality are thought to be highly correlated (e.g. [24]), one might argue that an author’s degree centrality is a more convenient proxy variable for an author’s betweenness centrality than the number of this author’s unclosed triads. However, we calculated the correlation between an author’s degree centrality and this author’s betweenness centrality in 2015 (see Table 4).
Table 4

Spearman correlation between an author’s degree centrality and this author’s betweenness centrality in 2015


Spearman’s rho


Spearman’s rho




























By comparing Tables 3 and 4, one can see that the correlation coefficients between an author’s number of unclosed triads and this author’s betweenness centrality are much higher than those between an author’s degree centrality and this author’s betweenness centrality.12 Hence, we can conclude that the number of an author’s unclosed triads is a better proxy variable for this author’s betweenness centrality than her or his degree centrality.

Although we found that the number of an author’s unclosed triads is a good proxy for her or his betweenness centrality in the PCSK9 co-authorship network, this might possibly be a peculiarity of our dataset.

To ensure that the number of an actor’s unclosed triads is generally a good proxy for her or his betweenness centrality, we generated a) 100 random Erds-Renyi networks, b) 100 scale-free (Barabási-Albert) networks with a power exponent of \(\gamma =2\), and c) 100 scale-free networks with a power exponent of \(\gamma =3\) [4] using the R package igraph [9]. All of these networks consisted of 2836 nodes. Afterwards, we calculated for each network the correlation between the actors’ betweenness centrality and the actors’ number of unclosed triads. Table 5 illustrates the mean correlation coefficients over all 100 networks for the three different types of networks. As the mean correlation coefficients are near 1 in all three types of networks, we can conclude that the number of an actor’s unclosed triads is an appropriate proxy variable for her or his betweenness centrality in these artificial networks.
Table 5

Spearman correlation between the actor’s betweenness centrality and the actor’s number of unclosed triads

Erds-Renyi networks

Scale-free networks (\(\gamma =2\))

Scale-free networks (\(\gamma =3\))

Spearman’s rho




However, we also wanted to ensure that the number of an actor’s unclosed triads is a good proxy variable for her or his betweenness centrality in not only these artificial networks but also real world networks. Therefore, we examined the correlation between a node’s betweenness centrality and the suggested proxy variable using four well-known real world networks that stem from different domains and have different sizes: (1) Jeong and colleagues’ [15] “protein interaction network” (\(\rho =0.971\)), (2) Watts and Strogatz’ [28] ‘power grid” (\(\rho =0.858\)), (3) Padgett’s “Florentine families network” [7] (\(\rho =0.854\)), and (4) Knuth’s [16] “Les Miserables dataset” (\(\rho =0.980\)). Also, in these four real world networks, the strong correlations indicate that the suggested proxy variable is a good indicator for a node’s betweenness centrality. Nevertheless, we cannot infer whether the accuracy of the proxy variable changes with the size of the network based on this data.

For the final step of our analyses, we examined what percentages of the top nodes in the co-authorship network and the four real world networks are correctly identified as such using the proposed heuristic. Figure 2 depicts the number of nodes selected as top nodes (in percent) on the x-axis. The y-axis depicts how many nodes are correctly identified as top nodes using the proposed approach.

For example, if one aims to identify the top 15 % of nodes (by their betweenness centrality) in the co-authorship network, the proposed approach correctly identifies 83 % of these top nodes. Another example is the line for the “Florentine families network” in Fig. 2.13 If one intends to identify the top 5 % of the Florentine families (i.e. the top family), the proposed proxy variable correctly identifies this one family (i.e. the proxy variable identifies 100 % of the families one intended to identify). Also if one intends to identify the top 12.5 % of the families (i.e. two families), the proposed proxy variable correctly identifies these two families (i.e. 100 %). However, if one intends to identify the top three families by their betweenness centrality (i.e. 18.75 % of all families), the proposed proxy variable only correctly identifies two (i.e. 66.6 % of the families one intended to identify). Finally, when the aim is to identify the top four families by their betweenness centrality, the proposed proxy variable correctly identifies three (i.e. 75 %), and so on.
Fig. 2

Nodes selected as top nodes and nodes correctly identified as top nodes

In general, across all networks, the proposed approach identifies a sufficiently large number of top nodes for a variety of application scenarios (such as, for example, KOL identification for marketing campaigns in the co-authorship network).

5 Discussion

In this paper, we aimed at two research objectives. First, we identified KOLs in PCSK9 research by their embeddedness in a co-authorship network. Specifically, we identified them by using their betweenness centrality in the co-authorship network. Second, we proposed a proxy variable for the betweenness centrality of these nodes (i.e. the number of an author’s unclosed triads).14

We think that both points in themselves are important contributions to practice and literature. Pharmaceutical enterprises spend considerable time and effort identifying KOLs. In this paper, we illustrated an easy and cheap alternative to identify KOLs on the basis of co-authorship data. The proposed method can also be easily conducted with search terms other than “PCSK9”.

Furthermore, the proposed proxy variable may serve as an indicator for the nodes’ betweenness centrality in a variety of settings where betweenness centrality cannot feasibly be calculated. Since the collaboration network of scientist is a prototype example of a complex evolving network [5], our findings also seem applicable to a variety of other networks as well.

Of course, as with any empirical study, this study is subject to some limitations. We do not consider most of these limitations to void the results, so long as readers remain aware of them as they draw their conclusions. In fact, the limitations suggest some future research. There are four specific limitations to discuss.

First, since PubMed/MEDLINE did not provide unique researcher IDs for all researchers, there might be some problems in distinguishing some of them. Either some researchers might have the same name or some authors might change their name (e.g. after marriage) and be recognised as two different nodes in a network. However, we manually checked the data for inconsistencies and think that the remaining error is of the order of a few percent (compare [22]). Therefore, we do not think that this methodological limitation will significantly affect our results (compare also [5]). Nevertheless, future research should conduct related analyses with a dataset in which each author has a unique researchers’ ID.

Second, by selecting all articles about PCSK9 research indexed by the PubMed database, we obtained a clear boundary specification of the network. However, this boundary specification is rather artificial (compare [27]). For example, some of the authors might have collaborated on other articles, and we neglected these co-authorship links in our analyses. Therefore, future research should analyse co-authorship networks with a different boundary specification.

Third, we neglected the fact that KOLs retire and stop publishing papers [5]. Hence, we might possibly have identified some KOLs in our analyses that are not active anymore. Future research could collect additional data on this aspect and explicitly consider the retirement of KOLs in the analyses.

Fourth, during our analyses, we focused on the author collaboration network (compare [11]) and used the author-paper affiliation network (i.e. a bipartite graph) for calculating some descriptive statistics only (such as the number of authors per paper, or the number of papers per author). Future research could analyse the author-paper affiliation network in more detail.

Our hope is that our research will assist others in conducting these types of studies and form the basis for substantial future research into identifying KOLs in co-authorship networks, as well as the use of the number of unclosed triads as a proxy variable for betweenness centrality.


  1. 1.

    The execution times are too high even when applying improved algorithms to calculate betweenness centrality (e.g. [3, 6, 30]).

  2. 2.

    DBLP is a database of computer science publications;, accessed on July 22nd 2015.

  3. 3.

    PCSK9 is a protein which regulates LDL cholesterol levels. By blocking PCSK9, cholesterol levels can be brought substantially down. Hence, drugs can be developed that reduce the risk of cardiovascular diseases by blocking PCSK9.

  4. 4., accessed on June 4th 2015.

  5. 5., accessed on July 14th 2015.

  6. 6.

    In the analyses, we left out the years 1994–2002, since no papers about PCSK9 were published then.

  7. 7.

    Although Freeman [13] proposed a standardised measure of betweenness centrality that can theoretically be used for comparing centrality scores between components of different size, we think that it is, for example, not meaningful to compare the maximal betweenness centrality of a node in a component with three actors to that of a node in the main component of a co-authorship network.

  8. 8.

    The main component of a network is also sometimes referred to as the “giant component”.

  9. 9.

    There were no other meaningful big components in the network. For example, the second (third) biggest component in the network comprised 1.23 % (0.69 %) of all authors.

  10. 10.

    These influential people include basic researchers as well as researchers conducting clinical trials. Hence, some context knowledge is helpful for reading the tables.

  11. 11.

    We suppose that node A will have a high betweenness centrality in the final network, although node B and node C are more likely to co-author a paper in the future than two random nodes if both have co-authored a paper with node A. In the literature, this fact has been termed the “forbidden triad” [14].

  12. 12.

    This is true for all years except 2004 and 2005. However, there were only very few publications in these years (14 and 18 respectively, compare Table 1), and the high correlation coefficients between an author’s degree centrality and this author’s betweenness centrality for those two years can be explained by chance. Furthermore, the differences in the correlation coefficients between the number of an author’s unclosed triads and betweennness centrality and author’s degree centrality and betweenness centrality for the years 2004 and 2005 are not very large (0.4428995 vs. 0.5012240 and 0.4435424 vs. 0.4919271).

  13. 13.

    The “Florentine families network” is a very small network (with 16 nodes only).

  14. 14.

    Encouraged by a literature review and interviews with marketing managers from the pharmaceutical industry, we assumed that authors with a high betweenness centrality have a high influence as well. Although we think that this is a reasonable assumption for co-authorship networks, we want to be clear that structural importance and dynamic influence of nodes do not necessarily have to be the same.



This work was supported by a fellowship within the FITweltweit programme of the German Academic Exchange Service (DAAD).


  1. 1.
    Aggarwal, C., Subbian, K.: Evolutionary network analysis: a survey. ACM Comput. Surv. 47(1), 10 (2014). doi:10.1145/2601412
  2. 2.
    Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: Paper presented at the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USAGoogle Scholar
  3. 3.
    Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: Algorithms and Models for the Web-Graph, pp. 124–137. Springer, (2007)Google Scholar
  4. 4.
    Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999). doi:10.1126/science.286.5439.509 MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Barabási, A.L., Jeong, H., Neda, Z., Ravasz, E., Schubert, A., Vicsek, T.: Evolution of the social network of scientific collaborations. Physica A 311(3–4), 590–614 (2002)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163–177 (2001)CrossRefMATHGoogle Scholar
  7. 7.
    Breiger, R.L., Pattison, P.E.: Cumulated social roles—the duality of persons and their algebras. Soc. Netw. 8(3), 215–256 (1986). doi:10.1016/0378-8733(86)90006-7 CrossRefGoogle Scholar
  8. 8.
    Butts, C.T.: Social network analysis with sna. J. Stat. Softw. 24(6), 1–51 (2008)CrossRefGoogle Scholar
  9. 9.
    Czárdi, G., Nepusz, T.: The igraph software package for complex network research. InterJournal, Complex Syst. 1695 (2006)Google Scholar
  10. 10.
    Ediger, D., Jiang, K., Riedy, J., Bader, D., Corley, C., Farber, R., Reynolds, W.N.: Massive social network analysis: mining twitter for social good. In: Paper presented at the 39th International Conference on Parallel Processing (ICPP) San Diego, CAGoogle Scholar
  11. 11.
    Franceschet, M.: Collaboration in computer science: a network science approach. J. Am. Soc. Inform. Sci. Technol. 62(10), 1992–2012 (2011). doi:10.1002/asi.21614 CrossRefGoogle Scholar
  12. 12.
    Freeman, L.C.: Set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977). doi:10.2307/3033543 CrossRefGoogle Scholar
  13. 13.
    Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215–239 (1979). doi:10.1016/0378-8733(78)90021-7 CrossRefGoogle Scholar
  14. 14.
    Granovetter, M.S.: The strength of weak ties. Am. J. Sociol. 78(6), 1360–1380 (1973). doi:10.1086/225469 CrossRefGoogle Scholar
  15. 15.
    Jeong, H., Mason, S.P., Barabási, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411(6833), 41–42 (2001). doi:10.1038/35075138 CrossRefGoogle Scholar
  16. 16.
    Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley Reading (1993)Google Scholar
  17. 17.
    Liu, P., Xia, H.: Structure and evolution of co-authorship network in an interdisciplinary research field. Scientometrics 103(1), 101–134 (2015). doi:10.1007/s11192-014-1525-y MathSciNetCrossRefGoogle Scholar
  18. 18.
    McLaughlin, A., Bader, D.A.: Scalable and high performance betweenness centrality on the GPU. In: Paper presented at the International Conference for High Performance Computing, Networking, Storage and Analysis, New Orleans, LouisanaGoogle Scholar
  19. 19.
    Morstatter, F., Pfeffer, J., Liu, H., Carley, K.M.: Is the sample good enough? comparing data from Twitter’s streaming API with Twitter’s firehose. In: Paper presented at the International AAAI Conference on Web and Social Media, Cambridge, MassachusettsGoogle Scholar
  20. 20.
    Newman, M.E.: Scientific collaboration networks—I. Network construction and fundamental results. Phys. Rev. E 64, 016131 (2001)Google Scholar
  21. 21.
    Newman, M.E.: Scientific collaboration networks—II. Shortest paths, weighted networks, and centrality. Phys. Rev. E 64, 016132 (2001)Google Scholar
  22. 22.
    Newman, M.E.J.: The structure of scientific collaboration networks. Proc. Nat. Acad. Sci. USA 98(2), 404–409 (2001). doi:10.1073/pnas.021544898 MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Newman, M.E.J.: Coauthorship networks and patterns of scientific collaboration. Proc. Nat. Acad. Sci. 101(suppl 1), 5200–5205 (2004). doi:10.1073/pnas.0307545100 CrossRefGoogle Scholar
  24. 24.
    Shi, X., Bonner, M., Adamic, L.A., Gilbert, A.C.: The very small world of the well-connected. In: Paper presented at the Nineteenth ACM Conference on Hypertext and Hypermedia, Pittsburgh, PA, USAGoogle Scholar
  25. 25.
    Spearman, C.: The proof and measurement of association between 2 Things (Reprinted from Amer. J. Psychol. vol. 15, pp. 72–101, 1904). Am. J. Psychol 100(3–4), 441–471 (1987)CrossRefGoogle Scholar
  26. 26.
    Tomassini, M., Luthi, L.: Empirical analysis of the evolution of a scientific collaboration network. Physica A 385(2), 750–764 (2007)CrossRefGoogle Scholar
  27. 27.
    Vidgen, R., Henneberg, S., Naude, P.: What sort of community is the European Conference on information systems? a social network analysis 1993–2005. Eur. J. Inf. Syst. 16(1), 5–19 (2007)Google Scholar
  28. 28.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998). doi:10.1038/30918 CrossRefGoogle Scholar
  29. 29.
    Yan, E., Ding, Y.: Applying centrality measures to impact analysis: a coauthorship network analysis. J. Am. Soc. Inform. Sci. Technol. 60(10), 2107–2118 (2009). doi:10.1002/asi.21128 CrossRefGoogle Scholar
  30. 30.
    Yang, J., Chen, Y.: Fast computing betweenness centrality with virtual nodes on large sparse networks. PLoS ONE 6(7), e22557 (2011). doi:10.1371/journal.pone.0022557 CrossRefGoogle Scholar
  31. 31.
    Yang, Y., Dong, Y., Chawla, N.V.: Predicting node degree centrality with the node prominence profile. Sci. Rep. 4(7236) (2014). doi:10.1038/srep07236

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.National Institute of InformaticsChiyodaJapan

Personalised recommendations