Parameterization of Keeling's network generation algorithm

Simulation is increasingly being used to examine epidemic behaviour and assess potential management options. The utility of the simulations rely on the ability to replicate those aspects of the social structure that are relevant to epidemic transmission. One approach is to generate networks with desired social properties.Recent research by Keeling and his colleagues has generated simulated networks with a range of properties, and examined the impact of these properties on epidemic processes occurring over the network. However, published work has included only limited analysis of the algorithm itself and the way in which the network properties are related to the algorithm parameters.This paper identifies some relationships between the algorithm parameters and selected network properties (mean degree, degree variation, clustering coefficient and assortativity). Our approach enables users of the algorithm to efficiently generate a network with given properties, thereby allowing realistic social networks to be used as the basis of epidemic simulations. Alternatively, the algorithm could be used to generate social networks with a range of property values, enabling analysis of the impact of these properties on epidemic behaviour.     

不同类型氨基酸网络参量与蛋白质折叠的关系

理论和实验研究表明,蛋白质天然拓扑结构对其折叠过程具有重要的影响．采用复杂网络的方法分析蛋白质天然结构的拓扑特征,并探索蛋白质结构特征与折叠速率之间的内在联系．分别构建了蛋白质氨基酸网络、疏水网、亲水网、亲水-疏水网以及相应的长程网络,研究了这些网络的匹配系数(assortativity coefficient)和聚集系数(clustering coefficient)的统计特性．结果表明,除了亲水-疏水网,上述各网络的匹配系数均为正值,并且氨基酸网和疏水网的匹配系数与折叠速率表现出明显的线性正相关,揭示了疏水残基间相互作用的协同性有助于蛋白质的快速折叠．同时,研究发现疏水网的聚集系数与折叠速率有明显的线性负相关关系,这表明疏水残基间三角结构(triangle construction)的形成不利于蛋白质快速折叠．还进一步构建了相应的长程网络,发现序列上间距较远的残基接触对的形成将使蛋白质折叠进程变慢．     

Large-scale properties of clustered networks: implications for disease dynamics

We consider previously proposed procedures for generating clustered networks and investigate how these procedures lead to differences in network properties other than clustering. We interpret our findings in terms of the effect of the network structure on the disease outbreak threshold and disease dynamics. To generate null-model networks for comparison, we implement an assortativity-conserving rewiring algorithm that alters the level of clustering while causing minimal impact on other properties. We show that many theoretical network models used to generate networks with a particular property often lead to significant changes in network properties other than that of interest. For high levels of clustering, different procedures lead to networks that differ in degree heterogeneity and assortativity, and in broader scale measures such as ?(0) and the distribution of shortest path lengths. Hence, care must be taken when investigating the implications of network properties for disease transmission or other dynamic process that the network supports.     

Has Large-Scale Named-Entity Network Analysis Been Resting on a Flawed Assumption?

The assumption that a name uniquely identifies an entity introduces two types of errors: splitting treats one entity as two or more (because of name variants); lumping treats multiple entities as if they were one (because of shared names). Here we investigate the extent to which splitting and lumping affect commonly-used measures of large-scale named-entity networks within two disambiguated bibliographic datasets: one for co-author names in biomedicine (PubMed, 2003–2007); the other for co-inventor names in U.S. patents (USPTO, 2003–2007). In both cases, we find that splitting has relatively little effect, whereas lumping has a dramatic effect on network measures. For example, in the biomedical co-authorship network, lumping (based on last name and both initials) drives several measures down: the global clustering coefficient by a factor of 4 (from 0.265 to 0.066); degree assortativity by a factor of ∼13 (from 0.763 to 0.06); and average shortest path by a factor of 1.3 (from 5.9 to 4.5). These results can be explained in part by the fact that lumping artificially creates many intransitive relationships and high-degree vertices. This effect of lumping is much less dramatic but persists with measures that give less weight to high-degree vertices, such as the mean local clustering coefficient and log-based degree assortativity. Furthermore, the log-log distribution of collaborator counts follows a much straighter line (power law) with splitting and lumping errors than without, particularly at the low and the high counts. This suggests that part of the power law often observed for collaborator counts in science and technology reflects an artifact: name ambiguity.     

