Network Effects on Scientific Collaborations

Background

The analysis of co-authorship network aims at exploring the impact of network structure on the outcome of scientific collaborations and research publications. However, little is known about what network properties are associated with authors who have increased number of joint publications and are being cited highly.

Methodology/Principal Findings

Measures of social network analysis, for example network centrality and tie strength, have been utilized extensively in current co-authorship literature to explore different behavioural patterns of co-authorship networks. Using three SNA measures (i.e., degree centrality, closeness centrality and betweenness centrality), we explore scientific collaboration networks to understand factors influencing performance (i.e., citation count) and formation (tie strength between authors) of such networks. A citation count is the number of times an article is cited by other articles. We use co-authorship dataset of the research field of ‘steel structure’ for the year 2005 to 2009. To measure the strength of scientific collaboration between two authors, we consider the number of articles co-authored by them. In this study, we examine how citation count of a scientific publication is influenced by different centrality measures of its co-author(s) in a co-authorship network. We further analyze the impact of the network positions of authors on the strength of their scientific collaborations. We use both correlation and regression methods for data analysis leading to statistical validation. We identify that citation count of a research article is positively correlated with the degree centrality and betweenness centrality values of its co-author(s). Also, we reveal that degree centrality and betweenness centrality values of authors in a co-authorship network are positively correlated with the strength of their scientific collaborations.

Conclusions/Significance

Authors’ network positions in co-authorship networks influence the performance (i.e., citation count) and formation (i.e., tie strength) of scientific collaborations.     

Characterizing and modeling citation dynamics

Citation distributions are crucial for the analysis and modeling of the activity of scientists. We investigated bibliometric data of papers published in journals of the American Physical Society, searching for the type of function which best describes the observed citation distributions. We used the goodness of fit with Kolmogorov-Smirnov statistics for three classes of functions: log-normal, simple power law and shifted power law. The shifted power law turns out to be the most reliable hypothesis for all citation networks we derived, which correspond to different time spans. We find that citation dynamics is characterized by bursts, usually occurring within a few years since publication of a paper, and the burst size spans several orders of magnitude. We also investigated the microscopic mechanisms for the evolution of citation networks, by proposing a linear preferential attachment with time dependent initial attractiveness. The model successfully reproduces the empirical citation distributions and accounts for the presence of citation bursts as well.     

Resolving Structural Variability in Network Models and the Brain

Large-scale white matter pathways crisscrossing the cortex create a complex pattern of connectivity that underlies human cognitive function. Generative mechanisms for this architecture have been difficult to identify in part because little is known in general about mechanistic drivers of structured networks. Here we contrast network properties derived from diffusion spectrum imaging data of the human brain with 13 synthetic network models chosen to probe the roles of physical network embedding and temporal network growth. We characterize both the empirical and synthetic networks using familiar graph metrics, but presented here in a more complete statistical form, as scatter plots and distributions, to reveal the full range of variability of each measure across scales in the network. We focus specifically on the degree distribution, degree assortativity, hierarchy, topological Rentian scaling, and topological fractal scaling—in addition to several summary statistics, including the mean clustering coefficient, the shortest path-length, and the network diameter. The models are investigated in a progressive, branching sequence, aimed at capturing different elements thought to be important in the brain, and range from simple random and regular networks, to models that incorporate specific growth rules and constraints. We find that synthetic models that constrain the network nodes to be physically embedded in anatomical brain regions tend to produce distributions that are most similar to the corresponding measurements for the brain. We also find that network models hardcoded to display one network property (e.g., assortativity) do not in general simultaneously display a second (e.g., hierarchy). This relative independence of network properties suggests that multiple neurobiological mechanisms might be at play in the development of human brain network architecture. Together, the network models that we develop and employ provide a potentially useful starting point for the statistical inference of brain network structure from neuroimaging data.     

Hierarchical coordination of periodic genes in the cell cycle of Saccharomyces cerevisiae

Background  

