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.     

Intrinsic properties of Boolean dynamics in complex networks

We study intrinsic properties of attractor in Boolean dynamics of complex networks with scale-free topology, comparing with those of the so-called Kauffman's random Boolean networks. We numerically study both frozen and relevant nodes in each attractor in the dynamics of relatively small networks (20?N?200). We investigate numerically robustness of an attractor to a perturbation. An attractor with cycle length of ?_c in a network of size N consists of ?_c states in the state space of 2^N states; each attractor has the arrangement of N nodes, where the cycle of attractor sweeps ?_c states. We define a perturbation as a flip of the state on a single node in the attractor state at a given time step. We show that the rate between unfrozen and relevant nodes in the dynamics of a complex network with scale-free topology is larger than that in Kauffman's random Boolean network model. Furthermore, we find that in a complex scale-free network with fluctuation of the in-degree number, attractors are more sensitive to a state flip for a highly connected node (i.e. input-hub node) than to that for a less connected node. By some numerical examples, we show that the number of relevant nodes increases, when an input-hub node is coincident with and/or connected with an output-hub node (i.e. a node with large output-degree) one another.     

Time-Dependent Increase in Network Response to Stimulation

In vitro neuronal cultures have become a popular method with which to probe network-level neuronal dynamics and phenomena in controlled laboratory settings. One of the key dynamics of interest in these in vitro studies has been the extent to which cultured networks display properties indicative of learning. Here we demonstrate the effects of a high frequency electrical stimulation signal in training cultured networks of cortical neurons. Networks receiving this training signal displayed a time-dependent increase in the response to a low frequency probing stimulation, particularly in the time window of 20–50 ms after stimulation. This increase was found to be statistically significant as compared to control networks that did not receive training. The timing of this increase suggests potentiation of synaptic mechanisms. To further investigate this possibility, we leveraged the powerful Cox statistical connectivity method as previously investigated by our group. This method was used to identify and track changes in network connectivity strength.     

Reconstructing gene regulatory networks: from random to scale-free connectivity

The manipulation of organisms using combinations of gene knockout, RNAi and drug interaction experiments can be used to reveal regulatory interactions between genes. Several algorithms have been proposed that try to reconstruct the underlying regulatory networks from gene expression data sets arising from such experiments. Often these approaches assume that each gene has approximately the same number of interactions within the network, and the methods rely on prior knowledge, or the investigator's best guess, of the average network connectivity. Recent evidence points to scale-free properties in biological networks, however, where network connectivity follows a power-law distribution. For scale-free networks, the average number of regulatory interactions per gene does not satisfactorily characterise the network. With this in mind, a new reverse engineering approach is introduced that does not require prior knowledge of network connectivity and its performance is compared with other published algorithms using simulated gene expression data with biologically relevant network structures. Because this new approach does not make any assumptions about the distribution of network connections, it is suitable for application to scale-free networks.     

Graph theoretical analysis of complex networks in the brain

Since the discovery of small-world and scale-free networks the study of complex systems from a network perspective has taken an enormous flight. In recent years many important properties of complex networks have been delineated. In particular, significant progress has been made in understanding the relationship between the structural properties of networks and the nature of dynamics taking place on these networks. For instance, the 'synchronizability' of complex networks of coupled oscillators can be determined by graph spectral analysis. These developments in the theory of complex networks have inspired new applications in the field of neuroscience. Graph analysis has been used in the study of models of neural networks, anatomical connectivity, and functional connectivity based upon fMRI, EEG and MEG. These studies suggest that the human brain can be modelled as a complex network, and may have a small-world structure both at the level of anatomical as well as functional connectivity. This small-world structure is hypothesized to reflect an optimal situation associated with rapid synchronization and information transfer, minimal wiring costs, as well as a balance between local processing and global integration. The topological structure of functional networks is probably restrained by genetic and anatomical factors, but can be modified during tasks. There is also increasing evidence that various types of brain disease such as Alzheimer's disease, schizophrenia, brain tumours and epilepsy may be associated with deviations of the functional network topology from the optimal small-world pattern.     

Fine scale spatial genetic structure of two syntopic newts across a network of ponds: implications for conservation

