Scaling of differentiation in networks: nervous systems,organisms, ant colonies,ecosystems, businesses,universities, cities,electronic circuits,and Legos

Nodes in networks are often of different types, and in this sense networks are differentiated. Here we examine the relationship between network differentiation and network size in networks under economic or natural selective pressure, such as electronic circuits (networks of electronic components), Legos (networks of Lego pieces), businesses (networks of employees), universities (networks of faculty), organisms (networks of cells), ant colonies (networks of ants), and nervous systems (networks of neurons). For each of these we find that (i) differentiation increases with network size, and (ii) the relationship is consistent with a power law. These results are explained by a hypothesis that, because nodes are costly to build and maintain in such "selected networks", network size is optimized, and from this the power-law relationship may be derived. The scaling exponent depends on the particular kind of network, and is determined by the degree to which nodes are used in a combinatorial fashion to carry out network-level functions. We find that networks under natural selection (organisms, ant colonies, and nervous systems) have much higher combinatorial abilities than the networks for which human ingenuity is involved (electronic circuits, Legos, businesses, and universities). A distinct but related optimization hypothesis may be used to explain scaling of differentiation in competitive networks (networks where the nodes themselves, rather than the entire network, are under selective pressure) such as ecosystems (networks of organisms).     

Hydrophobic, hydrophilic, and charged amino acid networks within protein

The native three-dimensional structure of a single protein is determined by the physicochemical nature of its constituent amino acids. The 20 different types of amino acids, depending on their physicochemical properties, can be grouped into three major classes: hydrophobic, hydrophilic, and charged. The anatomy of the weighted and unweighted networks of hydrophobic, hydrophilic, and charged residues separately for a large number of proteins were studied. Results showed that the average degree of the hydrophobic networks has a significantly larger value than that of hydrophilic and charged networks. The average degree of the hydrophilic networks is slightly higher than that of the charged networks. The average strength of the nodes of hydrophobic networks is nearly equal to that of the charged network, whereas that of hydrophilic networks has a smaller value than that of hydrophobic and charged networks. The average strength for each of the three types of networks varies with its degree. The average strength of a node in a charged network increases more sharply than that of the hydrophobic and hydrophilic networks. Each of the three types of networks exhibits the "small-world" property. Our results further indicate that the all-amino-acids networks and hydrophobic networks are of assortative type. Although most of the hydrophilic and charged networks are of the assortative type, few others have the characteristics of disassortative mixing of the nodes. We have further observed that all-amino-acids networks and hydrophobic networks bear the signature of hierarchy, whereas the hydrophilic and charged networks do not have any hierarchical signature.     

On the Relationships between Generative Encodings,Regularity, and Learning Abilities when Evolving Plastic Artificial Neural Networks

A major goal of bio-inspired artificial intelligence is to design artificial neural networks with abilities that resemble those of animal nervous systems. It is commonly believed that two keys for evolving nature-like artificial neural networks are (1) the developmental process that links genes to nervous systems, which enables the evolution of large, regular neural networks, and (2) synaptic plasticity, which allows neural networks to change during their lifetime. So far, these two topics have been mainly studied separately. The present paper shows that they are actually deeply connected. Using a simple operant conditioning task and a classic evolutionary algorithm, we compare three ways to encode plastic neural networks: a direct encoding, a developmental encoding inspired by computational neuroscience models, and a developmental encoding inspired by morphogen gradients (similar to HyperNEAT). Our results suggest that using a developmental encoding could improve the learning abilities of evolved, plastic neural networks. Complementary experiments reveal that this result is likely the consequence of the bias of developmental encodings towards regular structures: (1) in our experimental setup, encodings that tend to produce more regular networks yield networks with better general learning abilities; (2) whatever the encoding is, networks that are the more regular are statistically those that have the best learning abilities.     

Bioinformatics analysis of protein interaction networks: Statistics, topologies, and meeting the standards of experimental biologists

In recent years, bioinformatics analyses of protein networks have allowed researchers to obtain exceptional theoretical predictions and subsequent experimental confirmations. The current view is that protein networks are scale-free networks and have a topology analogous to that of transport networks, the Internet, and social networks. However, an alternative hypothesis exists in which protein networks and scale-free networks possess significantly different properties. In this work, we show that existing information is insufficient to describe protein networks as scale-free networks.     

Phylogenetic networks: modeling, reconstructibility, and accuracy