SpecNet: A Spatial Network Algorithm that Generates a Wide Range of Specific Structures

Network measures are used to predict the behavior of different systems. To be able to investigate how various structures behave and interact we need a wide range of theoretical networks to explore. Both spatial and non-spatial methods exist for generating networks but they are limited in the ability of producing wide range of network structures. We extend an earlier version of a spatial spectral network algorithm to generate a large variety of networks across almost all the theoretical spectra of the following network measures: average clustering coefficient, degree assortativity, fragmentation index, and mean degree. We compare this extended spatial spectral network-generating algorithm with a non-spatial algorithm regarding their ability to create networks with different structures and network measures. The spatial spectral network-generating algorithm can generate networks over a much broader scale than the non-spatial and other known network algorithms. To exemplify the ability to regenerate real networks, we regenerate networks with structures similar to two real Swedish swine transport networks. Results show that the spatial algorithm is an appropriate model with correlation coefficients at 0.99. This novel algorithm can even create negative assortativity and managed to achieve assortativity values that spans over almost the entire theoretical range.     

VA-Index: Quantifying Assortativity Patterns in Networks with Multidimensional Nodal Attributes

Network connections have been shown to be correlated with structural or external attributes of the network vertices in a variety of cases. Given the prevalence of this phenomenon network scientists have developed metrics to quantify its extent. In particular, the assortativity coefficient is used to capture the level of correlation between a single-dimensional attribute (categorical or scalar) of the network nodes and the observed connections, i.e., the edges. Nevertheless, in many cases a multi-dimensional, i.e., vector feature of the nodes is of interest. Similar attributes can describe complex behavioral patterns (e.g., mobility) of the network entities. To date little attention has been given to this setting and there has not been a general and formal treatment of this problem. In this study we develop a metric, the vector assortativity index (VA-index for short), based on network randomization and (empirical) statistical hypothesis testing that is able to quantify the assortativity patterns of a network with respect to a vector attribute. Our extensive experimental results on synthetic network data show that the VA-index outperforms a baseline extension of the assortativity coefficient, which has been used in the literature to cope with similar cases. Furthermore, the VA-index can be calibrated (in terms of parameters) fairly easy, while its benefits increase with the (co-)variance of the vector elements, where the baseline systematically over(under)estimate the true mixing patterns of the network.     

From Caenorhabditis elegans to the human connectome: a specific modular organization increases metabolic,functional and developmental efficiency

The connectome, or the entire connectivity of a neural system represented by a network, ranges across various scales from synaptic connections between individual neurons to fibre tract connections between brain regions. Although the modularity they commonly show has been extensively studied, it is unclear whether the connection specificity of such networks can already be fully explained by the modularity alone. To answer this question, we study two networks, the neuronal network of Caenorhabditis elegans and the fibre tract network of human brains obtained through diffusion spectrum imaging. We compare them to their respective benchmark networks with varying modularities, which are generated by link swapping to have desired modularity values. We find several network properties that are specific to the neural networks and cannot be fully explained by the modularity alone. First, the clustering coefficient and the characteristic path length of both C. elegans and human connectomes are higher than those of the benchmark networks with similar modularity. High clustering coefficient indicates efficient local information distribution, and high characteristic path length suggests reduced global integration. Second, the total wiring length is smaller than for the alternative configurations with similar modularity. This is due to lower dispersion of connections, which means each neuron in the C. elegans connectome or each region of interest in the human connectome reaches fewer ganglia or cortical areas, respectively. Third, both neural networks show lower algorithmic entropy compared with the alternative arrangements. This implies that fewer genes are needed to encode for the organization of neural systems. While the first two findings show that the neural topologies are efficient in information processing, this suggests that they are also efficient from a developmental point of view. Together, these results show that neural systems are organized in such a way as to yield efficient features beyond those given by their modularity alone.     

