Do scale-free regulatory networks allow more expression than random ones?

In this paper, we compile the network of software packages with regulatory interactions (dependences and conflicts) from Debian GNU/Linux operating system and use it as an analogy for a gene regulatory network. Using a trace-back algorithm we assemble networks from the pool of packages with both scale-free (real data) and exponential (null model) topologies. We record the maximum number of packages that can be functionally installed in the system (i.e., the active network size). We show that scale-free regulatory networks allow a larger active network size than random ones. This result might have implications for the number of expressed genes at steady state. Small genomes with scale-free regulatory topologies could allow much more expression than large genomes with exponential topologies. This may have implications for the dynamics, robustness and evolution of genomes.     

Simulating the evolution of signal transduction pathways

We use a generic model of a network of proteins that can activate or deactivate each other to explore the emergence and evolution of signal transduction networks and to gain a basic understanding of their general properties. Starting with a set of non-interacting proteins, we evolve a signal transduction network by random mutation and selection to fulfill a complex biological task. In order to validate this approach we base selection on a fitness function that captures the essential features of chemotactic behavior as seen in bacteria. We find that a system of as few as three proteins can evolve into a network mediating chemotaxis-like behavior by acting as a "derivative sensor". Furthermore, we find that the dynamics and topology of such networks show many similarities to the natural chemotaxis pathway, that the response magnitude can increase with increasing network size and that network behavior shows robustness towards variations in some of the internal parameters. We conclude that simulating the evolution of signal transduction networks to mediate a certain behavior may be a promising approach for understanding the general properties of the natural pathway for that behavior.     

On the long-run sensitivity of probabilistic Boolean networks

Boolean networks and, more generally, probabilistic Boolean networks, as one class of gene regulatory networks, model biological processes with the network dynamics determined by the logic-rule regulatory functions in conjunction with probabilistic parameters involved in network transitions. While there has been significant research on applying different control policies to alter network dynamics as future gene therapeutic intervention, we have seen less work on understanding the sensitivity of network dynamics with respect to perturbations to networks, including regulatory rules and the involved parameters, which is particularly critical for the design of intervention strategies. This paper studies this less investigated issue of network sensitivity in the long run. As the underlying model of probabilistic Boolean networks is a finite Markov chain, we define the network sensitivity based on the steady-state distributions of probabilistic Boolean networks and call it long-run sensitivity. The steady-state distribution reflects the long-run behavior of the network and it can give insight into the dynamics or momentum existing in a system. The change of steady-state distribution caused by possible perturbations is the key measure for intervention. This newly defined long-run sensitivity can provide insight on both network inference and intervention. We show the results for probabilistic Boolean networks generated from random Boolean networks and the results from two real biological networks illustrate preliminary applications of sensitivity in intervention for practical problems.     

Modelling the evolution of genetic regulatory networks

An evolutionary model of genetic regulatory networks is developed, based on a model of network encoding and dynamics called the Artificial Genome (AG). This model derives a number of specific genes and their interactions from a string of (initially random) bases in an idealized manner analogous to that employed by natural DNA. The gene expression dynamics are determined by updating the gene network as if it were a simple Boolean network. The generic behaviour of the AG model is investigated in detail. In particular, we explore the characteristic network topologies generated by the model, their dynamical behaviours, and the typical variance of network connectivities and network structures. These properties are demonstrated to agree with a probabilistic analysis of the model, and the typical network structures generated by the model are shown to lie between those of random networks and scale-free networks in terms of their degree distribution. Evolutionary processes are simulated using a genetic algorithm, with selection acting on a range of properties from gene number and degree of connectivity through periodic behaviour to specific patterns of gene expression. The evolvability of increasingly complex patterns of gene expression is examined in detail. When a degree of redundancy is introduced, the average number of generations required to evolve given targets is reduced, but limits on evolution of complex gene expression patterns remain. In addition, cyclic gene expression patterns with periods that are multiples of shorter expression patterns are shown to be inherently easier to evolve than others. Constraints imposed by the template-matching nature of the AG model generate similar biases towards such expression patterns in networks in initial populations, in addition to the somewhat scale-free nature of these networks. The significance of these results on current understanding of biological evolution is discussed.     

DyRAM: An Active Reliable Multicast Framework for Data Distribution