Phylogenetic networks model the evolutionary history of sets of organisms when events such as hybrid speciation and horizontal gene transfer occur. In spite of their widely acknowledged importance in evolutionary biology, phylogenetic networks have so far been studied mostly for specific data sets. We present a general definition of phylogenetic networks in terms of directed acyclic graphs (DAGs) and a set of conditions. Further, we distinguish between model networks and reconstructible ones and characterize the effect of extinction and taxon sampling on the reconstructibility of the network. Simulation studies are a standard technique for assessing the performance of phylogenetic methods. A main step in such studies entails quantifying the topological error between the model and inferred phylogenies. While many measures of tree topological accuracy have been proposed, none exist for phylogenetic networks. Previously, we proposed the first such measure, which applied only to a restricted class of networks. In this paper, we extend that measure to apply to all networks, and prove that it is a metric on the space of phylogenetic networks. Our results allow for the systematic study of existing network methods, and for the design of new accurate ones.     

Stoichiometric design of metabolic networks: multifunctionality,clusters, optimization,weak and strong robustness

Starting from a limited set of reactions describing changes in the carbon skeleton of biochemical compounds complete sets of metabolic networks are constructed. The networks are characterized by the number and types of participating reactions. Elementary networks are defined by the condition that a specific chemical conversion can be performed by a set of given reactions and that this ability will be lost by elimination of any of these reactions. Groups of networks are identified with respect to their ability to perform a certain number of metabolic conversions in an elementary way which are called the network’s functions. The number of the network functions defines the degree of multifunctionality. Transitions between networks and mutations of networks are defined by exchanges of single reactions. Different mutations exist such as gain or loss of function mutations and neutral mutations. Based on these mutations neighbourhood relations between networks are established which are described in a graph theoretical way. Basic properties of these graphs are determined such as diameter, connectedness, distance distribution of pairs of vertices. A concept is developed to quantify the robustness of networks against changes in their stoichiometry where we distinguish between strong and weak robustness. Evolutionary algorithms are applied to study the development of network populations under constant and time dependent environmental conditions. It is shown that the populations evolve toward clusters of networks performing a common function and which are closely neighboured. Under changing environmental conditions multifunctional networks prove to be optimal and will be selected.     

General Relationship of Global Topology,Local Dynamics,and Directionality in Large-Scale Brain Networks

The balance of global integration and functional specialization is a critical feature of efficient brain networks, but the relationship of global topology, local node dynamics and information flow across networks has yet to be identified. One critical step in elucidating this relationship is the identification of governing principles underlying the directionality of interactions between nodes. Here, we demonstrate such principles through analytical solutions based on the phase lead/lag relationships of general oscillator models in networks. We confirm analytical results with computational simulations using general model networks and anatomical brain networks, as well as high-density electroencephalography collected from humans in the conscious and anesthetized states. Analytical, computational, and empirical results demonstrate that network nodes with more connections (i.e., higher degrees) have larger amplitudes and are directional targets (phase lag) rather than sources (phase lead). The relationship of node degree and directionality therefore appears to be a fundamental property of networks, with direct applicability to brain function. These results provide a foundation for a principled understanding of information transfer across networks and also demonstrate that changes in directionality patterns across states of human consciousness are driven by alterations of brain network topology.     

Testing for treeness: lateral gene transfer,phylogenetic inference,and model selection

A phylogeny that allows for lateral gene transfer (LGT) can be thought of as a strictly branching tree (all of whose branches are vertical) to which lateral branches have been added. Given that the goal of phylogenetics is to depict evolutionary history, we should look for the best supported phylogenetic network and not restrict ourselves to considering trees. However, the obvious extensions of popular tree-based methods such as maximum parsimony and maximum likelihood face a serious problem—if we judge networks by fit to data alone, networks that have lateral branches will always fit the data at least as well as any network that restricts itself to vertical branches. This is analogous to the well-studied problem of overfitting data in the curve-fitting problem. Analogous problems often have analogous solutions and we propose to treat network inference as a case of model selection and use the Akaike Information Criterion (AIC). Strictly tree-like networks are more parsimonious than those that postulate lateral as well as vertical branches. This leads to the conclusion that we should not always infer LGT events whenever it would improve our fit-to-data, but should do so only when the improved fit is larger than the penalty for adding extra lateral branches.     

Theory of interface: Category theory,directed networks and evolution of biological networks

Biological networks have two modes. The first mode is static: a network is a passage on which something flows. The second mode is dynamic: a network is a pattern constructed by gluing functions of entities constituting the network. In this paper, first we discuss that these two modes can be associated with the category theoretic duality (adjunction) and derive a natural network structure (a path notion) for each mode by appealing to the category theoretic universality. The path notion corresponding to the static mode is just the usual directed path. The path notion for the dynamic mode is called lateral path which is the alternating path considered on the set of arcs. Their general functionalities in a network are transport and coherence, respectively. Second, we introduce a betweenness centrality of arcs for each mode and see how the two modes are embedded in various real biological network data. We find that there is a trade-off relationship between the two centralities: if the value of one is large then the value of the other is small. This can be seen as a kind of division of labor in a network into transport on the network and coherence of the network. Finally, we propose an optimization model of networks based on a quality function involving intensities of the two modes in order to see how networks with the above trade-off relationship can emerge through evolution. We show that the trade-off relationship can be observed in the evolved networks only when the dynamic mode is dominant in the quality function by numerical simulations. We also show that the evolved networks have features qualitatively similar to real biological networks by standard complex network analysis.     