Gene networks are a representation of molecular interactions among genes or products thereof and, hence, are forming causal networks. Despite intense studies during the last years most investigations focus so far on inferential methods to reconstruct gene networks from experimental data or on their structural properties, e.g., degree distributions. Their structural analysis to gain functional insights into organizational principles of, e.g., pathways remains so far under appreciated.     

Analysis and assembling of network structure in mutualistic systems

It has been observed that mutualistic bipartite networks have a nested structure of interactions. In addition, the degree distributions associated with the two guilds involved in such networks (e.g., plants and pollinators or plants and seed dispersers) approximately follow a truncated power law (TPL). We show that nestedness and TPL distributions are intimately linked, and that any biological reasons for such truncation are superimposed to finite size effects. We further explore the internal organization of bipartite networks by developing a self-organizing network model (SNM) that reproduces empirical observations of pollination systems of widely different sizes. Since the only inputs to the SNM are numbers of plant and animal species, and their interactions (i.e., no data on local abundance of the interacting species are needed), we suggest that the well-known association between species frequency of interaction and species degree is a consequence rather than a cause, of the observed network structure.     

Evolution of Gene Regulatory Networks by Fluctuating Selection and Intrinsic Constraints

Various characteristics of complex gene regulatory networks (GRNs) have been discovered during the last decade, e.g., redundancy, exponential indegree distributions, scale-free outdegree distributions, mutational robustness, and evolvability. Although progress has been made in this field, it is not well understood whether these characteristics are the direct products of selection or those of other evolutionary forces such as mutational biases and biophysical constraints. To elucidate the causal factors that promoted the evolution of complex GRNs, we examined the effect of fluctuating environmental selection and some intrinsic constraining factors on GRN evolution by using an individual-based model. We found that the evolution of complex GRNs is remarkably promoted by fixation of beneficial gene duplications under unpredictably fluctuating environmental conditions and that some internal factors inherent in organisms, such as mutational bias, gene expression costs, and constraints on expression dynamics, are also important for the evolution of GRNs. The results indicate that various biological properties observed in GRNs could evolve as a result of not only adaptation to unpredictable environmental changes but also non-adaptive processes owing to the properties of the organisms themselves. Our study emphasizes that evolutionary models considering such intrinsic constraining factors should be used as null models to analyze the effect of selection on GRN evolution.     

A reverse engineering approach to the suppression of citation biases reveals universal properties of citation distributions

The large amount of information contained in bibliographic databases has recently boosted the use of citations, and other indicators based on citation numbers, as tools for the quantitative assessment of scientific research. Citations counts are often interpreted as proxies for the scientific influence of papers, journals, scholars, and institutions. However, a rigorous and scientifically grounded methodology for a correct use of citation counts is still missing. In particular, cross-disciplinary comparisons in terms of raw citation counts systematically favors scientific disciplines with higher citation and publication rates. Here we perform an exhaustive study of the citation patterns of millions of papers, and derive a simple transformation of citation counts able to suppress the disproportionate citation counts among scientific domains. We find that the transformation is well described by a power-law function, and that the parameter values of the transformation are typical features of each scientific discipline. Universal properties of citation patterns descend therefore from the fact that citation distributions for papers in a specific field are all part of the same family of univariate distributions.     

Genealogical Trees of Scientific Papers

Many results have been obtained when studying scientific papers citations databases in a network perspective. Articles can be ranked according to their current in-degree and their future popularity or citation counts can even be predicted. The dynamical properties of such networks and the observation of the time evolution of their nodes started more recently. This work adopts an evolutionary perspective and proposes an original algorithm for the construction of genealogical trees of scientific papers on the basis of their citation count evolution in time. The fitness of a paper now amounts to its in-degree growing trend and a “dying” paper will suddenly see this trend declining in time. It will give birth and be taken over by some of its most prevalent citing “offspring”. Practically, this might be used to trace the successive published milestones of a research field.     

A Network Approach to Psychopathology: New Insights into Clinical Longitudinal Data