Group communications (multicast) are foreseen to be one of the most critical yet challenging technologies to meet the exponentially growing demands for data distribution in a large variety of applications of the Internet (such as grid computing, web applications and distributed simulations). When reliability is required, there is no straightforward solutions and meeting the objectives of reliable multicast is not an easy task. Active networks open a new perspective in providing more efficient solutions for the problem of reliability. In this context, routers are able to perform customized computations on the packets flowing through them. In this paper, we propose a receiver-based (replier) local recovery multicast protocol with dynamic repliers elected on a per-packet basis. Designed to provide an efficient reliable multicast service without any cache facilities inside the network, our approach, uses low-overhead active services in routers. The current paper addresses the design, evaluation and the implementation of an efficient and scalable reliable multicast protocol noted DyRAM standing for Dynamic Replier Active reliable multicast.     

Dynamical patterns of epidemic outbreaks in complex heterogeneous networks

We present a thorough inspection of the dynamical behavior of epidemic phenomena in populations with complex and heterogeneous connectivity patterns. We show that the growth of the epidemic prevalence is virtually instantaneous in all networks characterized by diverging degree fluctuations, independently of the structure of the connectivity correlation functions characterizing the population network. By means of analytical and numerical results, we show that the outbreak time evolution follows a precise hierarchical dynamics. Once reached the most highly connected hubs, the infection pervades the network in a progressive cascade across smaller degree classes. Finally, we show the influence of the initial conditions and the relevance of statistical results in single case studies concerning heterogeneous networks. The emerging theoretical framework appears of general interest in view of the recently observed abundance of natural networks with complex topological features and might provide useful insights for the development of adaptive strategies aimed at epidemic containment.     

Graph theoretical analysis of functional brain networks: test-retest evaluation on short- and long-term resting-state functional MRI data

Graph-based computational network analysis has proven a powerful tool to quantitatively characterize functional architectures of the brain. However, the test-retest (TRT) reliability of graph metrics of functional networks has not been systematically examined. Here, we investigated TRT reliability of topological metrics of functional brain networks derived from resting-state functional magnetic resonance imaging data. Specifically, we evaluated both short-term (<1 hour apart) and long-term (>5 months apart) TRT reliability for 12 global and 6 local nodal network metrics. We found that reliability of global network metrics was overall low, threshold-sensitive and dependent on several factors of scanning time interval (TI, long-term>short-term), network membership (NM, networks excluding negative correlations>networks including negative correlations) and network type (NT, binarized networks>weighted networks). The dependence was modulated by another factor of node definition (ND) strategy. The local nodal reliability exhibited large variability across nodal metrics and a spatially heterogeneous distribution. Nodal degree was the most reliable metric and varied the least across the factors above. Hub regions in association and limbic/paralimbic cortices showed moderate TRT reliability. Importantly, nodal reliability was robust to above-mentioned four factors. Simulation analysis revealed that global network metrics were extremely sensitive (but varying degrees) to noise in functional connectivity and weighted networks generated numerically more reliable results in compared with binarized networks. For nodal network metrics, they showed high resistance to noise in functional connectivity and no NT related differences were found in the resistance. These findings provide important implications on how to choose reliable analytical schemes and network metrics of interest.     

A genotype network reveals homoplastic cycles of convergent evolution in influenza A (H3N2) haemagglutinin

Networks of evolving genotypes can be constructed from the worldwide time-resolved genotyping of pathogens like influenza viruses. Such genotype networks are graphs where neighbouring vertices (viral strains) differ in a single nucleotide or amino acid. A rich trove of network analysis methods can help understand the evolutionary dynamics reflected in the structure of these networks. Here, I analyse a genotype network comprising hundreds of influenza A (H3N2) haemagglutinin genes. The network is rife with cycles that reflect non-random parallel or convergent (homoplastic) evolution. These cycles also show patterns of sequence change characteristic for strong and local evolutionary constraints, positive selection and mutation-limited evolution. Such cycles would not be visible on a phylogenetic tree, illustrating that genotype network analysis can complement phylogenetic analyses. The network also shows a distinct modular or community structure that reflects temporal more than spatial proximity of viral strains, where lowly connected bridge strains connect different modules. These and other organizational patterns illustrate that genotype networks can help us study evolution in action at an unprecedented level of resolution.     

"Immunetworks", intersecting circuits and dynamics

This paper proposes a study of biological regulation networks based on a multi-level strategy. Given a network, the first structural level of this strategy consists in analysing the architecture of the network interactions in order to describe it. The second dynamical level consists in relating the patterns found in the architecture to the possible dynamical behaviours of the network. It is known that circuits are the patterns that play the most important part in the dynamics of a network in the sense that they are responsible for the diversity of its asymptotic behaviours. Here, we pursue further this idea and argue that beyond the influence of underlying circuits, intersections of circuits also impact significantly on the dynamics of a network and thus need to be payed special attention to. For some genetic regulation networks involved in the control of the immune system (“immunetworks”), we show that the small number of attractors can be explained by the presence, in the underlying structures of these networks, of intersecting circuits that “inter-lock”.     