Simulations of dynamically cross-linked actin networks: Morphology,rheology, and hydrodynamic interactions

Cross-linked actin networks are the primary component of the cell cytoskeleton and have been the subject of numerous experimental and modeling studies. While these studies have demonstrated that the networks are viscoelastic materials, evolving from elastic solids on short timescales to viscous fluids on long ones, questions remain about the duration of each asymptotic regime, the role of the surrounding fluid, and the behavior of the networks on intermediate timescales. Here we perform detailed simulations of passively cross-linked non-Brownian actin networks to quantify the principal timescales involved in the elastoviscous behavior, study the role of nonlocal hydrodynamic interactions, and parameterize continuum models from discrete stochastic simulations. To do this, we extend our recent computational framework for semiflexible filament suspensions, which is based on nonlocal slender body theory, to actin networks with dynamic cross linkers and finite filament lifetime. We introduce a model where the cross linkers are elastic springs with sticky ends stochastically binding to and unbinding from the elastic filaments, which randomly turn over at a characteristic rate. We show that, depending on the parameters, the network evolves to a steady state morphology that is either an isotropic actin mesh or a mesh with embedded actin bundles. For different degrees of bundling, we numerically apply small-amplitude oscillatory shear deformation to extract three timescales from networks of hundreds of filaments and cross linkers. We analyze the dependence of these timescales, which range from the order of hundredths of a second to the actin turnover time of several seconds, on the dynamic nature of the links, solvent viscosity, and filament bending stiffness. We show that the network is mostly elastic on the short time scale, with the elasticity coming mainly from the cross links, and viscous on the long time scale, with the effective viscosity originating primarily from stretching and breaking of the cross links. We show that the influence of nonlocal hydrodynamic interactions depends on the network morphology: for homogeneous meshworks, nonlocal hydrodynamics gives only a small correction to the viscous behavior, but for bundled networks it both hinders the formation of bundles and significantly lowers the resistance to shear once bundles are formed. We use our results to construct three-timescale generalized Maxwell models of the networks.     

The brainstem reticular formation is a small-world, not scale-free, network

Recently, it has been demonstrated that several complex systems may have simple graph-theoretic characterizations as so-called 'small-world' and 'scale-free' networks. These networks have also been applied to the gross neural connectivity between primate cortical areas and the nervous system of Caenorhabditis elegans. Here, we extend this work to a specific neural circuit of the vertebrate brain--the medial reticular formation (RF) of the brainstem--and, in doing so, we have made three key contributions. First, this work constitutes the first model (and quantitative review) of this important brain structure for over three decades. Second, we have developed the first graph-theoretic analysis of vertebrate brain connectivity at the neural network level. Third, we propose simple metrics to quantitatively assess the extent to which the networks studied are small-world or scale-free. We conclude that the medial RF is configured to create small-world (implying coherent rapid-processing capabilities), but not scale-free, type networks under assumptions which are amenable to quantitative measurement.     

Immigration,remittances, and transnational social capital formation: a Cuban case study

Social capital takes on distinctive meaning in the context of large-scale immigration from poor to rich countries. In this article, characteristics of social capital embedded in transnational networks and norms, conditions conducive to the formation of such networks, and effects such networks have are extrapolated from an analysis of how and why cross-border relations among Cuban-Americans and Cubans in their homeland have changed since the 1959 Castro-led revolution. The transnational social capital generating benefit on which the study focuses is remittances. Remittances are of growing global importance to less developed countries, and in some countries they generate more revenue than foreign aid and foreign investment. The analysis addresses a range of unintended as well as intended consequences remittances may have.     

Dopamine in motivational control: rewarding, aversive, and alerting

Midbrain dopamine neurons are well known for their strong responses to rewards and their critical role in?positive motivation. It has become increasingly clear, however, that dopamine neurons also transmit signals related to salient but nonrewarding experiences such as aversive and alerting events. Here we review recent advances in understanding the reward and nonreward functions of dopamine. Based on this data, we propose that dopamine neurons come in multiple types that are connected with distinct brain networks and have distinct roles in motivational control. Some dopamine neurons encode motivational value, supporting brain networks for seeking, evaluation, and value learning. Others encode motivational salience, supporting brain networks for orienting, cognition, and general motivation. Both types of dopamine neurons are augmented by an alerting signal involved in rapid detection of potentially important sensory cues. We hypothesize that these dopaminergic pathways for value, salience, and alerting cooperate to support adaptive behavior.     