In this study we used genetic approaches to assess the influence of landscape features on the dispersal patterns and genetic structure of two newt species (Triturus macedonicus and Lissotriton vulgaris) living syntopically in a network of ponds. Multilocus genotypes were used to detect and measure genetic variation patterns, population genetic structure and levels of gene flow. We interpret results on the basis of the different dispersal properties of the two species and explored the influence of certain landscape features, such as road and channel networks, on population connectivity. We found marked differences in the spatial genetic patterns of the respective species, which can be explained by their different dispersal properties. The road network seems to act as a barrier to dispersal in the overland dispersing L. vulgaris, while the channel network maintains connectivity in the aquatic dispersing T. macedonicus. The simultaneous and comparative consideration of species in a given area offers a much better understanding of the processes that govern population dynamics and persistence, providing valuable knowledge useful in conservation and management design.     

Active colonization dynamics and diversity patterns are influenced by dendritic network connectivity and species interactions

Habitat network connectivity influences colonization dynamics, species invasions, and biodiversity patterns. Recent theoretical work suggests dendritic networks, such as those found in rivers, alter expectations regarding colonization and dispersal dynamics compared with other network types. As many native and non‐native species are spreading along river networks, this may have important ecological implications. However, experimental studies testing the effects of network structure on colonization and diversity patterns are scarce. Up to now, experimental studies have only considered networks where sites are connected with small corridors, or dispersal was experimentally controlled, which eliminates possible effects of species interactions on colonization dynamics. Here, we tested the effect of network connectivity and species interactions on colonization dynamics using continuous linear and dendritic (i.e., river‐like) networks, which allow for active dispersal. We used a set of six protist species and one rotifer species in linear and dendritic microcosm networks. At the start of the experiment, we introduced species, either singularly or as a community within the networks. Species subsequently actively colonized the networks. We periodically measured densities of species throughout the networks over 2 weeks to track community dynamics, colonization, and diversity patterns. We found that colonization of dendritic networks was faster compared with colonization of linear networks, which resulted in higher local mean species richness in dendritic networks. Initially, community similarity was also greater in dendritic networks compared with linear networks, but this effect vanished over time. The presence of species interactions increased community evenness over time, compared with extrapolations from single‐species setups. Our experimental findings confirm previous theoretical work and show that network connectivity, species‐specific dispersal ability, and species interactions greatly influence the dispersal and colonization of dendritic networks. We argue that these factors need to be considered in empirical studies, where effects of network connectivity on colonization patterns have been largely underestimated.     

Spatial network structure and metapopulation persistence

We explore the relationship between network structure and dynamics by relating the topology of spatial networks with its underlying metapopulation abundance. Metapopulation abundance is largely affected by the architecture of the spatial network, although this effect depends on demographic parameters here represented by the extinction-to-colonization ratio (e/c). Thus, for moderate to large e/c-values, regional abundance grows with the heterogeneity of the network, with uniform or random networks having the lowest regional abundances, and scale-free networks having the largest abundance. However, the ranking is reversed for low extinction probabilities, with heterogeneous networks showing the lowest relative abundance. We further explore the mechanisms underlying such results by relating a node's incidence (average number of time steps the node is occupied) with its degree, and with the average degree of the nodes it interacts with. These results demonstrate the importance of spatial network structure to understanding metapopulation abundance, and serve to determine under what circumstances information on network structure should be complemented with information on the species life-history traits to understand persistence in heterogeneous environments.     

Evolution of competitive ability: an adaptation speed vs. accuracy tradeoff rooted in gene network size

Ecologists have increasingly come to understand that evolutionary change on short time-scales can alter ecological dynamics (and vice-versa), and this idea is being incorporated into community ecology research programs. Previous research has suggested that the size and topology of the gene network underlying a quantitative trait should constrain or facilitate adaptation and thereby alter population dynamics. Here, I consider a scenario in which two species with different genetic architectures compete and evolve in fluctuating environments. An important trade-off emerges between adaptive accuracy and adaptive speed, driven by the size of the gene network underlying the ecologically-critical trait and the rate of environmental change. Smaller, scale-free networks confer a competitive advantage in rapidly-changing environments, but larger networks permit increased adaptive accuracy when environmental change is sufficiently slow to allow a species time to adapt. As the differences in network characteristics increase, the time-to-resolution of competition decreases. These results augment and refine previous conclusions about the ecological implications of the genetic architecture of quantitative traits, emphasizing a role of adaptive accuracy. Along with previous work, in particular that considering the role of gene network connectivity, these results provide a set of expectations for what we may observe as the field of ecological genomics develops.     