Modelling evolutionary cell behaviour using neural networks: Application to tumour growth

In this paper, we present a modelling framework for cellular evolution that is based on the notion that a cell’s behaviour is driven by interactions with other cells and its immediate environment. We equip each cell with a phenotype that determines its behaviour and implement a decision mechanism to allow evolution of this phenotype. This decision mechanism is modelled using feed-forward neural networks, which have been suggested as suitable models of cell signalling pathways. The environmental variables are presented as inputs to the network and result in a response that corresponds to the phenotype of the cell. The response of the network is determined by the network parameters, which are subject to mutations when the cells divide. This approach is versatile as there are no restrictions on what the input or output nodes represent, they can be chosen to represent any environmental variables and behaviours that are of importance to the cell population under consideration. This framework was implemented in an individual-based model of solid tumour growth in order to investigate the impact of the tissue oxygen concentration on the growth and evolutionary dynamics of the tumour. Our results show that the oxygen concentration affects the tumour at the morphological level, but more importantly has a direct impact on the evolutionary dynamics. When the supply of oxygen is limited we observe a faster divergence away from the initial genotype, a higher population diversity and faster evolution towards aggressive phenotypes. The implementation of this framework suggests that this approach is well suited for modelling systems where evolution plays an important role and where a changing environment exerts selection pressure on the evolving population.     

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses

The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure.     

A linear model for characterization of synchronization frequencies of neural networks

The synchronization frequency of neural networks and its dynamics have important roles in deciphering the working mechanisms of the brain. It has been widely recognized that the properties of functional network synchronization and its dynamics are jointly determined by network topology, network connection strength, i.e., the connection strength of different edges in the network, and external input signals, among other factors. However, mathematical and computational characterization of the relationships between network synchronization frequency and these three important factors are still lacking. This paper presents a novel computational simulation framework to quantitatively characterize the relationships between neural network synchronization frequency and network attributes and input signals. Specifically, we constructed a series of neural networks including simulated small-world networks, real functional working memory network derived from functional magnetic resonance imaging, and real large-scale structural brain networks derived from diffusion tensor imaging, and performed synchronization simulations on these networks via the Izhikevich neuron spiking model. Our experiments demonstrate that both of the network synchronization strength and synchronization frequency change according to the combination of input signal frequency and network self-synchronization frequency. In particular, our extensive experiments show that the network synchronization frequency can be represented via a linear combination of the network self-synchronization frequency and the input signal frequency. This finding could be attributed to an intrinsically-preserved principle in different types of neural systems, offering novel insights into the working mechanism of neural systems.     

Balanced networks under spike-time dependent plasticity

The dynamics of local cortical networks are irregular, but correlated. Dynamic excitatory–inhibitory balance is a plausible mechanism that generates such irregular activity, but it remains unclear how balance is achieved and maintained in plastic neural networks. In particular, it is not fully understood how plasticity induced changes in the network affect balance, and in turn, how correlated, balanced activity impacts learning. How do the dynamics of balanced networks change under different plasticity rules? How does correlated spiking activity in recurrent networks change the evolution of weights, their eventual magnitude, and structure across the network? To address these questions, we develop a theory of spike–timing dependent plasticity in balanced networks. We show that balance can be attained and maintained under plasticity–induced weight changes. We find that correlations in the input mildly affect the evolution of synaptic weights. Under certain plasticity rules, we find an emergence of correlations between firing rates and synaptic weights. Under these rules, synaptic weights converge to a stable manifold in weight space with their final configuration dependent on the initial state of the network. Lastly, we show that our framework can also describe the dynamics of plastic balanced networks when subsets of neurons receive targeted optogenetic input.     

The evolutionary dynamics of evolvability in a gene network model

Evolvability, the ability of populations to adapt, has recently emerged as a major unifying concept in biology. Although the study of evolvability offers new insights into many important biological questions, the conceptual bases of evolvability, and the mechanisms of its evolution, remain controversial. We used simulated evolution of a model of gene network dynamics to test the contentious hypothesis that natural selection can favour high evolvability, in particular in sexual populations. Our results conclusively demonstrate that fluctuating natural selection can increase the capacity of model gene networks to adapt to new environments. Detailed studies of the evolutionary dynamics of these networks establish a broad range of validity for this result and quantify the evolutionary forces responsible for changes in evolvability. Analysis of the genotype–phenotype map of these networks also reveals mechanisms connecting evolvability, genetic architecture and robustness. Our results suggest that the evolution of evolvability can have a pervasive influence on many aspects of organisms.     