In the network approach to psychopathology, disorders are conceptualized as networks of mutually interacting symptoms (e.g., depressed mood) and transdiagnostic factors (e.g., rumination). This suggests that it is necessary to study how symptoms dynamically interact over time in a network architecture. In the present paper, we show how such an architecture can be constructed on the basis of time-series data obtained through Experience Sampling Methodology (ESM). The proposed methodology determines the parameters for the interaction between nodes in the network by estimating a multilevel vector autoregression (VAR) model on the data. The methodology allows combining between-subject and within-subject information in a multilevel framework. The resulting network architecture can subsequently be analyzed through network analysis techniques. In the present study, we apply the method to a set of items that assess mood-related factors. We show that the analysis generates a plausible and replicable network architecture, the structure of which is related to variables such as neuroticism; that is, for subjects who score high on neuroticism, worrying plays a more central role in the network. Implications and extensions of the methodology are discussed.     

Influence of Choice of Null Network on Small-World Parameters of Structural Correlation Networks

In recent years, coordinated variations in brain morphology (e.g., volume, thickness) have been employed as a measure of structural association between brain regions to infer large-scale structural correlation networks. Recent evidence suggests that brain networks constructed in this manner are inherently more clustered than random networks of the same size and degree. Thus, null networks constructed by randomizing topology are not a good choice for benchmarking small-world parameters of these networks. In the present report, we investigated the influence of choice of null networks on small-world parameters of gray matter correlation networks in healthy individuals and survivors of acute lymphoblastic leukemia. Three types of null networks were studied: 1) networks constructed by topology randomization (TOP), 2) networks matched to the distributional properties of the observed covariance matrix (HQS), and 3) networks generated from correlation of randomized input data (COR). The results revealed that the choice of null network not only influences the estimated small-world parameters, it also influences the results of between-group differences in small-world parameters. In addition, at higher network densities, the choice of null network influences the direction of group differences in network measures. Our data suggest that the choice of null network is quite crucial for interpretation of group differences in small-world parameters of structural correlation networks. We argue that none of the available null models is perfect for estimation of small-world parameters for correlation networks and the relative strengths and weaknesses of the selected model should be carefully considered with respect to obtained network measures.     

Driving and driven architectures of directed small-world human brain functional networks

Recently, increasing attention has been focused on the investigation of the human brain connectome that describes the patterns of structural and functional connectivity networks of the human brain. Many studies of the human connectome have demonstrated that the brain network follows a small-world topology with an intrinsically cohesive modular structure and includes several network hubs in the medial parietal regions. However, most of these studies have only focused on undirected connections between regions in which the directions of information flow are not taken into account. How the brain regions causally influence each other and how the directed network of human brain is topologically organized remain largely unknown. Here, we applied linear multivariate Granger causality analysis (GCA) and graph theoretical approaches to a resting-state functional MRI dataset with a large cohort of young healthy participants (n = 86) to explore connectivity patterns of the population-based whole-brain functional directed network. This directed brain network exhibited prominent small-world properties, which obviously improved previous results of functional MRI studies showing weak small-world properties in the directed brain networks in terms of a kernel-based GCA and individual analysis. This brain network also showed significant modular structures associated with 5 well known subsystems: fronto-parietal, visual, paralimbic/limbic, subcortical and primary systems. Importantly, we identified several driving hubs predominantly located in the components of the attentional network (e.g., the inferior frontal gyrus, supplementary motor area, insula and fusiform gyrus) and several driven hubs predominantly located in the components of the default mode network (e.g., the precuneus, posterior cingulate gyrus, medial prefrontal cortex and inferior parietal lobule). Further split-half analyses indicated that our results were highly reproducible between two independent subgroups. The current study demonstrated the directions of spontaneous information flow and causal influences in the directed brain networks, thus providing new insights into our understanding of human brain functional connectome.     

Distinguishing Patients with Parkinson's Disease Subtypes from Normal Controls Based on Functional Network Regional Efficiencies

