Evolving Digital Ecological Networks

“It is hard to realize that the living world as we know it is just one among many possibilities” [1]. Evolving digital ecological networks are webs of interacting, self-replicating, and evolving computer programs (i.e., digital organisms) that experience the same major ecological interactions as biological organisms (e.g., competition, predation, parasitism, and mutualism). Despite being computational, these programs evolve quickly in an open-ended way, and starting from only one or two ancestral organisms, the formation of ecological networks can be observed in real-time by tracking interactions between the constantly evolving organism phenotypes. These phenotypes may be defined by combinations of logical computations (hereafter tasks) that digital organisms perform and by expressed behaviors that have evolved. The types and outcomes of interactions between phenotypes are determined by task overlap for logic-defined phenotypes and by responses to encounters in the case of behavioral phenotypes. Biologists use these evolving networks to study active and fundamental topics within evolutionary ecology (e.g., the extent to which the architecture of multispecies networks shape coevolutionary outcomes, and the processes involved).

This is a “Topic Page” article for PLOS Computational Biology.

     

Evolving Robust Gene Regulatory Networks

Design and implementation of robust network modules is essential for construction of complex biological systems through hierarchical assembly of ‘parts’ and ‘devices’. The robustness of gene regulatory networks (GRNs) is ascribed chiefly to the underlying topology. The automatic designing capability of GRN topology that can exhibit robust behavior can dramatically change the current practice in synthetic biology. A recent study shows that Darwinian evolution can gradually develop higher topological robustness. Subsequently, this work presents an evolutionary algorithm that simulates natural evolution in silico, for identifying network topologies that are robust to perturbations. We present a Monte Carlo based method for quantifying topological robustness and designed a fitness approximation approach for efficient calculation of topological robustness which is computationally very intensive. The proposed framework was verified using two classic GRN behaviors: oscillation and bistability, although the framework is generalized for evolving other types of responses. The algorithm identified robust GRN architectures which were verified using different analysis and comparison. Analysis of the results also shed light on the relationship among robustness, cooperativity and complexity. This study also shows that nature has already evolved very robust architectures for its crucial systems; hence simulation of this natural process can be very valuable for designing robust biological systems.     

Evolving sensitivity balances Boolean Networks

We investigate the sensitivity of Boolean Networks (BNs) to mutations. We are interested in Boolean Networks as a model of Gene Regulatory Networks (GRNs). We adopt Ribeiro and Kauffman's Ergodic Set and use it to study the long term dynamics of a BN. We define the sensitivity of a BN to be the mean change in its Ergodic Set structure under all possible loss of interaction mutations. In silico experiments were used to selectively evolve BNs for sensitivity to losing interactions. We find that maximum sensitivity was often achievable and resulted in the BNs becoming topologically balanced, i.e. they evolve towards network structures in which they have a similar number of inhibitory and excitatory interactions. In terms of the dynamics, the dominant sensitivity strategy that evolved was to build BNs with Ergodic Sets dominated by a single long limit cycle which is easily destabilised by mutations. We discuss the relevance of our findings in the context of Stem Cell Differentiation and propose a relationship between pluripotent stem cells and our evolved sensitive networks.     

Generating Attributed Networks with Communities

In many modern applications data is represented in the form of nodes and their relationships, forming an information network. When nodes are described with a set of attributes we have an attributed network. Nodes and their relationships tend to naturally form into communities or clusters, and discovering these communities is paramount to many applications. Evaluating algorithms or comparing algorithms for automatic discovery of communities requires networks with known structures. Synthetic generators of networks have been proposed for this task but most solely focus on connectivity and their properties and overlook attribute values and the network properties vis-à-vis these attributes. In this paper, we propose a new generator for attributed networks with community structure that dependably follows the properties of real world networks.     

Emergence of Multiplex Communities in Collaboration Networks