Disease spread in small-size directed networks: Epidemic threshold, correlation between links to and from nodes, and clustering

Network epidemiology has mainly focused on large-scale complex networks. It is unclear whether findings of these investigations also apply to networks of small size. This knowledge gap is of relevance for many biological applications, including meta-communities, plant–pollinator interactions and the spread of the oomycete pathogen Phytophthora ramorum in networks of plant nurseries. Moreover, many small-size biological networks are inherently asymmetrical and thus cannot be realistically modelled with undirected networks. We modelled disease spread and establishment in directed networks of 100 and 500 nodes at four levels of connectance in six network structures (local, small-world, random, one-way, uncorrelated, and two-way scale-free networks). The model was based on the probability of infection persistence in a node and of infection transmission between connected nodes. Regardless of the size of the network, the epidemic threshold did not depend on the starting node of infection but was negatively related to the correlation coefficient between in- and out-degree for all structures, unless networks were sparsely connected. In this case clustering played a significant role. For small-size scale-free directed networks to have a lower epidemic threshold than other network structures, there needs to be a positive correlation between number of links to and from nodes. When this correlation is negative (one-way scale-free networks), the epidemic threshold for small-size networks can be higher than in non-scale-free networks. Clustering does not necessarily have an influence on the epidemic threshold if connectance is kept constant. Analyses of the influence of the clustering on the epidemic threshold in directed networks can also be spurious if they do not consider simultaneously the effect of the correlation coefficient between in- and out-degree.     

A Class of Pairwise Models for Epidemic Dynamics on Weighted Networks

In this paper, we study the SIS (susceptible–infected–susceptible) and SIR (susceptible–infected–removed) epidemic models on undirected, weighted networks by deriving pairwise-type approximate models coupled with individual-based network simulation. Two different types of theoretical/synthetic weighted network models are considered. Both start from non-weighted networks with fixed topology followed by the allocation of link weights in either (i) random or (ii) fixed/deterministic way. The pairwise models are formulated for a general discrete distribution of weights, and these models are then used in conjunction with stochastic network simulations to evaluate the impact of different weight distributions on epidemic thresholds and dynamics in general. For the SIR model, the basic reproductive ratio R ₀ is computed, and we show that (i) for both network models R ₀ is maximised if all weights are equal, and (ii) when the two models are ‘equally-matched’, the networks with a random weight distribution give rise to a higher R ₀ value. The models with different weight distributions are also used to explore the agreement between the pairwise and simulation models for different parameter combinations.     

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.     

Multiple sources and routes of information transmission: Implications for epidemic dynamics

In a recent paper [20], we proposed and analyzed a compartmental ODE-based model describing the dynamics of an infectious disease where the presence of the pathogen also triggers the diffusion of information about the disease. In this paper, we extend this previous work by presenting results based on pairwise and simulation models that are better suited for capturing the population contact structure at a local level. We use the pairwise model to examine the potential of different information generating mechanisms and routes of information transmission to stop disease spread or to minimize the impact of an epidemic. The individual-based simulation is used to better differentiate between the networks of disease and information transmission and to investigate the impact of different basic network topologies and network overlap on epidemic dynamics. The paper concludes with an individual-based semi-analytic calculation of R₀ at the non-trivial disease free equilibrium.     

Evolution Characteristics of the Network Core in the Facebook

Statistical properties of the static networks have been extensively studied. However, online social networks are evolving dynamically, understanding the evolving characteristics of the core is one of major concerns in online social networks. In this paper, we empirically investigate the evolving characteristics of the Facebook core. Firstly, we separate the Facebook-link(FL) and Facebook-wall(FW) datasets into 28 snapshots in terms of timestamps. By employing the k-core decomposition method to identify the core of each snapshot, we find that the core sizes of the FL and FW networks approximately contain about 672 and 373 nodes regardless of the exponential growth of the network sizes. Secondly, we analyze evolving topological properties of the core, including the k-core value, assortative coefficient, clustering coefficient and the average shortest path length. Empirical results show that nodes in the core are getting more interconnected in the evolving process. Thirdly, we investigate the life span of nodes belonging to the core. More than 50% nodes stay in the core for more than one year, and 19% nodes always stay in the core from the first snapshot. Finally, we analyze the connections between the core and the whole network, and find that nodes belonging to the core prefer to connect nodes with high k-core values, rather than the high degrees ones. This work could provide new insights into the online social network analysis.     