Traveling and Pinned Fronts in Bistable Reaction-Diffusion Systems on Networks

Traveling fronts and stationary localized patterns in bistable reaction-diffusion systems have been broadly studied for classical continuous media and regular lattices. Analogs of such non-equilibrium patterns are also possible in networks. Here, we consider traveling and stationary patterns in bistable one-component systems on random Erdös-Rényi, scale-free and hierarchical tree networks. As revealed through numerical simulations, traveling fronts exist in network-organized systems. They represent waves of transition from one stable state into another, spreading over the entire network. The fronts can furthermore be pinned, thus forming stationary structures. While pinning of fronts has previously been considered for chains of diffusively coupled bistable elements, the network architecture brings about significant differences. An important role is played by the degree (the number of connections) of a node. For regular trees with a fixed branching factor, the pinning conditions are analytically determined. For large Erdös-Rényi and scale-free networks, the mean-field theory for stationary patterns is constructed.     

Translated Chemical Reaction Networks

Many biochemical and industrial applications involve complicated networks of simultaneously occurring chemical reactions. Under the assumption of mass action kinetics, the dynamics of these chemical reaction networks are governed by systems of polynomial ordinary differential equations. The steady states of these mass action systems have been analyzed via a variety of techniques, including stoichiometric network analysis, deficiency theory, and algebraic techniques (e.g., Gröbner bases). In this paper, we present a novel method for characterizing the steady states of mass action systems. Our method explicitly links a network’s capacity to permit a particular class of steady states, called toric steady states, to topological properties of a generalized network called a translated chemical reaction network. These networks share their reaction vectors with their source network but are permitted to have different complex stoichiometries and different network topologies. We apply the results to examples drawn from the biochemical literature.     

Copying nodes versus editing links: the source of the difference between genetic regulatory networks and the WWW

We study two kinds of networks: genetic regulatory networks and the World Wide Web. We systematically test microscopic mechanisms to find the set of such mechanisms that optimally explain each networks' specific properties. In the first case we formulate a model including mainly random unbiased gene duplications and mutations. In the second case, the basic moves are website generation and rapid surf-induced link creation (/destruction). The different types of mechanisms reproduce the appropriate observed network properties. We use those to show that different kinds of networks have strongly system-dependent macroscopic experimental features. The diverging properties result from dissimilar node and link basic dynamics. The main non-uniform properties include the clustering coefficient, small-scale motifs frequency, time correlations, centrality and the connectivity of outgoing links. Some other features are generic such as the large-scale connectivity distribution of incoming links (scale-free) and the network diameter (small-worlds). The common properties are just the general hallmark of autocatalysis (self-enhancing processes), while the specific properties hinge on the specific elementary mechanisms. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics Online.     

Chemical basis of metabolic network organization

Although the metabolic networks of the three domains of life consist of different constituents and metabolic pathways, they exhibit the same scale-free organization. This phenomenon has been hypothetically explained by preferential attachment principle that the new-recruited metabolites attach preferentially to those that are already well connected. However, since metabolites are usually small molecules and metabolic processes are basically chemical reactions, we speculate that the metabolic network organization may have a chemical basis. In this paper, chemoinformatic analyses on metabolic networks of Kyoto Encyclopedia of Genes and Genomes (KEGG), Escherichia coli and Saccharomyces cerevisiae were performed. It was found that there exist qualitative and quantitative correlations between network topology and chemical properties of metabolites. The metabolites with larger degrees of connectivity (hubs) are of relatively stronger polarity. This suggests that metabolic networks are chemically organized to a certain extent, which was further elucidated in terms of high concentrations required by metabolic hubs to drive a variety of reactions. This finding not only provides a chemical explanation to the preferential attachment principle for metabolic network expansion, but also has important implications for metabolic network design and metabolite concentration prediction.     

Synchrony and Asynchrony for Neuronal Dynamics Defined on Complex Networks

We describe and analyze a model for a stochastic pulse-coupled neuronal network with many sources of randomness: random external input, potential synaptic failure, and random connectivity topologies. We show that different classes of network topologies give rise to qualitatively different types of synchrony: uniform (Erdős–Rényi) and “small-world” networks give rise to synchronization phenomena similar to that in “all-to-all” networks (in which there is a sharp onset of synchrony as coupling is increased); in contrast, in “scale-free” networks the dependence of synchrony on coupling strength is smoother. Moreover, we show that in the uniform and small-world cases, the fine details of the network are not important in determining the synchronization properties; this depends only on the mean connectivity. In contrast, for scale-free networks, the dynamics are significantly affected by the fine details of the network; in particular, they are significantly affected by the local neighborhoods of the “hubs” in the network.     