Community structures in collaboration networks reflect the natural tendency of individuals to organize their work in groups in order to better achieve common goals. In most of the cases, individuals exploit their connections to introduce themselves to new areas of interests, giving rise to multifaceted collaborations which span different fields. In this paper, we analyse collaborations in science and among movie actors as multiplex networks, where the layers represent respectively research topics and movie genres, and we show that communities indeed coexist and overlap at the different layers of such systems. We then propose a model to grow multiplex networks based on two mechanisms of intra and inter-layer triadic closure which mimic the real processes by which collaborations evolve. We show that our model is able to explain the multiplex community structure observed empirically, and we infer the strength of the two underlying social mechanisms from real-world systems. Being also able to correctly reproduce the values of intra-layer and inter-layer assortativity correlations, the model contributes to a better understanding of the principles driving the evolution of social networks.     

QuIN: A Web Server for Querying and Visualizing Chromatin Interaction Networks

Recent studies of the human genome have indicated that regulatory elements (e.g. promoters and enhancers) at distal genomic locations can interact with each other via chromatin folding and affect gene expression levels. Genomic technologies for mapping interactions between DNA regions, e.g., ChIA-PET and HiC, can generate genome-wide maps of interactions between regulatory elements. These interaction datasets are important resources to infer distal gene targets of non-coding regulatory elements and to facilitate prioritization of critical loci for important cellular functions. With the increasing diversity and complexity of genomic information and public ontologies, making sense of these datasets demands integrative and easy-to-use software tools. Moreover, network representation of chromatin interaction maps enables effective data visualization, integration, and mining. Currently, there is no software that can take full advantage of network theory approaches for the analysis of chromatin interaction datasets. To fill this gap, we developed a web-based application, QuIN, which enables: 1) building and visualizing chromatin interaction networks, 2) annotating networks with user-provided private and publicly available functional genomics and interaction datasets, 3) querying network components based on gene name or chromosome location, and 4) utilizing network based measures to identify and prioritize critical regulatory targets and their direct and indirect interactions. AVAILABILITY: QuIN’s web server is available at http://quin.jax.org QuIN is developed in Java and JavaScript, utilizing an Apache Tomcat web server and MySQL database and the source code is available under the GPLV3 license available on GitHub: https://github.com/UcarLab/QuIN/.

This is a PLOS Computational Biology Software paper.

     

Bursts of Vertex Activation and Epidemics in Evolving Networks

The dynamic nature of contact patterns creates diverse temporal structures. In particular, empirical studies have shown that contact patterns follow heterogeneous inter-event time intervals, meaning that periods of high activity are followed by long periods of inactivity. To investigate the impact of these heterogeneities in the spread of infection from a theoretical perspective, we propose a stochastic model to generate temporal networks where vertices make instantaneous contacts following heterogeneous inter-event intervals, and may leave and enter the system. We study how these properties affect the prevalence of an infection and estimate , the number of secondary infections of an infectious individual in a completely susceptible population, by modeling simulated infections (SI and SIR) that co-evolve with the network structure. We find that heterogeneous contact patterns cause earlier and larger epidemics in the SIR model in comparison to homogeneous scenarios for a vast range of parameter values, while smaller epidemics may happen in some combinations of parameters. In the case of SI and heterogeneous patterns, the epidemics develop faster in the earlier stages followed by a slowdown in the asymptotic limit. For increasing vertex turnover rates, heterogeneous patterns generally cause higher prevalence in comparison to homogeneous scenarios with the same average inter-event interval. We find that is generally higher for heterogeneous patterns, except for sufficiently large infection duration and transmission probability.     

Lipopolysaccharide Diversity Evolving in Helicobacter pylori Communities through Genetic Modifications in Fucosyltransferases