Understanding Spatio-Temporal Variability in the Reproduction Ratio of the Bluetongue (BTV-1) Epidemic in Southern Spain (Andalusia) in 2007 Using Epidemic Trees

Andalusia (Southern Spain) is considered one of the main routes of introduction of bluetongue virus (BTV) into Europe, evidenced by a devastating epidemic caused by BTV-1 in 2007. Understanding the pattern and the drivers of BTV-1 spread in Andalusia is critical for effective detection and control of future epidemics. A long-standing metric for quantifying the behaviour of infectious diseases is the case-reproduction ratio (R_t), defined as the average number of secondary cases arising from a single infected case at time t (for t>0). Here we apply a method using epidemic trees to estimate the between-herd case reproduction ratio directly from epidemic data allowing the spatial and temporal variability in transmission to be described. We then relate this variability to predictors describing the hosts, vectors and the environment to better understand why the epidemic spread more quickly in some regions or periods. The R_t value for the BTV-1 epidemic in Andalusia peaked in July at 4.6, at the start of the epidemic, then decreased to 2.2 by August, dropped below 1 by September (0.8), and by October it had decreased to 0.02. BTV spread was the consequence of both local transmission within established disease foci and BTV expansion to distant new areas (i.e. new foci), which resulted in a high variability in BTV transmission, not only among different areas, but particularly through time, which suggests that general control measures applied at broad spatial scales are unlikely to be effective. This high variability through time was probably due to the impact of temperature on BTV transmission, as evidenced by a reduction in the value of R_t by 0.0041 for every unit increase (day) in the extrinsic incubation period (EIP), which is itself directly dependent on temperature. Moreover, within the range of values at which BTV-1 transmission occurred in Andalusia (20.6°C to 29.5°C) there was a positive correlation between temperature and R_t values, although the relationship was not linear, probably as a result of the complex relationship between temperature and the different parameters affecting BTV transmission. R_t values for BTV-1 in Andalusia fell below the threshold of 1 when temperatures dropped below 21°C, a much higher threshold than that reported in other BTV outbreaks, such as the BTV-8 epidemic in Northern Europe. This divergence may be explained by differences in the adaptation to temperature of the main vectors of the BTV-1 epidemic in Andalusia (Culicoides imicola) compared those of the BTV-8 epidemic in Northern Europe (Culicoides obsoletus). Importantly, we found that BTV transmission (R_t value) increased significantly in areas with higher densities of sheep. Our analysis also established that control of BTV-1 in Andalusia was complicated by the simultaneous establishment of several distant foci at the start of the epidemic, which may have been caused by several independent introductions of infected vectors from the North of Africa. We discuss the implications of these findings for BTV surveillance and control in this region of Europe.     

Robustness of Oscillatory Behavior in Correlated Networks

Understanding network robustness against failures of network units is useful for preventing large-scale breakdowns and damages in real-world networked systems. The tolerance of networked systems whose functions are maintained by collective dynamical behavior of the network units has recently been analyzed in the framework called dynamical robustness of complex networks. The effect of network structure on the dynamical robustness has been examined with various types of network topology, but the role of network assortativity, or degree–degree correlations, is still unclear. Here we study the dynamical robustness of correlated (assortative and disassortative) networks consisting of diffusively coupled oscillators. Numerical analyses for the correlated networks with Poisson and power-law degree distributions show that network assortativity enhances the dynamical robustness of the oscillator networks but the impact of network disassortativity depends on the detailed network connectivity. Furthermore, we theoretically analyze the dynamical robustness of correlated bimodal networks with two-peak degree distributions and show the positive impact of the network assortativity.     