The role of log-normal dynamics in the evolution of biochemical pathways

The study of the scale-free topology in non-biological and biological networks and the dynamics that can explain this fascinating property of complex systems have captured the attention of the scientific community in the last years. Here, we analyze the biochemical pathways of three organisms (Methanococcus jannaschii, Escherichia coli, Saccharomyces cerevisiae) which are representatives of the main kingdoms Archaea, Bacteria and Eukaryotes during the course of the biological evolution. We can consider two complementary representations of the biochemical pathways: the enzymes network and the chemical compounds network. In this article, we propose a stochastic model that explains that the scale-free topology with exponent in the vicinity of gamma approximately 3/2 found across these three organisms is governed by the log-normal dynamics in the evolution of the enzymes network. Precisely, the fluctuations of the connectivity degree of enzymes in the biochemical pathways between evolutionary distant organisms follow the same conserved dynamical principle, which in the end is the origin of the stationary scale-free distribution observed among species, from Archaea to Eukaryotes. In particular, the log-normal dynamics guarantees the conservation of the scale-free distribution in evolving networks. Furthermore, the log-normal dynamics also gives a possible explanation for the restricted range of observed exponents gamma in the scale-free networks (i.e., gamma > or = 3/2). Finally, our model is also applied to the chemical compounds network of biochemical pathways and the Internet network.     

Unifying facilitation and recruitment networks

Ecological network studies are providing important advances about the organization, stability and dynamics of ecological systems. However, the ecological networks approach is being integrated very slowly in plant community ecology, even though the first studies on plant facilitation networks (FNs) were published more than a decade ago. The study of interaction networks between established plants and plants recruiting beneath them, which we call Recruitment Networks (RNs), can provide new insights on mechanisms driving plant community structure and dynamics. RNs basically describe which plants recruit under which others, so they can be seen as a generalisation of the classic FNs since they do not imply any particular effect (positive, negative or neutral) of the established plants on recruiting ones. RNs summarise information on the structure of sapling banks. More importantly, the information included in RNs can be incorporated into models of replacement dynamics to evaluate how different aspects of network structure, or different mechanisms of network assembly, may affect plant community stability and species coexistence. To allow an efficient development of the study of FNs and RNs, here we unify concepts, synthesise current knowledge, clarify some conceptual issues, and propose basic methodological guidelines to standardise sampling methods that could make future studies of these networks directly comparable.     

Asymptotic states and topological structure of an activation-deactivation chemical network

The influence of the topology on the asymptotic states of a network of interacting chemical species has been studied by simulating its time evolution. Random and scale-free networks have been designed to support relevant features of activation-deactivation reactions networks (mapping signal transduction networks) and the system of ordinary differential equations associated to the dynamics has been numerically solved. We analysed stationary states of the dynamics as a function of the network's connectivity and of the distribution of the chemical species on the network; we found important differences between the two topologies in the regime of low connectivity. In particular, only for low connected scale-free networks it is possible to find zero activity patterns as stationary states of the dynamics which work as signal off-states. Asymptotic features of random and scale-free networks become similar as the connectivity increases.     

Temporal variation in structural properties of tropical plant-herbivore networks: The role of climatic factors

Plant herbivore interactions can be influenced by abiotic factors such as climate or resource availability. Nevertheless, the influence of climatic variation on the temporal dynamics of plant-herbivore networks has been scarcely studied. In this study we evaluated the influence of temperature and precipitation on the structure and selectiveness of plant-herbivore networks associated to a seasonal tropical ecosystem in the Gulf of Mexico. Although a significant turnover was observed in plant and herbivore species across seasons, high modularity and selectivity of the networks remained relatively constant despite the temporal variation in climatic variables. However, precipitation and temperature was negatively associated with niche overlap for herbivores and positively related to evenness of network interactions. In other words, less stressful conditions are likely to promote the diversification in the use of resources by herbivores, and increase evenness of interactions in the network. An increase in niche overlap and a decrease in the evenness of interactions during the driest and coldest months could be promoted by the presence of less specialized herbivores when availability and quality of host resources is lower.We suggest that the constancy in network selectiveness and modularity facilitates the coexistence of species through the fine distribution of niches and the equitable distribution of food resources in periods of greater precipitation and temperature, when the availability of host plants is greater. Overall, we show for the first time how abiotic factors can influence the emergent structural properties of an antagonistic tropical plant-herbivore network.