Helicobacter pylori persistently colonizes the gastric mucosa of half the human population. It is one of the most genetically diverse bacterial organisms and subvariants are continuously emerging within an H. pylori population. In this study we characterized a number of single-colony isolates from H. pylori communities in various environmental settings, namely persistent human gastric infection, in vitro bacterial subcultures on agar medium, and experimental in vivo infection in mice. The lipopolysaccharide (LPS) O-antigen chain revealed considerable phenotypic diversity between individual cells in the studied bacterial communities, as demonstrated by size variable O-antigen chains and different levels of Lewis glycosylation. Absence of high-molecular-weight O-antigen chains was notable in a number of experimentally passaged isolates in vitro and in vivo. This phenotype was not evident in bacteria obtained from a human gastric biopsy, where all cells expressed high-molecular-weight O-antigen chains, which thus may be the preferred phenotype for H. pylori colonizing human gastric mucosa. Genotypic variability was monitored in the two genes encoding α1,3-fucosyltransferases, futA and futB, that are involved in Lewis antigen expression. Genetic modifications that could be attributable to recombination events within and between the two genes were commonly detected and created a diversity, which together with phase variation, contributed to divergent LPS expression. Our data suggest that the surrounding environment imposes a selective pressure on H. pylori to express certain LPS phenotypes. Thus, the milieu in a host will select for bacterial variants with particular characteristics that facilitate adaptation and survival in the gastric mucosa of that individual, and will shape the bacterial community structure.     

Information Networks in Amenity Transition Communities: A Comparative Case Study

Amenity transition, a major socio demographic trend in areas rich in natural resources, is characterized by economic and population growth as a result of retirement in-migration, increased rates of second home ownership, and increases in the number of industries that do not need to be proximate to a specific geographic location. Amenity transition is also characterized by increased intra-community conflict between long-term residents and in-migrants. This research analyzes whether the population growth accompanying amenity transition is associated with variations in the structure and characteristics of intra-community informational networks, as sociological theory would suggest. Methodologically, this is accomplished through a comparative analysis of the structure and characteristics of informational networks in three communities undergoing amenity transition. The analyses suggest population density is not related to either the structure of informational networks or the concentration of trust/distrust within them. When considered in conjunction with previous empirical work, these findings suggest the conflicts associated with amenity transition are more likely to arise because of conflicting value systems and ideologies as opposed to social structural changes in the communities themselves.     

Inferring Meaningful Communities from Topology-Constrained Correlation Networks

Community structure detection is an important tool in graph analysis. This can be done, among other ways, by solving for the partition set which optimizes the modularity scores . Here it is shown that topological constraints in correlation graphs induce over-fragmentation of community structures. A refinement step to this optimization based on Linear Discriminant Analysis (LDA) and a statistical test for significance is proposed. In structured simulation constrained by topology, this novel approach performs better than the optimization of modularity alone. This method was also tested with two empirical datasets: the Roll-Call voting in the 110th US Senate constrained by geographic adjacency, and a biological dataset of 135 protein structures constrained by inter-residue contacts. The former dataset showed sub-structures in the communities that revealed a regional bias in the votes which transcend party affiliations. This is an interesting pattern given that the 110th Legislature was assumed to be a highly polarized government. The -amylase catalytic domain dataset (biological dataset) was analyzed with and without topological constraints (inter-residue contacts). The results without topological constraints showed differences with the topology constrained one, but the LDA filtering did not change the outcome of the latter. This suggests that the LDA filtering is a robust way to solve the possible over-fragmentation when present, and that this method will not affect the results where there is no evidence of over-fragmentation.     

Stability of Multispecies Bacterial Communities: Signaling Networks May Stabilize Microbiomes

Multispecies bacterial communities can be remarkably stable and resilient even though they consist of cells and species that compete for environmental resources. In silico models suggest that common signals released into the environment may help selected bacterial species cluster at common locations and that sharing of public goods (i.e. molecules produced and released for mutual benefit) can stabilize this coexistence. In contrast, unilateral eavesdropping on signals produced by a potentially invading species may protect a community by keeping invaders away from limited resources. Shared bacterial signals, such as those found in quorum sensing systems, may thus play a key role in fine tuning competition and cooperation within multi-bacterial communities. We suggest that in addition to metabolic complementarity, signaling dynamics may be important in further understanding complex bacterial communities such as the human, animal as well as plant microbiomes.     