Machine Learning Prediction of Cancer Cell Sensitivity to Drugs Based on Genomic and Chemical Properties

Predicting the response of a specific cancer to a therapy is a major goal in modern oncology that should ultimately lead to a personalised treatment. High-throughput screenings of potentially active compounds against a panel of genomically heterogeneous cancer cell lines have unveiled multiple relationships between genomic alterations and drug responses. Various computational approaches have been proposed to predict sensitivity based on genomic features, while others have used the chemical properties of the drugs to ascertain their effect. In an effort to integrate these complementary approaches, we developed machine learning models to predict the response of cancer cell lines to drug treatment, quantified through IC₅₀ values, based on both the genomic features of the cell lines and the chemical properties of the considered drugs. Models predicted IC₅₀ values in a 8-fold cross-validation and an independent blind test with coefficient of determination R² of 0.72 and 0.64 respectively. Furthermore, models were able to predict with comparable accuracy (R² of 0.61) IC50s of cell lines from a tissue not used in the training stage. Our in silico models can be used to optimise the experimental design of drug-cell screenings by estimating a large proportion of missing IC₅₀ values rather than experimentally measuring them. The implications of our results go beyond virtual drug screening design: potentially thousands of drugs could be probed in silico to systematically test their potential efficacy as anti-tumour agents based on their structure, thus providing a computational framework to identify new drug repositioning opportunities as well as ultimately be useful for personalized medicine by linking the genomic traits of patients to drug sensitivity.     

The Rücker–Markov invariants of complex Bio-Systems: Applications in Parasitology and Neuroinformatics

Rücker's walk count (WC) indices are well-known topological indices (TIs) used in Chemoinformatics to quantify the molecular structure of drugs represented by a graph in Quantitative structure–activity/property relationship (QSAR/QSPR) studies. In this work, we introduce for the first time the higher-order (kth order) analogues (WC_k) of these indices using Markov chains. In addition, we report new QSPR models for large complex networks of different Bio-Systems useful in Parasitology and Neuroinformatics. The new type of QSPR models can be used for model checking to calculate numerical scores S(L_ij) for links L_ij (checking or re-evaluation of network connectivity) in large networks of all these fields. The method may be summarized as follows: (i) first, the WC_k(j) values are calculated for all jth nodes in a complex network already created; (ii) A linear discriminant analysis (LDA) is used to seek a linear equation that discriminates connected or linked (L_ij = 1) pairs of nodes experimentally confirmed from non-linked ones (L_ij = 0); (iii) The new model is validated with external series of pairs of nodes; (iv) The equation obtained is used to re-evaluate the connectivity quality of the network, connecting/disconnecting nodes based on the quality scores calculated with the new connectivity function. The linear QSPR models obtained yielded the following results in terms of overall test accuracy for re-construction of complex networks of different Bio-Systems: parasite–host networks (93.14%), NW Spain fasciolosis spreading networks (71.42/70.18%) and CoCoMac Brain Cortex co-activation network (86.40%). Thus, this work can contribute to the computational re-evaluation or model checking of connectivity (collation) in complex systems of any science field.     

Analyzing Self-Similar and Fractal Properties of the C. elegans Neural Network

The brain is one of the most studied and highly complex systems in the biological world. While much research has concentrated on studying the brain directly, our focus is the structure of the brain itself: at its core an interconnected network of nodes (neurons). A better understanding of the structural connectivity of the brain should elucidate some of its functional properties. In this paper we analyze the connectome of the nematode Caenorhabditis elegans. Consisting of only 302 neurons, it is one of the better-understood neural networks. Using a Laplacian Matrix of the 279-neuron “giant component” of the network, we use an eigenvalue counting function to look for fractal-like self similarity. This matrix representation is also used to plot visualizations of the neural network in eigenfunction coordinates. Small-world properties of the system are examined, including average path length and clustering coefficient. We test for localization of eigenfunctions, using graph energy and spacial variance on these functions. To better understand results, all calculations are also performed on random networks, branching trees, and known fractals, as well as fractals which have been “rewired” to have small-world properties. We propose algorithms for generating Laplacian matrices of each of these graphs.     