Many studies have demonstrated that the pathophysiology and clinical symptoms of Parkinson''s disease (PD) are inhomogeneous. However, the symptom-specific intrinsic neural activities underlying the PD subtypes are still not well understood. Here, 15 tremor-dominant PD patients, 10 non-tremor-dominant PD patients, and 20 matched normal controls (NCs) were recruited and underwent resting-state functional magnetic resonance imaging (fMRI). Functional brain networks were constructed based on randomly generated anatomical templates with and without the cerebellum. The regional network efficiencies (i.e., the local and global efficiencies) were further measured and used to distinguish subgroups of PD patients (i.e., with tremor-dominant PD and non-tremor-dominant PD) from the NCs using linear discriminant analysis. The results demonstrate that the subtype-specific functional networks were small-world-organized and that the network regional efficiency could discriminate among the individual PD subgroups and the NCs. Brain regions involved in distinguishing between the study groups included the basal ganglia (i.e., the caudate and putamen), limbic regions (i.e., the hippocampus and thalamus), the cerebellum, and other cerebral regions (e.g., the insula, cingulum, and calcarine sulcus). In particular, the performances of the regional local efficiency in the functional network were better than those of the global efficiency, and the performances of global efficiency were dependent on the inclusion of the cerebellum in the analysis. These findings provide new evidence for the neurological basis of differences between PD subtypes and suggest that the cerebellum may play different roles in the pathologies of different PD subtypes. The present study demonstrated the power of the combination of graph-based network analysis and discrimination analysis in elucidating the neural basis of different PD subtypes.     

Form-Finding Model Shows How Cytoskeleton Network Stiffness Is Realized

In eukaryotic cells the actin-cytoskeletal network provides stiffness and the driving force that contributes to changes in cell shape and cell motility, but the elastic behavior of this network is not well understood. In this paper a two dimensional form-finding model is proposed to investigate the elasticity of the actin filament network. Utilizing an initially random array of actin filaments and actin-cross-linking proteins the form-finding model iterates until the random array is brought into a stable equilibrium configuration. With some care given to actin filament density and length, distance between host sites for cross-linkers, and overall domain size the resulting configurations from the form-finding model are found to be topologically similar to cytoskeletal networks in real cells. The resulting network may then be mechanically exercised to explore how the actin filaments deform and align under load and the sensitivity of the network’s stiffness to actin filament density, length, etc. Results of the model are consistent with the experimental literature, e.g. actin filaments tend to re-orient in the direction of stretching; and the filament relative density, filament length, and actin-cross-linking protein’s relative density, control the actin-network stiffness. The model provides a ready means of extension to more complicated domains and a three-dimensional form-finding model is under development as well as models studying the formation of actin bundles.     

A Simulation Study Comparing Epidemic Dynamics on Exponential Random Graph and Edge-Triangle Configuration Type Contact Network Models

We compare two broad types of empirically grounded random network models in terms of their abilities to capture both network features and simulated Susceptible-Infected-Recovered (SIR) epidemic dynamics. The types of network models are exponential random graph models (ERGMs) and extensions of the configuration model. We use three kinds of empirical contact networks, chosen to provide both variety and realistic patterns of human contact: a highly clustered network, a bipartite network and a snowball sampled network of a “hidden population”. In the case of the snowball sampled network we present a novel method for fitting an edge-triangle model. In our results, ERGMs consistently capture clustering as well or better than configuration-type models, but the latter models better capture the node degree distribution. Despite the additional computational requirements to fit ERGMs to empirical networks, the use of ERGMs provides only a slight improvement in the ability of the models to recreate epidemic features of the empirical network in simulated SIR epidemics. Generally, SIR epidemic results from using configuration-type models fall between those from a random network model (i.e., an Erdős-Rényi model) and an ERGM. The addition of subgraphs of size four to edge-triangle type models does improve agreement with the empirical network for smaller densities in clustered networks. Additional subgraphs do not make a noticeable difference in our example, although we would expect the ability to model cliques to be helpful for contact networks exhibiting household structure.     

Discovering Implicit Entity Relation with the Gene-Citation-Gene Network