Mapping Yoruba Networks: Power and Agency in the Making of Transnational Communities

Mapping Yoruba Networks: Power and Agency in the Making of Transnational Communities . Kamari Maxine Clarke. Durham, NC: Duke University Press, 2004. 345 pp.     

Coevolution of Quantum and Classical Strategies on Evolving Random Networks

We study the coevolution of quantum and classical strategies on weighted and directed random networks in the realm of the prisoner’s dilemma game. During the evolution, agents can break and rewire their links with the aim of maximizing payoffs, and they can also adjust the weights to indicate preferences, either positive or negative, towards their neighbors. The network structure itself is thus also subject to evolution. Importantly, the directionality of links does not affect the accumulation of payoffs nor the strategy transfers, but serves only to designate the owner of each particular link and with it the right to adjust the link as needed. We show that quantum strategies outperform classical strategies, and that the critical temptation to defect at which cooperative behavior can be maintained rises, if the network structure is updated frequently. Punishing neighbors by reducing the weights of their links also plays an important role in maintaining cooperation under adverse conditions. We find that the self-organization of the initially random network structure, driven by the evolutionary competition between quantum and classical strategies, leads to the spontaneous emergence of small average path length and a large clustering coefficient.     

Energy Spectral Behaviors of Communication Networks of Open-Source Communities

Large-scale online collaborative production activities in open-source communities must be accompanied by large-scale communication activities. Nowadays, the production activities of open-source communities, especially their communication activities, have been more and more concerned. Take CodePlex C # community for example, this paper constructs the complex network models of 12 periods of communication structures of the community based on real data; then discusses the basic concepts of quantum mapping of complex networks, and points out that the purpose of the mapping is to study the structures of complex networks according to the idea of quantum mechanism in studying the structures of large molecules; finally, according to this idea, analyzes and compares the fractal features of the spectra in different quantum mappings of the networks, and concludes that there are multiple self-similarity and criticality in the communication structures of the community. In addition, this paper discusses the insights and application conditions of different quantum mappings in revealing the characteristics of the structures. The proposed quantum mapping method can also be applied to the structural studies of other large-scale organizations.     

Identifying Communities and Key Vertices by Reconstructing Networks from Samples

Sampling techniques such as Respondent-Driven Sampling (RDS) are widely used in epidemiology to sample “hidden” populations, such that properties of the network can be deduced from the sample. We consider how similar techniques can be designed that allow the discovery of the structure, especially the community structure, of networks. Our method involves collecting samples of a network by random walks and reconstructing the network by probabilistically coalescing vertices, using vertex attributes to determine the probabilities. Even though our method can only approximately reconstruct a part of the original network, it can recover its community structure relatively well. Moreover, it can find the key vertices which, when immunized, can effectively reduce the spread of an infection through the original network.     

Evaluating Communities of Practice and Knowledge Networks: A Systematic Scoping Review of Evaluation Frameworks

Communities of Practice (CoPs) are increasingly considered a part of ecohealth and other sectors such as health care, education, and business. However, there is little agreement on approaches to evaluate the influence and effectiveness of CoPs. The purpose of this review was to understand what frameworks and methods have been proposed or used to evaluate CoPs and/or knowledge networks. The review searched electronic databases in interdisciplinary, health, education, and business fields, and further collected references and forward citations from relevant articles. Nineteen articles with 16 frameworks were included in the synthesis. The purposes of the evaluation frameworks varied; while some focused on assessing the performance of CoPs, several frameworks sought to learn about CoPs and their critical success factors. Nine of the frameworks had been applied or tested in some way, most frequently to guide a case study. With limited applications of the frameworks, strong claims about generalizability could not be made. The review results can inform the development of tailored frameworks. However, there is a need for more detailed and targeted CoP evaluation frameworks, as many imperative CoP evaluation needs would be unmet by the available frameworks.