EEG-Based Functional Brain Networks: Does the Network Size Matter?

Functional connectivity in human brain can be represented as a network using electroencephalography (EEG) signals. These networks--whose nodes can vary from tens to hundreds--are characterized by neurobiologically meaningful graph theory metrics. This study investigates the degree to which various graph metrics depend upon the network size. To this end, EEGs from 32 normal subjects were recorded and functional networks of three different sizes were extracted. A state-space based method was used to calculate cross-correlation matrices between different brain regions. These correlation matrices were used to construct binary adjacency connectomes, which were assessed with regards to a number of graph metrics such as clustering coefficient, modularity, efficiency, economic efficiency, and assortativity. We showed that the estimates of these metrics significantly differ depending on the network size. Larger networks had higher efficiency, higher assortativity and lower modularity compared to those with smaller size and the same density. These findings indicate that the network size should be considered in any comparison of networks across studies.     

Inferring Epidemiological Dynamics with Bayesian Coalescent Inference: The Merits of Deterministic and Stochastic Models

Estimation of epidemiological and population parameters from molecular sequence data has become central to the understanding of infectious disease dynamics. Various models have been proposed to infer details of the dynamics that describe epidemic progression. These include inference approaches derived from Kingman’s coalescent theory. Here, we use recently described coalescent theory for epidemic dynamics to develop stochastic and deterministic coalescent susceptible–infected–removed (SIR) tree priors. We implement these in a Bayesian phylogenetic inference framework to permit joint estimation of SIR epidemic parameters and the sample genealogy. We assess the performance of the two coalescent models and also juxtapose results obtained with a recently published birth–death-sampling model for epidemic inference. Comparisons are made by analyzing sets of genealogies simulated under precisely known epidemiological parameters. Additionally, we analyze influenza A (H1N1) sequence data sampled in the Canterbury region of New Zealand and HIV-1 sequence data obtained from known United Kingdom infection clusters. We show that both coalescent SIR models are effective at estimating epidemiological parameters from data with large fundamental reproductive number R₀ and large population size S₀. Furthermore, we find that the stochastic variant generally outperforms its deterministic counterpart in terms of error, bias, and highest posterior density coverage, particularly for smaller R₀ and S₀. However, each of these inference models is shown to have undesirable properties in certain circumstances, especially for epidemic outbreaks with R₀ close to one or with small effective susceptible populations.     

Hofmeister effects on activity and stability of alkaline phosphatase

We have studied the effects on alkaline phosphatase of adding high concentrations (normally 1.0 M) of simple salts. It is necessary to allow for significant effects of salts on the extinction coefficient of the reaction product, and on the apparent pH of the buffer. Both activity and stability of the enzyme correlate well with the Hofmeister series in terms of the salt's kosmotropic/chaotropic properties, which are assessed by the Jones–Dole viscosity B coefficients (B₊ for cations and B₋ for anions). The catalytic activity or V_max/K_m of the enzyme showed a bell-shaped relationship with the (B₋ − B₊) values of the salts present, being optimal with salts (such as NaCl, KCl, and KNO₃) where the anion and cation have similar kosmotropic/chaotropic properties. This effect is believed to be enzyme-specific and relates to the impact of both cations and anions on the enzyme's surface pH, active site, and catalytic mechanism. Anions play a more predominant role than cations in affecting enzyme stability. The rate of irreversible thermal inactivation is strongly reduced by addition of kosmotropic anions like SO₄²⁻ (half-life increased from 8 to 580 min at 60 °C). This effect is general and the mechanism probably involves the ability of the ions to affect the water solvation layer around the enzyme molecule and to interact with both the surface and internal structure of the enzyme.