In this paper, we apply the entitymetrics model to our constructed Gene-Citation-Gene (GCG) network. Based on the premise there is a hidden, but plausible, relationship between an entity in one article and an entity in its citing article, we constructed a GCG network of gene pairs implicitly connected through citation. We compare the performance of this GCG network to a gene-gene (GG) network constructed over the same corpus but which uses gene pairs explicitly connected through traditional co-occurrence. Using 331,411 MEDLINE abstracts collected from 18,323 seed articles and their references, we identify 25 gene pairs. A comparison of these pairs with interactions found in BioGRID reveal that 96% of the gene pairs in the GCG network have known interactions. We measure network performance using degree, weighted degree, closeness, betweenness centrality and PageRank. Combining all measures, we find the GCG network has more gene pairs, but a lower matching rate than the GG network. However, combining top ranked genes in both networks produces a matching rate of 35.53%. By visualizing both the GG and GCG networks, we find that cancer is the most dominant disease associated with the genes in both networks. Overall, the study indicates that the GCG network can be useful for detecting gene interaction in an implicit manner.     

Network Plasticity as Bayesian Inference

General results from statistical learning theory suggest to understand not only brain computations, but also brain plasticity as probabilistic inference. But a model for that has been missing. We propose that inherently stochastic features of synaptic plasticity and spine motility enable cortical networks of neurons to carry out probabilistic inference by sampling from a posterior distribution of network configurations. This model provides a viable alternative to existing models that propose convergence of parameters to maximum likelihood values. It explains how priors on weight distributions and connection probabilities can be merged optimally with learned experience, how cortical networks can generalize learned information so well to novel experiences, and how they can compensate continuously for unforeseen disturbances of the network. The resulting new theory of network plasticity explains from a functional perspective a number of experimental data on stochastic aspects of synaptic plasticity that previously appeared to be quite puzzling.     

Biology,Methodology or Chance? The Degree Distributions of Bipartite Ecological Networks

The distribution of the number of links per species, or degree distribution, is widely used as a summary of the topology of complex networks. Degree distributions have been studied in a range of ecological networks, including both mutualistic bipartite networks of plants and pollinators or seed dispersers and antagonistic bipartite networks of plants and their consumers. The shape of a degree distribution, for example whether it follows an exponential or power-law form, is typically taken to be indicative of the processes structuring the network. The skewed degree distributions of bipartite mutualistic and antagonistic networks are usually assumed to show that ecological or co-evolutionary processes constrain the relative numbers of specialists and generalists in the network. I show that a simple null model based on the principle of maximum entropy cannot be rejected as a model for the degree distributions in most of the 115 bipartite ecological networks tested here. The model requires knowledge of the number of nodes and links in the network, but needs no other ecological information. The model cannot be rejected for 159 (69%) of the 230 degree distributions of the 115 networks tested. It performed equally well on the plant and animal degree distributions, and cannot be rejected for 81 (70%) of the 115 plant distributions and 78 (68%) of the animal distributions. There are consistent differences between the degree distributions of mutualistic and antagonistic networks, suggesting that different processes are constraining these two classes of networks. Fit to the MaxEnt null model is consistently poor among the largest mutualistic networks. Potential ecological and methodological explanations for deviations from the model suggest that spatial and temporal heterogeneity are important drivers of the structure of these large networks.     

Ongoing Processes in a Fitness Network Model under Restricted Resources

In real networks, the resources that make up the nodes and edges are finite. This constraint poses a serious problem for network modeling, namely, the compatibility between robustness and efficiency. However, these concepts are generally in conflict with each other. In this study, we propose a new fitness-driven network model for finite resources. In our model, each individual has its own fitness, which it tries to increase. The main assumption in fitness-driven networks is that incomplete estimation of fitness results in a dynamical growing network. By taking into account these internal dynamics, nodes and edges emerge as a result of exchanges between finite resources. We show that our network model exhibits exponential distributions in the in- and out-degree distributions and a power law distribution of edge weights. Furthermore, our network model resolves the trade-off relationship between robustness and efficiency. Our result suggests that growing and anti-growing networks are the result of resolving the trade-off problem itself.