Protein interaction networks of Saccharomyces cerevisiae, Caenorhabditis elegans and Drosophila melanogaster: large-scale organization and robustness

High-throughput screens have begun to reveal protein interaction networks in several organisms. To understand the general properties of these protein interaction networks, a systematic analysis of topological structure and robustness was performed on the protein interaction networks of Saccharomyces cerevisiae, Caenorhabditis elegans and Drosophila melanogaster. It shows that the three protein interaction networks have a scale-free and high-degree clustering nature as the consequence of their hierarchical organization. It also shows that they have the small-world property with similar diameter at 4-5. Evaluation of the consequences of random removal of both proteins and interactions from the protein interaction networks suggests their high degree of robustness. Simulation of a protein's removal shows that the protein interaction network's error tolerance is accompanied by attack vulnerability. These fundamental analyses of the networks might serve as a starting point for further exploring complex biological networks and the coming research of "systems biology".     

Motif-Role-Fingerprints: The Building-Blocks of Motifs,Clustering-Coefficients and Transitivities in Directed Networks

Complex networks are frequently characterized by metrics for which particular subgraphs are counted. One statistic from this category, which we refer to as motif-role fingerprints, differs from global subgraph counts in that the number of subgraphs in which each node participates is counted. As with global subgraph counts, it can be important to distinguish between motif-role fingerprints that are ‘structural’ (induced subgraphs) and ‘functional’ (partial subgraphs). Here we show mathematically that a vector of all functional motif-role fingerprints can readily be obtained from an arbitrary directed adjacency matrix, and then converted to structural motif-role fingerprints by multiplying that vector by a specific invertible conversion matrix. This result demonstrates that a unique structural motif-role fingerprint exists for any given functional motif-role fingerprint. We demonstrate a similar result for the cases of functional and structural motif-fingerprints without node roles, and global subgraph counts that form the basis of standard motif analysis. We also explicitly highlight that motif-role fingerprints are elemental to several popular metrics for quantifying the subgraph structure of directed complex networks, including motif distributions, directed clustering coefficient, and transitivity. The relationships between each of these metrics and motif-role fingerprints also suggest new subtypes of directed clustering coefficients and transitivities. Our results have potential utility in analyzing directed synaptic networks constructed from neuronal connectome data, such as in terms of centrality. Other potential applications include anomaly detection in networks, identification of similar networks and identification of similar nodes within networks. Matlab code for calculating all stated metrics following calculation of functional motif-role fingerprints is provided as S1 Matlab File.     

Explaining Industrial Symbiosis Emergence,Development, and Disruption: A Multilevel Analytical Framework

Industrial symbiosis (IS) is the process by which by‐products are revalorized and exchanged among distinct business entities. The literature suggests that IS can bring financial, social, and environmental benefits to firms and society. Analytical tools have been developed for uncovering IS arrangements and guidelines suggested for designing IS arrangements where they do not yet exist. Despite these suggested benefits and in spite of these tools, few planned IS arrangements have successfully materialized, with notable exceptions in East Asia. Understanding why IS networks emerge and expand or falter requires both macro‐ and micro‐level analysis. Some explanatory factors have been extensively covered in the IS literature, such as the important role of coordinating organizations. But the analysis of enterprise‐level actions and strategies as well as the conditions in the external environment that act on the enterprises and the network are not as well examined. The article outlines an analytical framework that draws upon insights from research on cleaner production, corporate social responsibility, diffusion of innovation, and the role of the state in development. The framework is consistent with the view that the evolution of IS networks is characterized by “equifinality.” Different networks may achieve IS as a result of quite different combinations of factors. No general theory of IS success or decline is offered because no such theory can be expected. IS emergence, development, and disruption is approached as a problem of sociohistorical analysis. For such phenomena, analytical frameworks provide a common explanatory starting point, but no predictive power.     

Modeling for evolving biological networks with scale-free connectivity, hierarchical modularity, and disassortativity

We propose a growing network model that consists of two tunable mechanisms: growth by merging modules which are represented as complete graphs and a fitness-driven preferential attachment. Our model exhibits the three prominent statistical properties are widely shared in real biological networks, for example gene regulatory, protein-protein interaction, and metabolic networks. They retain three power law relationships, such as the power laws of degree distribution, clustering spectrum, and degree-degree correlation corresponding to scale-free connectivity, hierarchical modularity, and disassortativity, respectively. After making comparisons of these properties between model networks and biological networks, we confirmed that our model has inference potential for evolutionary processes of biological networks.