Modelling disease spread and control in networks: implications for plant sciences

Networks are ubiquitous in natural, technological and social systems. They are of increasing relevance for improved understanding and control of infectious diseases of plants, animals and humans, given the interconnectedness of today's world. Recent modelling work on disease development in complex networks shows: the relative rapidity of pathogen spread in scale-free compared with random networks, unless there is high local clustering; the theoretical absence of an epidemic threshold in scale-free networks of infinite size, which implies that diseases with low infection rates can spread in them, but the emergence of a threshold when realistic features are added to networks (e.g. finite size, household structure or deactivation of links); and the influence on epidemic dynamics of asymmetrical interactions. Models suggest that control of pathogens spreading in scale-free networks should focus on highly connected individuals rather than on mass random immunization. A growing number of empirical applications of network theory in human medicine and animal disease ecology confirm the potential of the approach, and suggest that network thinking could also benefit plant epidemiology and forest pathology, particularly in human-modified pathosystems linked by commercial transport of plant and disease propagules. Potential consequences for the study and management of plant and tree diseases are discussed.     

A condition for cooperation in a game on complex networks

We study a condition of favoring cooperation in Prisoner's Dilemma game on complex networks. There are two kinds of players: cooperators and defectors. Cooperators pay a benefit b to their neighbors at a cost c, whereas defectors only receive a benefit. The game is a death-birth process with weak selection. Although it has been widely thought that b/c>〈k〉 is a condition of favoring cooperation (Ohtsuki et al., 2006), we find that b/c>〈k_nn〉 is the condition. We also show that among three representative networks, namely, regular, random, and scale-free, a regular network favors cooperation the most, whereas a scale-free network favors cooperation the least. In an ideal scale-free network, cooperation is never realized. Whether or not the scale-free network and network heterogeneity favor cooperation depends on the details of the game, although it is occasionally believed that these favor cooperation irrespective of the game structure.     

Complex cooperative networks from evolutionary preferential attachment

In spite of its relevance to the origin of complex networks, the interplay between form and function and its role during network formation remains largely unexplored. While recent studies introduce dynamics by considering rewiring processes of a pre-existent network, we study network growth and formation by proposing an evolutionary preferential attachment model, its main feature being that the capacity of a node to attract new links depends on a dynamical variable governed in turn by the node interactions. As a specific example, we focus on the problem of the emergence of cooperation by analyzing the formation of a social network with interactions given by the Prisoner's Dilemma. The resulting networks show many features of real systems, such as scale-free degree distributions, cooperative behavior and hierarchical clustering. Interestingly, results such as the cooperators being located mostly on nodes of intermediate degree are very different from the observations of cooperative behavior on static networks. The evolutionary preferential attachment mechanism points to an evolutionary origin of scale-free networks and may help understand similar feedback problems in the dynamics of complex networks by appropriately choosing the game describing the interaction of nodes.     

Emergence of Assortative Mixing between Clusters of Cultured Neurons

The analysis of the activity of neuronal cultures is considered to be a good proxy of the functional connectivity of in vivo neuronal tissues. Thus, the functional complex network inferred from activity patterns is a promising way to unravel the interplay between structure and functionality of neuronal systems. Here, we monitor the spontaneous self-sustained dynamics in neuronal cultures formed by interconnected aggregates of neurons (clusters). Dynamics is characterized by the fast activation of groups of clusters in sequences termed bursts. The analysis of the time delays between clusters'' activations within the bursts allows the reconstruction of the directed functional connectivity of the network. We propose a method to statistically infer this connectivity and analyze the resulting properties of the associated complex networks. Surprisingly enough, in contrast to what has been reported for many biological networks, the clustered neuronal cultures present assortative mixing connectivity values, meaning that there is a preference for clusters to link to other clusters that share similar functional connectivity, as well as a rich-club core, which shapes a ‘connectivity backbone’ in the network. These results point out that the grouping of neurons and the assortative connectivity between clusters are intrinsic survival mechanisms of the culture.