Breeding novel solutions in the brain: a model of Darwinian neurodynamics.

PubMed

Szilágyi, András; Zachar, István; Fedor, Anna; de Vladar, Harold P; Szathmáry, Eörs

2016-01-01

Background : The fact that surplus connections and neurons are pruned during development is well established. We complement this selectionist picture by a proof-of-principle model of evolutionary search in the brain, that accounts for new variations in theory space. We present a model for Darwinian evolutionary search for candidate solutions in the brain. Methods : We combine known components of the brain - recurrent neural networks (acting as attractors), the action selection loop and implicit working memory - to provide the appropriate Darwinian architecture. We employ a population of attractor networks with palimpsest memory. The action selection loop is employed with winners-share-all dynamics to select for candidate solutions that are transiently stored in implicit working memory. Results : We document two processes: selection of stored solutions and evolutionary search for novel solutions. During the replication of candidate solutions attractor networks occasionally produce recombinant patterns, increasing variation on which selection can act. Combinatorial search acts on multiplying units (activity patterns) with hereditary variation and novel variants appear due to (i) noisy recall of patterns from the attractor networks, (ii) noise during transmission of candidate solutions as messages between networks, and, (iii) spontaneously generated, untrained patterns in spurious attractors. Conclusions : Attractor dynamics of recurrent neural networks can be used to model Darwinian search. The proposed architecture can be used for fast search among stored solutions (by selection) and for evolutionary search when novel candidate solutions are generated in successive iterations. Since all the suggested components are present in advanced nervous systems, we hypothesize that the brain could implement a truly evolutionary combinatorial search system, capable of generating novel variants.

Evolutionary Wavelet Neural Network ensembles for breast cancer and Parkinson's disease prediction.

PubMed

Khan, Maryam Mahsal; Mendes, Alexandre; Chalup, Stephan K

2018-01-01

Wavelet Neural Networks are a combination of neural networks and wavelets and have been mostly used in the area of time-series prediction and control. Recently, Evolutionary Wavelet Neural Networks have been employed to develop cancer prediction models. The present study proposes to use ensembles of Evolutionary Wavelet Neural Networks. The search for a high quality ensemble is directed by a fitness function that incorporates the accuracy of the classifiers both independently and as part of the ensemble itself. The ensemble approach is tested on three publicly available biomedical benchmark datasets, one on Breast Cancer and two on Parkinson's disease, using a 10-fold cross-validation strategy. Our experimental results show that, for the first dataset, the performance was similar to previous studies reported in literature. On the second dataset, the Evolutionary Wavelet Neural Network ensembles performed better than all previous methods. The third dataset is relatively new and this study is the first to report benchmark results.

Evolutionary Wavelet Neural Network ensembles for breast cancer and Parkinson’s disease prediction

PubMed Central

Mendes, Alexandre; Chalup, Stephan K.

2018-01-01

Wavelet Neural Networks are a combination of neural networks and wavelets and have been mostly used in the area of time-series prediction and control. Recently, Evolutionary Wavelet Neural Networks have been employed to develop cancer prediction models. The present study proposes to use ensembles of Evolutionary Wavelet Neural Networks. The search for a high quality ensemble is directed by a fitness function that incorporates the accuracy of the classifiers both independently and as part of the ensemble itself. The ensemble approach is tested on three publicly available biomedical benchmark datasets, one on Breast Cancer and two on Parkinson’s disease, using a 10-fold cross-validation strategy. Our experimental results show that, for the first dataset, the performance was similar to previous studies reported in literature. On the second dataset, the Evolutionary Wavelet Neural Network ensembles performed better than all previous methods. The third dataset is relatively new and this study is the first to report benchmark results. PMID:29420578

Evolutionary fuzzy ARTMAP neural networks for classification of semiconductor defects.

PubMed

Tan, Shing Chiang; Watada, Junzo; Ibrahim, Zuwairie; Khalid, Marzuki

2015-05-01

Wafer defect detection using an intelligent system is an approach of quality improvement in semiconductor manufacturing that aims to enhance its process stability, increase production capacity, and improve yields. Occasionally, only few records that indicate defective units are available and they are classified as a minority group in a large database. Such a situation leads to an imbalanced data set problem, wherein it engenders a great challenge to deal with by applying machine-learning techniques for obtaining effective solution. In addition, the database may comprise overlapping samples of different classes. This paper introduces two models of evolutionary fuzzy ARTMAP (FAM) neural networks to deal with the imbalanced data set problems in a semiconductor manufacturing operations. In particular, both the FAM models and hybrid genetic algorithms are integrated in the proposed evolutionary artificial neural networks (EANNs) to classify an imbalanced data set. In addition, one of the proposed EANNs incorporates a facility to learn overlapping samples of different classes from the imbalanced data environment. The classification results of the proposed evolutionary FAM neural networks are presented, compared, and analyzed using several classification metrics. The outcomes positively indicate the effectiveness of the proposed networks in handling classification problems with imbalanced data sets.

The influence of tie strength on evolutionary games on networks: An empirical investigation

NASA Astrophysics Data System (ADS)

Buesser, Pierre; Peña, Jorge; Pestelacci, Enea; Tomassini, Marco

2011-11-01

Extending previous work on unweighted networks, we present here a systematic numerical investigation of standard evolutionary games on weighted networks. In the absence of any reliable model for generating weighted social networks, we attribute weights to links in a few ways supported by empirical data ranging from totally uncorrelated to weighted bipartite networks. The results of the extensive simulation work on standard complex network models show that, except in a case that does not seem to be common in social networks, taking the tie strength into account does not change in a radical manner the long-run steady-state behavior of the studied games. Besides model networks, we also included a real-life case drawn from a coauthorship network. In this case also, taking the weights into account only changes the results slightly with respect to the raw unweighted graph, although to draw more reliable conclusions on real social networks many more cases should be studied as these weighted networks become available.

Network Analysis of Protein Adaptation: Modeling the Functional Impact of Multiple Mutations

PubMed Central

Beleva Guthrie, Violeta; Masica, David L; Fraser, Andrew; Federico, Joseph; Fan, Yunfan; Camps, Manel; Karchin, Rachel

2018-01-01

Abstract The evolution of new biochemical activities frequently involves complex dependencies between mutations and rapid evolutionary radiation. Mutation co-occurrence and covariation have previously been used to identify compensating mutations that are the result of physical contacts and preserve protein function and fold. Here, we model pairwise functional dependencies and higher order interactions that enable evolution of new protein functions. We use a network model to find complex dependencies between mutations resulting from evolutionary trade-offs and pleiotropic effects. We present a method to construct these networks and to identify functionally interacting mutations in both extant and reconstructed ancestral sequences (Network Analysis of Protein Adaptation). The time ordering of mutations can be incorporated into the networks through phylogenetic reconstruction. We apply NAPA to three distantly homologous β-lactamase protein clusters (TEM, CTX-M-3, and OXA-51), each of which has experienced recent evolutionary radiation under substantially different selective pressures. By analyzing the network properties of each protein cluster, we identify key adaptive mutations, positive pairwise interactions, different adaptive solutions to the same selective pressure, and complex evolutionary trajectories likely to increase protein fitness. We also present evidence that incorporating information from phylogenetic reconstruction and ancestral sequence inference can reduce the number of spurious links in the network, whereas preserving overall network community structure. The analysis does not require structural or biochemical data. In contrast to function-preserving mutation dependencies, which are frequently from structural contacts, gain-of-function mutation dependencies are most commonly between residues distal in protein structure. PMID:29522102

Modeling evolution of crosstalk in noisy signal transduction networks

NASA Astrophysics Data System (ADS)

Tareen, Ammar; Wingreen, Ned S.; Mukhopadhyay, Ranjan

2018-02-01

Signal transduction networks can form highly interconnected systems within cells due to crosstalk between constituent pathways. To better understand the evolutionary design principles underlying such networks, we study the evolution of crosstalk for two parallel signaling pathways that arise via gene duplication. We use a sequence-based evolutionary algorithm and evolve the network based on two physically motivated fitness functions related to information transmission. We find that one fitness function leads to a high degree of crosstalk while the other leads to pathway specificity. Our results offer insights on the relationship between network architecture and information transmission for noisy biomolecular networks.

Extended evolution: A conceptual framework for integrating regulatory networks and niche construction

PubMed Central

Renn, Jürgen

2015-01-01

ABSTRACT This paper introduces a conceptual framework for the evolution of complex systems based on the integration of regulatory network and niche construction theories. It is designed to apply equally to cases of biological, social and cultural evolution. Within the conceptual framework we focus especially on the transformation of complex networks through the linked processes of externalization and internalization of causal factors between regulatory networks and their corresponding niches and argue that these are an important part of evolutionary explanations. This conceptual framework extends previous evolutionary models and focuses on several challenges, such as the path‐dependent nature of evolutionary change, the dynamics of evolutionary innovation and the expansion of inheritance systems. J. Exp. Zool. (Mol. Dev. Evol.) 324B: 565–577, 2015. © 2015 The Authors. Journal of Experimental Zoology Part B: Molecular and Developmental Evolution published by Wiley Periodicals, Inc. PMID:26097188

Social traits, social networks and evolutionary biology.

PubMed

Fisher, D N; McAdam, A G

2017-12-01

The social environment is both an important agent of selection for most organisms, and an emergent property of their interactions. As an aggregation of interactions among members of a population, the social environment is a product of many sets of relationships and so can be represented as a network or matrix. Social network analysis in animals has focused on why these networks possess the structure they do, and whether individuals' network traits, representing some aspect of their social phenotype, relate to their fitness. Meanwhile, quantitative geneticists have demonstrated that traits expressed in a social context can depend on the phenotypes and genotypes of interacting partners, leading to influences of the social environment on the traits and fitness of individuals and the evolutionary trajectories of populations. Therefore, both fields are investigating similar topics, yet have arrived at these points relatively independently. We review how these approaches are diverged, and yet how they retain clear parallelism and so strong potential for complementarity. This demonstrates that, despite separate bodies of theory, advances in one might inform the other. Techniques in network analysis for quantifying social phenotypes, and for identifying community structure, should be useful for those studying the relationship between individual behaviour and group-level phenotypes. Entering social association matrices into quantitative genetic models may also reduce bias in heritability estimates, and allow the estimation of the influence of social connectedness on trait expression. Current methods for measuring natural selection in a social context explicitly account for the fact that a trait is not necessarily the property of a single individual, something the network approaches have not yet considered when relating network metrics to individual fitness. Harnessing evolutionary models that consider traits affected by genes in other individuals (i.e. indirect genetic effects) provides the potential to understand how entire networks of social interactions in populations influence phenotypes and predict how these traits may evolve. By theoretical integration of social network analysis and quantitative genetics, we hope to identify areas of compatibility and incompatibility and to direct research efforts towards the most promising areas. Continuing this synthesis could provide important insights into the evolution of traits expressed in a social context and the evolutionary consequences of complex and nuanced social phenotypes. © 2017 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2017 European Society For Evolutionary Biology.

An Evolutionary Game Theory Model of Spontaneous Brain Functioning.

PubMed

Madeo, Dario; Talarico, Agostino; Pascual-Leone, Alvaro; Mocenni, Chiara; Santarnecchi, Emiliano

2017-11-22

Our brain is a complex system of interconnected regions spontaneously organized into distinct networks. The integration of information between and within these networks is a continuous process that can be observed even when the brain is at rest, i.e. not engaged in any particular task. Moreover, such spontaneous dynamics show predictive value over individual cognitive profile and constitute a potential marker in neurological and psychiatric conditions, making its understanding of fundamental importance in modern neuroscience. Here we present a theoretical and mathematical model based on an extension of evolutionary game theory on networks (EGN), able to capture brain's interregional dynamics by balancing emulative and non-emulative attitudes among brain regions. This results in the net behavior of nodes composing resting-state networks identified using functional magnetic resonance imaging (fMRI), determining their moment-to-moment level of activation and inhibition as expressed by positive and negative shifts in BOLD fMRI signal. By spontaneously generating low-frequency oscillatory behaviors, the EGN model is able to mimic functional connectivity dynamics, approximate fMRI time series on the basis of initial subset of available data, as well as simulate the impact of network lesions and provide evidence of compensation mechanisms across networks. Results suggest evolutionary game theory on networks as a new potential framework for the understanding of human brain network dynamics.

Homophyly/Kinship Model: Naturally Evolving Networks

NASA Astrophysics Data System (ADS)

Li, Angsheng; Li, Jiankou; Pan, Yicheng; Yin, Xianchen; Yong, Xi

2015-10-01

It has been a challenge to understand the formation and roles of social groups or natural communities in the evolution of species, societies and real world networks. Here, we propose the hypothesis that homophyly/kinship is the intrinsic mechanism of natural communities, introduce the notion of the affinity exponent and propose the homophyly/kinship model of networks. We demonstrate that the networks of our model satisfy a number of topological, probabilistic and combinatorial properties and, in particular, that the robustness and stability of natural communities increase as the affinity exponent increases and that the reciprocity of the networks in our model decreases as the affinity exponent increases. We show that both homophyly/kinship and reciprocity are essential to the emergence of cooperation in evolutionary games and that the homophyly/kinship and reciprocity determined by the appropriate affinity exponent guarantee the emergence of cooperation in evolutionary games, verifying Darwin’s proposal that kinship and reciprocity are the means of individual fitness. We propose the new principle of structure entropy minimisation for detecting natural communities of networks and verify the functional module property and characteristic properties by a healthy tissue cell network, a citation network, some metabolic networks and a protein interaction network.

Homophyly/Kinship Model: Naturally Evolving Networks

PubMed Central

Li, Angsheng; Li, Jiankou; Pan, Yicheng; Yin, Xianchen; Yong, Xi

2015-01-01

It has been a challenge to understand the formation and roles of social groups or natural communities in the evolution of species, societies and real world networks. Here, we propose the hypothesis that homophyly/kinship is the intrinsic mechanism of natural communities, introduce the notion of the affinity exponent and propose the homophyly/kinship model of networks. We demonstrate that the networks of our model satisfy a number of topological, probabilistic and combinatorial properties and, in particular, that the robustness and stability of natural communities increase as the affinity exponent increases and that the reciprocity of the networks in our model decreases as the affinity exponent increases. We show that both homophyly/kinship and reciprocity are essential to the emergence of cooperation in evolutionary games and that the homophyly/kinship and reciprocity determined by the appropriate affinity exponent guarantee the emergence of cooperation in evolutionary games, verifying Darwin’s proposal that kinship and reciprocity are the means of individual fitness. We propose the new principle of structure entropy minimisation for detecting natural communities of networks and verify the functional module property and characteristic properties by a healthy tissue cell network, a citation network, some metabolic networks and a protein interaction network. PMID:26478264

Reticulate evolutionary history and extensive introgression in mosquito species revealed by phylogenetic network analysis

PubMed Central

Wen, Dingqiao; Yu, Yun; Hahn, Matthew W.; Nakhleh, Luay

2016-01-01

The role of hybridization and subsequent introgression has been demonstrated in an increasing number of species. Recently, Fontaine et al. (Science, 347, 2015, 1258524) conducted a phylogenomic analysis of six members of the Anopheles gambiae species complex. Their analysis revealed a reticulate evolutionary history and pointed to extensive introgression on all four autosomal arms. The study further highlighted the complex evolutionary signals that the co-occurrence of incomplete lineage sorting (ILS) and introgression can give rise to in phylogenomic analyses. While tree-based methodologies were used in the study, phylogenetic networks provide a more natural model to capture reticulate evolutionary histories. In this work, we reanalyse the Anopheles data using a recently devised framework that combines the multispecies coalescent with phylogenetic networks. This framework allows us to capture ILS and introgression simultaneously, and forms the basis for statistical methods for inferring reticulate evolutionary histories. The new analysis reveals a phylogenetic network with multiple hybridization events, some of which differ from those reported in the original study. To elucidate the extent and patterns of introgression across the genome, we devise a new method that quantifies the use of reticulation branches in the phylogenetic network by each genomic region. Applying the method to the mosquito data set reveals the evolutionary history of all the chromosomes. This study highlights the utility of ‘network thinking’ and the new insights it can uncover, in particular in phylogenomic analyses of large data sets with extensive gene tree incongruence. PMID:26808290

How altruism works: An evolutionary model of supply networks

NASA Astrophysics Data System (ADS)

Ge, Zehui; Zhang, Zi-Ke; Lü, Linyuan; Zhou, Tao; Xi, Ning

2012-02-01

Recently, supply networks have attracted increasing attention from the scientific community. However, it lacks serious consideration of social preference in Supply Chain Management. In this paper, we develop an evolutionary decision-making model to characterize the effects of suppliers' altruism in supply networks, and find that the performances of both suppliers and supply chains are improved by introducing the role of altruism. Furthermore, an interesting and reasonable phenomenon is discovered that the suppliers' and whole network's profits do not change monotonously with suppliers' altruistic preference, η, but reach the best at η=0.6 and η=0.4, respectively. This work may shed some light on the in-depth understanding of the effects of altruism for both research and commercial applications.

A hybrid neural learning algorithm using evolutionary learning and derivative free local search method.

PubMed

Ghosh, Ranadhir; Yearwood, John; Ghosh, Moumita; Bagirov, Adil

2006-06-01

In this paper we investigate a hybrid model based on the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. Also we discuss different variants for hybrid models using the Discrete Gradient method and an evolutionary strategy for determining the weights in a feed forward artificial neural network. The Discrete Gradient method has the advantage of being able to jump over many local minima and find very deep local minima. However, earlier research has shown that a good starting point for the discrete gradient method can improve the quality of the solution point. Evolutionary algorithms are best suited for global optimisation problems. Nevertheless they are cursed with longer training times and often unsuitable for real world application. For optimisation problems such as weight optimisation for ANNs in real world applications the dimensions are large and time complexity is critical. Hence the idea of a hybrid model can be a suitable option. In this paper we propose different fusion strategies for hybrid models combining the evolutionary strategy with the discrete gradient method to obtain an optimal solution much quicker. Three different fusion strategies are discussed: a linear hybrid model, an iterative hybrid model and a restricted local search hybrid model. Comparative results on a range of standard datasets are provided for different fusion hybrid models.

Reconstructing Networks from Profit Sequences in Evolutionary Games via a Multiobjective Optimization Approach with Lasso Initialization

PubMed Central

Wu, Kai; Liu, Jing; Wang, Shuai

2016-01-01

Evolutionary games (EG) model a common type of interactions in various complex, networked, natural and social systems. Given such a system with only profit sequences being available, reconstructing the interacting structure of EG networks is fundamental to understand and control its collective dynamics. Existing approaches used to handle this problem, such as the lasso, a convex optimization method, need a user-defined constant to control the tradeoff between the natural sparsity of networks and measurement error (the difference between observed data and simulated data). However, a shortcoming of these approaches is that it is not easy to determine these key parameters which can maximize the performance. In contrast to these approaches, we first model the EG network reconstruction problem as a multiobjective optimization problem (MOP), and then develop a framework which involves multiobjective evolutionary algorithm (MOEA), followed by solution selection based on knee regions, termed as MOEANet, to solve this MOP. We also design an effective initialization operator based on the lasso for MOEA. We apply the proposed method to reconstruct various types of synthetic and real-world networks, and the results show that our approach is effective to avoid the above parameter selecting problem and can reconstruct EG networks with high accuracy. PMID:27886244

Reconstructing Networks from Profit Sequences in Evolutionary Games via a Multiobjective Optimization Approach with Lasso Initialization

NASA Astrophysics Data System (ADS)

Wu, Kai; Liu, Jing; Wang, Shuai

2016-11-01

Evolutionary games (EG) model a common type of interactions in various complex, networked, natural and social systems. Given such a system with only profit sequences being available, reconstructing the interacting structure of EG networks is fundamental to understand and control its collective dynamics. Existing approaches used to handle this problem, such as the lasso, a convex optimization method, need a user-defined constant to control the tradeoff between the natural sparsity of networks and measurement error (the difference between observed data and simulated data). However, a shortcoming of these approaches is that it is not easy to determine these key parameters which can maximize the performance. In contrast to these approaches, we first model the EG network reconstruction problem as a multiobjective optimization problem (MOP), and then develop a framework which involves multiobjective evolutionary algorithm (MOEA), followed by solution selection based on knee regions, termed as MOEANet, to solve this MOP. We also design an effective initialization operator based on the lasso for MOEA. We apply the proposed method to reconstruct various types of synthetic and real-world networks, and the results show that our approach is effective to avoid the above parameter selecting problem and can reconstruct EG networks with high accuracy.

Crossover between structured and well-mixed networks in an evolutionary prisoner's dilemma game

NASA Astrophysics Data System (ADS)

Dai, Qionglin; Cheng, Hongyan; Li, Haihong; Li, Yuting; Zhang, Mei; Yang, Junzhong

2011-07-01

In a spatial evolutionary prisoner’s dilemma game (PDG), individuals interact with their neighbors and update their strategies according to some rules. As is well known, cooperators are destined to become extinct in a well-mixed population, whereas they could emerge and be sustained on a structured network. In this work, we introduce a simple model to investigate the crossover between a structured network and a well-mixed one in an evolutionary PDG. In the model, each link j is designated a rewiring parameter τj, which defines the time interval between two successive rewiring events for link j. By adjusting the rewiring parameter τ (the mean time interval for any link in the network), we could change a structured network into a well-mixed one. For the link rewiring events, three situations are considered: one synchronous situation and two asynchronous situations. Simulation results show that there are three regimes of τ: large τ where the density of cooperators ρc rises to ρc,∞ (the value of ρc for the case without link rewiring), small τ where the mean-field description for a well-mixed network is applicable, and moderate τ where the crossover between a structured network and a well-mixed one happens.

Modelling and strategy optimisation for a kind of networked evolutionary games with memories under the bankruptcy mechanism

NASA Astrophysics Data System (ADS)

Fu, Shihua; Li, Haitao; Zhao, Guodong

2018-05-01

This paper investigates the evolutionary dynamic and strategy optimisation for a kind of networked evolutionary games whose strategy updating rules incorporate 'bankruptcy' mechanism, and the situation that each player's bankruptcy is due to the previous continuous low profits gaining from the game is considered. First, by using semi-tensor product of matrices method, the evolutionary dynamic of this kind of games is expressed as a higher order logical dynamic system and then converted into its algebraic form, based on which, the evolutionary dynamic of the given games can be discussed. Second, the strategy optimisation problem is investigated, and some free-type control sequences are designed to maximise the total payoff of the whole game. Finally, an illustrative example is given to show that our new results are very effective.

The co-evolutionary dynamics of directed network of spin market agents

NASA Astrophysics Data System (ADS)

Horváth, Denis; Kuscsik, Zoltán; Gmitra, Martin

2006-09-01

The spin market model [S. Bornholdt, Int. J. Mod. Phys. C 12 (2001) 667] is generalized by employing co-evolutionary principles, where strategies of the interacting and competitive traders are represented by local and global couplings between the nodes of dynamic directed stochastic network. The co-evolutionary principles are applied in the frame of Bak-Sneppen self-organized dynamics [P. Bak, K. Sneppen, Phys. Rev. Lett. 71 (1993) 4083] that includes the processes of selection and extinction actuated by the local (node) fitness. The local fitness is related to orientation of spin agent with respect to the instant magnetization. The stationary regime is formed due to the interplay of self-organization and adaptivity effects. The fat tailed distributions of log-price returns are identified numerically. The non-trivial model consequence is the evidence of the long time market memory indicated by the power-law range of the autocorrelation function of volatility with exponent smaller than one. The simulations yield network topology with broad-scale node degree distribution characterized by the range of exponents 1.3<γin<3 coinciding with social networks.

Using evolutionary computations to understand the design and evolution of gene and cell regulatory networks.

PubMed

Spirov, Alexander; Holloway, David

2013-07-15

This paper surveys modeling approaches for studying the evolution of gene regulatory networks (GRNs). Modeling of the design or 'wiring' of GRNs has become increasingly common in developmental and medical biology, as a means of quantifying gene-gene interactions, the response to perturbations, and the overall dynamic motifs of networks. Drawing from developments in GRN 'design' modeling, a number of groups are now using simulations to study how GRNs evolve, both for comparative genomics and to uncover general principles of evolutionary processes. Such work can generally be termed evolution in silico. Complementary to these biologically-focused approaches, a now well-established field of computer science is Evolutionary Computations (ECs), in which highly efficient optimization techniques are inspired from evolutionary principles. In surveying biological simulation approaches, we discuss the considerations that must be taken with respect to: (a) the precision and completeness of the data (e.g. are the simulations for very close matches to anatomical data, or are they for more general exploration of evolutionary principles); (b) the level of detail to model (we proceed from 'coarse-grained' evolution of simple gene-gene interactions to 'fine-grained' evolution at the DNA sequence level); (c) to what degree is it important to include the genome's cellular context; and (d) the efficiency of computation. With respect to the latter, we argue that developments in computer science EC offer the means to perform more complete simulation searches, and will lead to more comprehensive biological predictions. Copyright © 2013 Elsevier Inc. All rights reserved.

Genes under weaker stabilizing selection increase network evolvability and rapid regulatory adaptation to an environmental shift.

PubMed

Laarits, T; Bordalo, P; Lemos, B

2016-08-01

Regulatory networks play a central role in the modulation of gene expression, the control of cellular differentiation, and the emergence of complex phenotypes. Regulatory networks could constrain or facilitate evolutionary adaptation in gene expression levels. Here, we model the adaptation of regulatory networks and gene expression levels to a shift in the environment that alters the optimal expression level of a single gene. Our analyses show signatures of natural selection on regulatory networks that both constrain and facilitate rapid evolution of gene expression level towards new optima. The analyses are interpreted from the standpoint of neutral expectations and illustrate the challenge to making inferences about network adaptation. Furthermore, we examine the consequence of variable stabilizing selection across genes on the strength and direction of interactions in regulatory networks and in their subsequent adaptation. We observe that directional selection on a highly constrained gene previously under strong stabilizing selection was more efficient when the gene was embedded within a network of partners under relaxed stabilizing selection pressure. The observation leads to the expectation that evolutionarily resilient regulatory networks will contain optimal ratios of genes whose expression is under weak and strong stabilizing selection. Altogether, our results suggest that the variable strengths of stabilizing selection across genes within regulatory networks might itself contribute to the long-term adaptation of complex phenotypes. © 2016 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2016 European Society For Evolutionary Biology.

A program to compute the soft Robinson-Foulds distance between phylogenetic networks.

PubMed

Lu, Bingxin; Zhang, Louxin; Leong, Hon Wai

2017-03-14

Over the past two decades, phylogenetic networks have been studied to model reticulate evolutionary events. The relationships among phylogenetic networks, phylogenetic trees and clusters serve as the basis for reconstruction and comparison of phylogenetic networks. To understand these relationships, two problems are raised: the tree containment problem, which asks whether a phylogenetic tree is displayed in a phylogenetic network, and the cluster containment problem, which asks whether a cluster is represented at a node in a phylogenetic network. Both the problems are NP-complete. A fast exponential-time algorithm for the cluster containment problem on arbitrary networks is developed and implemented in C. The resulting program is further extended into a computer program for fast computation of the Soft Robinson-Foulds distance between phylogenetic networks. Two computer programs are developed for facilitating reconstruction and validation of phylogenetic network models in evolutionary and comparative genomics. Our simulation tests indicated that they are fast enough for use in practice. Additionally, the distribution of the Soft Robinson-Foulds distance between phylogenetic networks is demonstrated to be unlikely normal by our simulation data.

A consensus opinion model based on the evolutionary game

NASA Astrophysics Data System (ADS)

Yang, Han-Xin

2016-08-01

We propose a consensus opinion model based on the evolutionary game. In our model, both of the two connected agents receive a benefit if they have the same opinion, otherwise they both pay a cost. Agents update their opinions by comparing payoffs with neighbors. The opinion of an agent with higher payoff is more likely to be imitated. We apply this model in scale-free networks with tunable degree distribution. Interestingly, we find that there exists an optimal ratio of cost to benefit, leading to the shortest consensus time. Qualitative analysis is obtained by examining the evolution of the opinion clusters. Moreover, we find that the consensus time decreases as the average degree of the network increases, but increases with the noise introduced to permit irrational choices. The dependence of the consensus time on the network size is found to be a power-law form. For small or larger ratio of cost to benefit, the consensus time decreases as the degree exponent increases. However, for moderate ratio of cost to benefit, the consensus time increases with the degree exponent. Our results may provide new insights into opinion dynamics driven by the evolutionary game theory.

A Neural Network Model of the Structure and Dynamics of Human Personality

ERIC Educational Resources Information Center

Read, Stephen J.; Monroe, Brian M.; Brownstein, Aaron L.; Yang, Yu; Chopra, Gurveen; Miller, Lynn C.

2010-01-01

We present a neural network model that aims to bridge the historical gap between dynamic and structural approaches to personality. The model integrates work on the structure of the trait lexicon, the neurobiology of personality, temperament, goal-based models of personality, and an evolutionary analysis of motives. It is organized in terms of two…

An improved shuffled frog leaping algorithm based evolutionary framework for currency exchange rate prediction

NASA Astrophysics Data System (ADS)

Dash, Rajashree

2017-11-01

Forecasting purchasing power of one currency with respect to another currency is always an interesting topic in the field of financial time series prediction. Despite the existence of several traditional and computational models for currency exchange rate forecasting, there is always a need for developing simpler and more efficient model, which will produce better prediction capability. In this paper, an evolutionary framework is proposed by using an improved shuffled frog leaping (ISFL) algorithm with a computationally efficient functional link artificial neural network (CEFLANN) for prediction of currency exchange rate. The model is validated by observing the monthly prediction measures obtained for three currency exchange data sets such as USD/CAD, USD/CHF, and USD/JPY accumulated within same period of time. The model performance is also compared with two other evolutionary learning techniques such as Shuffled frog leaping algorithm and Particle Swarm optimization algorithm. Practical analysis of results suggest that, the proposed model developed using the ISFL algorithm with CEFLANN network is a promising predictor model for currency exchange rate prediction compared to other models included in the study.

Evolutionary Design of Convolutional Neural Networks for Human Activity Recognition in Sensor-Rich Environments.

PubMed

Baldominos, Alejandro; Saez, Yago; Isasi, Pedro

2018-04-23

Human activity recognition is a challenging problem for context-aware systems and applications. It is gaining interest due to the ubiquity of different sensor sources, wearable smart objects, ambient sensors, etc. This task is usually approached as a supervised machine learning problem, where a label is to be predicted given some input data, such as the signals retrieved from different sensors. For tackling the human activity recognition problem in sensor network environments, in this paper we propose the use of deep learning (convolutional neural networks) to perform activity recognition using the publicly available OPPORTUNITY dataset. Instead of manually choosing a suitable topology, we will let an evolutionary algorithm design the optimal topology in order to maximize the classification F1 score. After that, we will also explore the performance of committees of the models resulting from the evolutionary process. Results analysis indicates that the proposed model was able to perform activity recognition within a heterogeneous sensor network environment, achieving very high accuracies when tested with new sensor data. Based on all conducted experiments, the proposed neuroevolutionary system has proved to be able to systematically find a classification model which is capable of outperforming previous results reported in the state-of-the-art, showing that this approach is useful and improves upon previously manually-designed architectures.

Evolutionary Design of Convolutional Neural Networks for Human Activity Recognition in Sensor-Rich Environments

PubMed Central

2018-01-01

Human activity recognition is a challenging problem for context-aware systems and applications. It is gaining interest due to the ubiquity of different sensor sources, wearable smart objects, ambient sensors, etc. This task is usually approached as a supervised machine learning problem, where a label is to be predicted given some input data, such as the signals retrieved from different sensors. For tackling the human activity recognition problem in sensor network environments, in this paper we propose the use of deep learning (convolutional neural networks) to perform activity recognition using the publicly available OPPORTUNITY dataset. Instead of manually choosing a suitable topology, we will let an evolutionary algorithm design the optimal topology in order to maximize the classification F1 score. After that, we will also explore the performance of committees of the models resulting from the evolutionary process. Results analysis indicates that the proposed model was able to perform activity recognition within a heterogeneous sensor network environment, achieving very high accuracies when tested with new sensor data. Based on all conducted experiments, the proposed neuroevolutionary system has proved to be able to systematically find a classification model which is capable of outperforming previous results reported in the state-of-the-art, showing that this approach is useful and improves upon previously manually-designed architectures. PMID:29690587

Improved Maximum Parsimony Models for Phylogenetic Networks.

PubMed

Van Iersel, Leo; Jones, Mark; Scornavacca, Celine

2018-05-01

Phylogenetic networks are well suited to represent evolutionary histories comprising reticulate evolution. Several methods aiming at reconstructing explicit phylogenetic networks have been developed in the last two decades. In this article, we propose a new definition of maximum parsimony for phylogenetic networks that permits to model biological scenarios that cannot be modeled by the definitions currently present in the literature (namely, the "hardwired" and "softwired" parsimony). Building on this new definition, we provide several algorithmic results that lay the foundations for new parsimony-based methods for phylogenetic network reconstruction.

Population Fluctuation Promotes Cooperation in Networks

PubMed Central

Miller, Steve; Knowles, Joshua

2015-01-01

We consider the problem of explaining the emergence and evolution of cooperation in dynamic network-structured populations. Building on seminal work by Poncela et al., which shows how cooperation (in one-shot prisoner’s dilemma) is supported in growing populations by an evolutionary preferential attachment (EPA) model, we investigate the effect of fluctuations in the population size. We find that a fluctuating model – based on repeated population growth and truncation – is more robust than Poncela et al.’s in that cooperation flourishes for a wider variety of initial conditions. In terms of both the temptation to defect, and the types of strategies present in the founder network, the fluctuating population is found to lead more securely to cooperation. Further, we find that this model will also support the emergence of cooperation from pre-existing non-cooperative random networks. This model, like Poncela et al.’s, does not require agents to have memory, recognition of other agents, or other cognitive abilities, and so may suggest a more general explanation of the emergence of cooperation in early evolutionary transitions, than mechanisms such as kin selection, direct and indirect reciprocity. PMID:26061705

The evolution of cooperation on geographical networks

NASA Astrophysics Data System (ADS)

Li, Yixiao; Wang, Yi; Sheng, Jichuan

2017-11-01

We study evolutionary public goods game on geographical networks, i.e., complex networks which are located on a geographical plane. The geographical feature effects in two ways: In one way, the geographically-induced network structure influences the overall evolutionary dynamics, and, in the other way, the geographical length of an edge influences the cost when the two players at the two ends interact. For the latter effect, we design a new cost function of cooperators, which simply assumes that the longer the distance between two players, the higher cost the cooperator(s) of them have to pay. In this study, network substrates are generated by a previous spatial network model with a cost-benefit parameter controlling the network topology. Our simulations show that the greatest promotion of cooperation is achieved in the intermediate regime of the parameter, in which empirical estimates of various railway networks fall. Further, we investigate how the distribution of edges' geographical costs influences the evolutionary dynamics and consider three patterns of the distribution: an approximately-equal distribution, a diverse distribution, and a polarized distribution. For normal geographical networks which are generated using intermediate values of the cost-benefit parameter, a diverse distribution hinders the evolution of cooperation, whereas a polarized distribution lowers the threshold value of the amplification factor for cooperation in public goods game. These results are helpful for understanding the evolution of cooperation on real-world geographical networks.

In-silico studies of neutral drift for functional protein interaction networks

NASA Astrophysics Data System (ADS)

Ali, Md Zulfikar; Wingreen, Ned S.; Mukhopadhyay, Ranjan

We have developed a minimal physically-motivated model of protein-protein interaction networks. Our system consists of two classes of enzymes, activators (e.g. kinases) and deactivators (e.g. phosphatases), and the enzyme-mediated activation/deactivation rates are determined by sequence-dependent binding strengths between enzymes and their targets. The network is evolved by introducing random point mutations in the binding sequences where we assume that each new mutation is either fixed or entirely lost. We apply this model to studies of neutral drift in networks that yield oscillatory dynamics, where we start, for example, with a relatively simple network and allow it to evolve by adding nodes and connections while requiring that dynamics be conserved. Our studies demonstrate both the importance of employing a sequence-based evolutionary scheme and the relative rapidity (in evolutionary time) for the redistribution of function over new nodes via neutral drift. Surprisingly, in addition to this redistribution time we discovered another much slower timescale for network evolution, reflecting hidden order in sequence space that we interpret in terms of sparsely connected domains.

The Stochastic Evolutionary Game for a Population of Biological Networks Under Natural Selection

PubMed Central

Chen, Bor-Sen; Ho, Shih-Ju

2014-01-01

In this study, a population of evolutionary biological networks is described by a stochastic dynamic system with intrinsic random parameter fluctuations due to genetic variations and external disturbances caused by environmental changes in the evolutionary process. Since information on environmental changes is unavailable and their occurrence is unpredictable, they can be considered as a game player with the potential to destroy phenotypic stability. The biological network needs to develop an evolutionary strategy to improve phenotypic stability as much as possible, so it can be considered as another game player in the evolutionary process, ie, a stochastic Nash game of minimizing the maximum network evolution level caused by the worst environmental disturbances. Based on the nonlinear stochastic evolutionary game strategy, we find that some genetic variations can be used in natural selection to construct negative feedback loops, efficiently improving network robustness. This provides larger genetic robustness as a buffer against neutral genetic variations, as well as larger environmental robustness to resist environmental disturbances and maintain a network phenotypic traits in the evolutionary process. In this situation, the robust phenotypic traits of stochastic biological networks can be more frequently selected by natural selection in evolution. However, if the harbored neutral genetic variations are accumulated to a sufficiently large degree, and environmental disturbances are strong enough that the network robustness can no longer confer enough genetic robustness and environmental robustness, then the phenotype robustness might break down. In this case, a network phenotypic trait may be pushed from one equilibrium point to another, changing the phenotypic trait and starting a new phase of network evolution through the hidden neutral genetic variations harbored in network robustness by adaptive evolution. Further, the proposed evolutionary game is extended to an n-tuple evolutionary game of stochastic biological networks with m players (competitive populations) and k environmental dynamics. PMID:24558296

Evolving cell models for systems and synthetic biology.

PubMed

Cao, Hongqing; Romero-Campero, Francisco J; Heeb, Stephan; Cámara, Miguel; Krasnogor, Natalio

2010-03-01

This paper proposes a new methodology for the automated design of cell models for systems and synthetic biology. Our modelling framework is based on P systems, a discrete, stochastic and modular formal modelling language. The automated design of biological models comprising the optimization of the model structure and its stochastic kinetic constants is performed using an evolutionary algorithm. The evolutionary algorithm evolves model structures by combining different modules taken from a predefined module library and then it fine-tunes the associated stochastic kinetic constants. We investigate four alternative objective functions for the fitness calculation within the evolutionary algorithm: (1) equally weighted sum method, (2) normalization method, (3) randomly weighted sum method, and (4) equally weighted product method. The effectiveness of the methodology is tested on four case studies of increasing complexity including negative and positive autoregulation as well as two gene networks implementing a pulse generator and a bandwidth detector. We provide a systematic analysis of the evolutionary algorithm's results as well as of the resulting evolved cell models.

Evolutionary dynamics of group interactions on structured populations: a review

PubMed Central

Perc, Matjaž; Gómez-Gardeñes, Jesús; Szolnoki, Attila; Floría, Luis M.; Moreno, Yamir

2013-01-01

Interactions among living organisms, from bacteria colonies to human societies, are inherently more complex than interactions among particles and non-living matter. Group interactions are a particularly important and widespread class, representative of which is the public goods game. In addition, methods of statistical physics have proved valuable for studying pattern formation, equilibrium selection and self-organization in evolutionary games. Here, we review recent advances in the study of evolutionary dynamics of group interactions on top of structured populations, including lattices, complex networks and coevolutionary models. We also compare these results with those obtained on well-mixed populations. The review particularly highlights that the study of the dynamics of group interactions, like several other important equilibrium and non-equilibrium dynamical processes in biological, economical and social sciences, benefits from the synergy between statistical physics, network science and evolutionary game theory. PMID:23303223

Investigation on Law and Economics Based on Complex Network and Time Series Analysis.

PubMed

Yang, Jian; Qu, Zhao; Chang, Hui

2015-01-01

The research focuses on the cooperative relationship and the strategy tendency among three mutually interactive parties in financing: small enterprises, commercial banks and micro-credit companies. Complex network theory and time series analysis were applied to figure out the quantitative evidence. Moreover, this paper built up a fundamental model describing the particular interaction among them through evolutionary game. Combining the results of data analysis and current situation, it is justifiable to put forward reasonable legislative recommendations for regulations on lending activities among small enterprises, commercial banks and micro-credit companies. The approach in this research provides a framework for constructing mathematical models and applying econometrics and evolutionary game in the issue of corporation financing.

Spatial Structure of Evolutionary Models of Dialects in Contact

PubMed Central

Murawaki, Yugo

2015-01-01

Phylogenetic models, originally developed to demonstrate evolutionary biology, have been applied to a wide range of cultural data including natural language lexicons, manuscripts, folktales, material cultures, and religions. A fundamental question regarding the application of phylogenetic inference is whether trees are an appropriate approximation of cultural evolutionary history. Their validity in cultural applications has been scrutinized, particularly with respect to the lexicons of dialects in contact. Phylogenetic models organize evolutionary data into a series of branching events through time. However, branching events are typically not included in dialectological studies to interpret the distributions of lexical terms. Instead, dialectologists have offered spatial interpretations to represent lexical data. For example, new lexical items that emerge in a politico-cultural center are likely to spread to peripheries, but not vice versa. To explore the question of the tree model’s validity, we present a simple simulation model in which dialects form a spatial network and share lexical items through contact rather than through common ancestors. We input several network topologies to the model to generate synthetic data. We then analyze the synthesized data using conventional phylogenetic techniques. We found that a group of dialects can be considered tree-like even if it has not evolved in a temporally tree-like manner but has a temporally invariant, spatially tree-like structure. In addition, the simulation experiments appear to reproduce unnatural results observed in reconstructed trees for real data. These results motivate further investigation into the spatial structure of the evolutionary history of dialect lexicons as well as other cultural characteristics. PMID:26221958

Efficient Allocation of Resources for Defense of Spatially Distributed Networks Using Agent-Based Simulation.

PubMed

Kroshl, William M; Sarkani, Shahram; Mazzuchi, Thomas A

2015-09-01

This article presents ongoing research that focuses on efficient allocation of defense resources to minimize the damage inflicted on a spatially distributed physical network such as a pipeline, water system, or power distribution system from an attack by an active adversary, recognizing the fundamental difference between preparing for natural disasters such as hurricanes, earthquakes, or even accidental systems failures and the problem of allocating resources to defend against an opponent who is aware of, and anticipating, the defender's efforts to mitigate the threat. Our approach is to utilize a combination of integer programming and agent-based modeling to allocate the defensive resources. We conceptualize the problem as a Stackelberg "leader follower" game where the defender first places his assets to defend key areas of the network, and the attacker then seeks to inflict the maximum damage possible within the constraints of resources and network structure. The criticality of arcs in the network is estimated by a deterministic network interdiction formulation, which then informs an evolutionary agent-based simulation. The evolutionary agent-based simulation is used to determine the allocation of resources for attackers and defenders that results in evolutionary stable strategies, where actions by either side alone cannot increase its share of victories. We demonstrate these techniques on an example network, comparing the evolutionary agent-based results to a more traditional, probabilistic risk analysis (PRA) approach. Our results show that the agent-based approach results in a greater percentage of defender victories than does the PRA-based approach. © 2015 Society for Risk Analysis.

An evolutionary game approach for determination of the structural conflicts in signed networks

PubMed Central

Tan, Shaolin; Lü, Jinhu

2016-01-01

Social or biochemical networks can often divide into two opposite alliances in response to structural conflicts between positive (friendly, activating) and negative (hostile, inhibiting) interactions. Yet, the underlying dynamics on how the opposite alliances are spontaneously formed to minimize the structural conflicts is still unclear. Here, we demonstrate that evolutionary game dynamics provides a felicitous possible tool to characterize the evolution and formation of alliances in signed networks. Indeed, an evolutionary game dynamics on signed networks is proposed such that each node can adaptively adjust its choice of alliances to maximize its own fitness, which yet leads to a minimization of the structural conflicts in the entire network. Numerical experiments show that the evolutionary game approach is universally efficient in quality and speed to find optimal solutions for all undirected or directed, unweighted or weighted signed networks. Moreover, the evolutionary game approach is inherently distributed. These characteristics thus suggest the evolutionary game dynamic approach as a feasible and effective tool for determining the structural conflicts in large-scale on-line signed networks. PMID:26915581

Network-level architecture and the evolutionary potential of underground metabolism.

PubMed

Notebaart, Richard A; Szappanos, Balázs; Kintses, Bálint; Pál, Ferenc; Györkei, Ádám; Bogos, Balázs; Lázár, Viktória; Spohn, Réka; Csörgő, Bálint; Wagner, Allon; Ruppin, Eytan; Pál, Csaba; Papp, Balázs

2014-08-12

A central unresolved issue in evolutionary biology is how metabolic innovations emerge. Low-level enzymatic side activities are frequent and can potentially be recruited for new biochemical functions. However, the role of such underground reactions in adaptation toward novel environments has remained largely unknown and out of reach of computational predictions, not least because these issues demand analyses at the level of the entire metabolic network. Here, we provide a comprehensive computational model of the underground metabolism in Escherichia coli. Most underground reactions are not isolated and 45% of them can be fully wired into the existing network and form novel pathways that produce key precursors for cell growth. This observation allowed us to conduct an integrated genome-wide in silico and experimental survey to characterize the evolutionary potential of E. coli to adapt to hundreds of nutrient conditions. We revealed that underground reactions allow growth in new environments when their activity is increased. We estimate that at least ∼20% of the underground reactions that can be connected to the existing network confer a fitness advantage under specific environments. Moreover, our results demonstrate that the genetic basis of evolutionary adaptations via underground metabolism is computationally predictable. The approach used here has potential for various application areas from bioengineering to medical genetics.

Hybrid evolutionary computing model for mobile agents of wireless Internet multimedia

NASA Astrophysics Data System (ADS)

Hortos, William S.

2001-03-01

The ecosystem is used as an evolutionary paradigm of natural laws for the distributed information retrieval via mobile agents to allow the computational load to be added to server nodes of wireless networks, while reducing the traffic on communication links. Based on the Food Web model, a set of computational rules of natural balance form the outer stage to control the evolution of mobile agents providing multimedia services with a wireless Internet protocol WIP. The evolutionary model shows how mobile agents should behave with the WIP, in particular, how mobile agents can cooperate, compete and learn from each other, based on an underlying competition for radio network resources to establish the wireless connections to support the quality of service QoS of user requests. Mobile agents are also allowed to clone themselves, propagate and communicate with other agents. A two-layer model is proposed for agent evolution: the outer layer is based on the law of natural balancing, the inner layer is based on a discrete version of a Kohonen self-organizing feature map SOFM to distribute network resources to meet QoS requirements. The former is embedded in the higher OSI layers of the WIP, while the latter is used in the resource management procedures of Layer 2 and 3 of the protocol. Algorithms for the distributed computation of mobile agent evolutionary behavior are developed by adding a learning state to the agent evolution state diagram. When an agent is in an indeterminate state, it can communicate to other agents. Computing models can be replicated from other agents. Then the agents transitions to the mutating state to wait for a new information-retrieval goal. When a wireless terminal or station lacks a network resource, an agent in the suspending state can change its policy to submit to the environment before it transitions to the searching state. The agents learn the facts of agent state information entered into an external database. In the cloning process, two agents on a host station sharing a common goal can be merged or married to compose a new agent. Application of the two-layer set of algorithms for mobile agent evolution, performed in a distributed processing environment, is made to the QoS management functions of the IP multimedia IM sub-network of the third generation 3G Wideband Code-division Multiple Access W-CDMA wireless network.

Android malware detection based on evolutionary super-network

NASA Astrophysics Data System (ADS)

Yan, Haisheng; Peng, Lingling

2018-04-01

In the paper, an android malware detection method based on evolutionary super-network is proposed in order to improve the precision of android malware detection. Chi square statistics method is used for selecting characteristics on the basis of analyzing android authority. Boolean weighting is utilized for calculating characteristic weight. Processed characteristic vector is regarded as the system training set and test set; hyper edge alternative strategy is used for training super-network classification model, thereby classifying test set characteristic vectors, and it is compared with traditional classification algorithm. The results show that the detection method proposed in the paper is close to or better than traditional classification algorithm. The proposed method belongs to an effective Android malware detection means.

Toward Optimal Transport Networks

NASA Technical Reports Server (NTRS)

Alexandrov, Natalia; Kincaid, Rex K.; Vargo, Erik P.

2008-01-01

Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

Neutral forces acting on intragenomic variability shape the Escherichia coli regulatory network topology.

PubMed

Ruths, Troy; Nakhleh, Luay

2013-05-07

Cis-regulatory networks (CRNs) play a central role in cellular decision making. Like every other biological system, CRNs undergo evolution, which shapes their properties by a combination of adaptive and nonadaptive evolutionary forces. Teasing apart these forces is an important step toward functional analyses of the different components of CRNs, designing regulatory perturbation experiments, and constructing synthetic networks. Although tests of neutrality and selection based on molecular sequence data exist, no such tests are currently available based on CRNs. In this work, we present a unique genotype model of CRNs that is grounded in a genomic context and demonstrate its use in identifying portions of the CRN with properties explainable by neutral evolutionary forces at the system, subsystem, and operon levels. We leverage our model against experimentally derived data from Escherichia coli. The results of this analysis show statistically significant and substantial neutral trends in properties previously identified as adaptive in origin--degree distribution, clustering coefficient, and motifs--within the E. coli CRN. Our model captures the tightly coupled genome-interactome of an organism and enables analyses of how evolutionary events acting at the genome level, such as mutation, and at the population level, such as genetic drift, give rise to neutral patterns that we can quantify in CRNs.

Gap Gene Regulatory Dynamics Evolve along a Genotype Network

PubMed Central

Crombach, Anton; Wotton, Karl R.; Jiménez-Guri, Eva; Jaeger, Johannes

2016-01-01

Developmental gene networks implement the dynamic regulatory mechanisms that pattern and shape the organism. Over evolutionary time, the wiring of these networks changes, yet the patterning outcome is often preserved, a phenomenon known as “system drift.” System drift is illustrated by the gap gene network—involved in segmental patterning—in dipteran insects. In the classic model organism Drosophila melanogaster and the nonmodel scuttle fly Megaselia abdita, early activation and placement of gap gene expression domains show significant quantitative differences, yet the final patterning output of the system is essentially identical in both species. In this detailed modeling analysis of system drift, we use gene circuits which are fit to quantitative gap gene expression data in M. abdita and compare them with an equivalent set of models from D. melanogaster. The results of this comparative analysis show precisely how compensatory regulatory mechanisms achieve equivalent final patterns in both species. We discuss the larger implications of the work in terms of “genotype networks” and the ways in which the structure of regulatory networks can influence patterns of evolutionary change (evolvability). PMID:26796549

An evolutionary algorithm that constructs recurrent neural networks.

PubMed

Angeline, P J; Saunders, G M; Pollack, J B

1994-01-01

Standard methods for simultaneously inducing the structure and weights of recurrent neural networks limit every task to an assumed class of architectures. Such a simplification is necessary since the interactions between network structure and function are not well understood. Evolutionary computations, which include genetic algorithms and evolutionary programming, are population-based search methods that have shown promise in many similarly complex tasks. This paper argues that genetic algorithms are inappropriate for network acquisition and describes an evolutionary program, called GNARL, that simultaneously acquires both the structure and weights for recurrent networks. GNARL's empirical acquisition method allows for the emergence of complex behaviors and topologies that are potentially excluded by the artificial architectural constraints imposed in standard network induction methods.

Biological engineering applications of feedforward neural networks designed and parameterized by genetic algorithms.

PubMed

Ferentinos, Konstantinos P

2005-09-01

Two neural network (NN) applications in the field of biological engineering are developed, designed and parameterized by an evolutionary method based on the evolutionary process of genetic algorithms. The developed systems are a fault detection NN model and a predictive modeling NN system. An indirect or 'weak specification' representation was used for the encoding of NN topologies and training parameters into genes of the genetic algorithm (GA). Some a priori knowledge of the demands in network topology for specific application cases is required by this approach, so that the infinite search space of the problem is limited to some reasonable degree. Both one-hidden-layer and two-hidden-layer network architectures were explored by the GA. Except for the network architecture, each gene of the GA also encoded the type of activation functions in both hidden and output nodes of the NN and the type of minimization algorithm that was used by the backpropagation algorithm for the training of the NN. Both models achieved satisfactory performance, while the GA system proved to be a powerful tool that can successfully replace the problematic trial-and-error approach that is usually used for these tasks.

Scale-dependent genetic structure of the Idaho giant salamander (Dicamptodon aterrimus) in stream networks

Treesearch

Lindy B. Mullen; H. Arthur Woods; Michael K. Schwartz; Adam J. Sepulveda; Winsor H. Lowe

2010-01-01

The network architecture of streams and rivers constrains evolutionary, demographic and ecological processes of freshwater organisms. This consistent architecture also makes stream networks useful for testing general models of population genetic structure and the scaling of gene flow. We examined genetic structure and gene flow in the facultatively paedomorphic Idaho...

An alternative approach for neural network evolution with a genetic algorithm: crossover by combinatorial optimization.

PubMed

García-Pedrajas, Nicolás; Ortiz-Boyer, Domingo; Hervás-Martínez, César

2006-05-01

In this work we present a new approach to crossover operator in the genetic evolution of neural networks. The most widely used evolutionary computation paradigm for neural network evolution is evolutionary programming. This paradigm is usually preferred due to the problems caused by the application of crossover to neural network evolution. However, crossover is the most innovative operator within the field of evolutionary computation. One of the most notorious problems with the application of crossover to neural networks is known as the permutation problem. This problem occurs due to the fact that the same network can be represented in a genetic coding by many different codifications. Our approach modifies the standard crossover operator taking into account the special features of the individuals to be mated. We present a new model for mating individuals that considers the structure of the hidden layer and redefines the crossover operator. As each hidden node represents a non-linear projection of the input variables, we approach the crossover as a problem on combinatorial optimization. We can formulate the problem as the extraction of a subset of near-optimal projections to create the hidden layer of the new network. This new approach is compared to a classical crossover in 25 real-world problems with an excellent performance. Moreover, the networks obtained are much smaller than those obtained with classical crossover operator.

Effects of topology on network evolution

NASA Astrophysics Data System (ADS)

Oikonomou, Panos; Cluzel, Philippe

2006-08-01

The ubiquity of scale-free topology in nature raises the question of whether this particular network design confers an evolutionary advantage. A series of studies has identified key principles controlling the growth and the dynamics of scale-free networks. Here, we use neuron-based networks of boolean components as a framework for modelling a large class of dynamical behaviours in both natural and artificial systems. Applying a training algorithm, we characterize how networks with distinct topologies evolve towards a pre-established target function through a process of random mutations and selection. We find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. Whereas homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously. Remarkably, this latter property is robust to variations of the degree exponent. In contrast, homogeneous random networks require a specific tuning of their connectivity to optimize their ability to evolve. These results highlight an organizing principle that governs the evolution of complex networks and that can improve the design of engineered systems.

POCO-MOEA: Using Evolutionary Algorithms to Solve the Controller Placement Problem

DTIC Science & Technology

2016-03-24

to gather data on POCO-MOEA performance to a series of iv model networks. The algorithm’s behavior is then evaluated and compared to ex- haustive... evaluation of a third heuristic based on a Multi 3 Objective Evolutionary Algorithm (MOEA). This heuristic is modeled after one of the most well known MOEAs...researchers to extend into more realistic evaluations of the performance characteristics of SDN controllers, such as the use of simulators or live

Reciprocity in spatial evolutionary public goods game on double-layered network

NASA Astrophysics Data System (ADS)

Kim, Jinho; Yook, Soon-Hyung; Kim, Yup

2016-08-01

Spatial evolutionary games have mainly been studied on a single, isolated network. However, in real world systems, many interaction topologies are not isolated but many different types of networks are inter-connected to each other. In this study, we investigate the spatial evolutionary public goods game (SEPGG) on double-layered random networks (DRN). Based on the mean-field type arguments and numerical simulations, we find that SEPGG on DRN shows very rich interesting phenomena, especially, depending on the size of each layer, intra-connectivity, and inter-connected couplings, the network reciprocity of SEPGG on DRN can be drastically enhanced through the inter-connected coupling. Furthermore, SEPGG on DRN can provide a more general framework which includes the evolutionary dynamics on multiplex networks and inter-connected networks at the same time.

Reciprocity in spatial evolutionary public goods game on double-layered network

PubMed Central

Kim, Jinho; Yook, Soon-Hyung; Kim, Yup

2016-01-01

Spatial evolutionary games have mainly been studied on a single, isolated network. However, in real world systems, many interaction topologies are not isolated but many different types of networks are inter-connected to each other. In this study, we investigate the spatial evolutionary public goods game (SEPGG) on double-layered random networks (DRN). Based on the mean-field type arguments and numerical simulations, we find that SEPGG on DRN shows very rich interesting phenomena, especially, depending on the size of each layer, intra-connectivity, and inter-connected couplings, the network reciprocity of SEPGG on DRN can be drastically enhanced through the inter-connected coupling. Furthermore, SEPGG on DRN can provide a more general framework which includes the evolutionary dynamics on multiplex networks and inter-connected networks at the same time. PMID:27503801

Emergence of diversity in homogeneous coupled Boolean networks

NASA Astrophysics Data System (ADS)

Kang, Chris; Aguilar, Boris; Shmulevich, Ilya

2018-05-01

The origin of multicellularity in metazoa is one of the fundamental questions of evolutionary biology. We have modeled the generic behaviors of gene regulatory networks in isogenic cells as stochastic nonlinear dynamical systems—coupled Boolean networks with perturbation. Model simulations under a variety of dynamical regimes suggest that the central characteristic of multicellularity, permanent spatial differentiation (diversification), indeed can arise. Additionally, we observe that diversification is more likely to occur near the critical regime of Lyapunov stability.

Wild cricket social networks show stability across generations.

PubMed

Fisher, David N; Rodríguez-Muñoz, Rolando; Tregenza, Tom

2016-07-27

A central part of an animal's environment is its interactions with conspecifics. There has been growing interest in the potential to capture these interactions in the form of a social network. Such networks can then be used to examine how relationships among individuals affect ecological and evolutionary processes. However, in the context of selection and evolution, the utility of this approach relies on social network structures persisting across generations. This is an assumption that has been difficult to test because networks spanning multiple generations have not been available. We constructed social networks for six annual generations over a period of eight years for a wild population of the cricket Gryllus campestris. Through the use of exponential random graph models (ERGMs), we found that the networks in any given year were able to predict the structure of networks in other years for some network characteristics. The capacity of a network model of any given year to predict the networks of other years did not depend on how far apart those other years were in time. Instead, the capacity of a network model to predict the structure of a network in another year depended on the similarity in population size between those years. Our results indicate that cricket social network structure resists the turnover of individuals and is stable across generations. This would allow evolutionary processes that rely on network structure to take place. The influence of network size may indicate that scaling up findings on social behaviour from small populations to larger ones will be difficult. Our study also illustrates the utility of ERGMs for comparing networks, a task for which an effective approach has been elusive.

Constructing Robust Cooperative Networks using a Multi-Objective Evolutionary Algorithm

PubMed Central

Wang, Shuai; Liu, Jing

2017-01-01

The design and construction of network structures oriented towards different applications has attracted much attention recently. The existing studies indicated that structural heterogeneity plays different roles in promoting cooperation and robustness. Compared with rewiring a predefined network, it is more flexible and practical to construct new networks that satisfy the desired properties. Therefore, in this paper, we study a method for constructing robust cooperative networks where the only constraint is that the number of nodes and links is predefined. We model this network construction problem as a multi-objective optimization problem and propose a multi-objective evolutionary algorithm, named MOEA-Netrc, to generate the desired networks from arbitrary initializations. The performance of MOEA-Netrc is validated on several synthetic and real-world networks. The results show that MOEA-Netrc can construct balanced candidates and is insensitive to the initializations. MOEA-Netrc can find the Pareto fronts for networks with different levels of cooperation and robustness. In addition, further investigation of the robustness of the constructed networks revealed the impact on other aspects of robustness during the construction process. PMID:28134314

Investigation on Law and Economics Based on Complex Network and Time Series Analysis

PubMed Central

Yang, Jian; Qu, Zhao; Chang, Hui

2015-01-01

The research focuses on the cooperative relationship and the strategy tendency among three mutually interactive parties in financing: small enterprises, commercial banks and micro-credit companies. Complex network theory and time series analysis were applied to figure out the quantitative evidence. Moreover, this paper built up a fundamental model describing the particular interaction among them through evolutionary game. Combining the results of data analysis and current situation, it is justifiable to put forward reasonable legislative recommendations for regulations on lending activities among small enterprises, commercial banks and micro-credit companies. The approach in this research provides a framework for constructing mathematical models and applying econometrics and evolutionary game in the issue of corporation financing. PMID:26076460

Evolutionary Dynamics of Collective Action in Structured Populations

NASA Astrophysics Data System (ADS)

Santos, Marta Daniela de Almeida

The pervasiveness of cooperation in Nature is not easily explained. If evolution is characterized by competition and survival of the fittest, why should selfish individuals cooperate with each other? Evolutionary Game Theory (EGT) provides a suitable mathematical framework to study this problem, central to many areas of science. Conventionally, interactions between individuals are modeled in terms of one-shot, symmetric 2-Person Dilemmas of Cooperation, but many real-life situations involve decisions within groups with more than 2 individuals, which are best-dealt in the framework of N-Person games. In this Thesis, we investigate the evolutionary dynamics of two paradigmatic collective social dilemmas - the N-Person Prisoner's Dilemma (NPD) and the N-Person Snowdrift Game (NSG) on structured populations, modeled by networks with diverse topological properties. Cooperative strategies are just one example of the many traits that can be transmitted on social networks. Several recent studies based on empirical evidence from a medical database have suggested the existence of a 3 degrees of influence rule, according to which not only our "friends", but also our friends' friends, and our friends' friends' friends, have a non-trivial influence on our decisions. We investigate the degree of peer influence that emerges from the spread of cooperative strategies, opinions and diseases on populations with distinct underlying networks of contacts. Our results show that networks naturally entangle individuals into interactions of many-body nature and that for each network class considered different processes lead to identical degrees of influence. None

Stochastic win-stay-lose-shift strategy with dynamic aspirations in evolutionary social dilemmas

NASA Astrophysics Data System (ADS)

Amaral, Marco A.; Wardil, Lucas; Perc, Matjaž; da Silva, Jafferson K. L.

2016-09-01

In times of plenty expectations rise, just as in times of crisis they fall. This can be mathematically described as a win-stay-lose-shift strategy with dynamic aspiration levels, where individuals aspire to be as wealthy as their average neighbor. Here we investigate this model in the realm of evolutionary social dilemmas on the square lattice and scale-free networks. By using the master equation and Monte Carlo simulations, we find that cooperators coexist with defectors in the whole phase diagram, even at high temptations to defect. We study the microscopic mechanism that is responsible for the striking persistence of cooperative behavior and find that cooperation spreads through second-order neighbors, rather than by means of network reciprocity that dominates in imitation-based models. For the square lattice the master equation can be solved analytically in the large temperature limit of the Fermi function, while for other cases the resulting differential equations must be solved numerically. Either way, we find good qualitative agreement with the Monte Carlo simulation results. Our analysis also reveals that the evolutionary outcomes are to a large degree independent of the network topology, including the number of neighbors that are considered for payoff determination on lattices, which further corroborates the local character of the microscopic dynamics. Unlike large-scale spatial patterns that typically emerge due to network reciprocity, here local checkerboard-like patterns remain virtually unaffected by differences in the macroscopic properties of the interaction network.

Constraints imposed by pollinator behaviour on the ecology and evolution of plant mating systems.

PubMed

Devaux, C; Lepers, C; Porcher, E

2014-07-01

Most flowering plants rely on pollinators for their reproduction. Plant-pollinator interactions, although mutualistic, involve an inherent conflict of interest between both partners and may constrain plant mating systems at multiple levels: the immediate ecological plant selfing rates, their distribution in and contribution to pollination networks, and their evolution. Here, we review experimental evidence that pollinator behaviour influences plant selfing rates in pairs of interacting species, and that plants can modify pollinator behaviour through plastic and evolutionary changes in floral traits. We also examine how theoretical studies include pollinators, implicitly or explicitly, to investigate the role of their foraging behaviour in plant mating system evolution. In doing so, we call for more evolutionary models combining ecological and genetic factors, and additional experimental data, particularly to describe pollinator foraging behaviour. Finally, we show that recent developments in ecological network theory help clarify the impact of community-level interactions on plant selfing rates and their evolution and suggest new research avenues to expand the study of mating systems of animal-pollinated plant species to the level of the plant-pollinator networks. © 2014 The Authors. Journal of Evolutionary Biology © 2014 European Society For Evolutionary Biology.

Modeling Evolution on Nearly Neutral Network Fitness Landscapes

NASA Astrophysics Data System (ADS)

Yakushkina, Tatiana; Saakian, David B.

2017-08-01

To describe virus evolution, it is necessary to define a fitness landscape. In this article, we consider the microscopic models with the advanced version of neutral network fitness landscapes. In this problem setting, we suppose a fitness difference between one-point mutation neighbors to be small. We construct a modification of the Wright-Fisher model, which is related to ordinary infinite population models with nearly neutral network fitness landscape at the large population limit. From the microscopic models in the realistic sequence space, we derive two versions of nearly neutral network models: with sinks and without sinks. We claim that the suggested model describes the evolutionary dynamics of RNA viruses better than the traditional Wright-Fisher model with few sequences.

Hydraulic trade-offs and space filling enable better predictions of vascular structure and function in plants

PubMed Central

Savage, V. M.; Bentley, L. P.; Enquist, B. J.; Sperry, J. S.; Smith, D. D.; Reich, P. B.; von Allmen, E. I.

2010-01-01

Plant vascular networks are central to botanical form, function, and diversity. Here, we develop a theory for plant network scaling that is based on optimal space filling by the vascular system along with trade-offs between hydraulic safety and efficiency. Including these evolutionary drivers leads to predictions for sap flow, the taper of the radii of xylem conduits from trunk to terminal twig, and how the frequency of xylem conduits varies with conduit radius. To test our predictions, we use comprehensive empirical measurements of maple, oak, and pine trees and complementary literature data that we obtained for a wide range of tree species. This robust intra- and interspecific assessment of our botanical network model indicates that the central tendency of observed scaling properties supports our predictions much better than the West, Brown, and Enquist (WBE) or pipe models. Consequently, our model is a more accurate description of vascular architecture than what is given by existing network models and should be used as a baseline to understand and to predict the scaling of individual plants to whole forests. In addition, our model is flexible enough to allow the quantification of species variation around rules for network design. These results suggest that the evolutionary drivers that we propose have been fundamental in determining how physiological processes scale within and across plant species. PMID:21149696

Hydraulic trade-offs and space filling enable better predictions of vascular structure and function in plants.

PubMed

Savage, V M; Bentley, L P; Enquist, B J; Sperry, J S; Smith, D D; Reich, P B; von Allmen, E I

2010-12-28

Plant vascular networks are central to botanical form, function, and diversity. Here, we develop a theory for plant network scaling that is based on optimal space filling by the vascular system along with trade-offs between hydraulic safety and efficiency. Including these evolutionary drivers leads to predictions for sap flow, the taper of the radii of xylem conduits from trunk to terminal twig, and how the frequency of xylem conduits varies with conduit radius. To test our predictions, we use comprehensive empirical measurements of maple, oak, and pine trees and complementary literature data that we obtained for a wide range of tree species. This robust intra- and interspecific assessment of our botanical network model indicates that the central tendency of observed scaling properties supports our predictions much better than the West, Brown, and Enquist (WBE) or pipe models. Consequently, our model is a more accurate description of vascular architecture than what is given by existing network models and should be used as a baseline to understand and to predict the scaling of individual plants to whole forests. In addition, our model is flexible enough to allow the quantification of species variation around rules for network design. These results suggest that the evolutionary drivers that we propose have been fundamental in determining how physiological processes scale within and across plant species.

Inference of Transmission Network Structure from HIV Phylogenetic Trees

DOE PAGES

Giardina, Federica; Romero-Severson, Ethan Obie; Albert, Jan; ...

2017-01-13

Phylogenetic inference is an attractive means to reconstruct transmission histories and epidemics. However, there is not a perfect correspondence between transmission history and virus phylogeny. Both node height and topological differences may occur, depending on the interaction between within-host evolutionary dynamics and between-host transmission patterns. To investigate these interactions, we added a within-host evolutionary model in epidemiological simulations and examined if the resulting phylogeny could recover different types of contact networks. To further improve realism, we also introduced patient-specific differences in infectivity across disease stages, and on the epidemic level we considered incomplete sampling and the age of the epidemic.more » Second, we implemented an inference method based on approximate Bayesian computation (ABC) to discriminate among three well-studied network models and jointly estimate both network parameters and key epidemiological quantities such as the infection rate. Our ABC framework used both topological and distance-based tree statistics for comparison between simulated and observed trees. Overall, our simulations showed that a virus time-scaled phylogeny (genealogy) may be substantially different from the between-host transmission tree. This has important implications for the interpretation of what a phylogeny reveals about the underlying epidemic contact network. In particular, we found that while the within-host evolutionary process obscures the transmission tree, the diversification process and infectivity dynamics also add discriminatory power to differentiate between different types of contact networks. We also found that the possibility to differentiate contact networks depends on how far an epidemic has progressed, where distance-based tree statistics have more power early in an epidemic. Finally, we applied our ABC inference on two different outbreaks from the Swedish HIV-1 epidemic.« less

Inference of Transmission Network Structure from HIV Phylogenetic Trees

DOE Office of Scientific and Technical Information (OSTI.GOV)

Giardina, Federica; Romero-Severson, Ethan Obie; Albert, Jan

Phylogenetic inference is an attractive means to reconstruct transmission histories and epidemics. However, there is not a perfect correspondence between transmission history and virus phylogeny. Both node height and topological differences may occur, depending on the interaction between within-host evolutionary dynamics and between-host transmission patterns. To investigate these interactions, we added a within-host evolutionary model in epidemiological simulations and examined if the resulting phylogeny could recover different types of contact networks. To further improve realism, we also introduced patient-specific differences in infectivity across disease stages, and on the epidemic level we considered incomplete sampling and the age of the epidemic.more » Second, we implemented an inference method based on approximate Bayesian computation (ABC) to discriminate among three well-studied network models and jointly estimate both network parameters and key epidemiological quantities such as the infection rate. Our ABC framework used both topological and distance-based tree statistics for comparison between simulated and observed trees. Overall, our simulations showed that a virus time-scaled phylogeny (genealogy) may be substantially different from the between-host transmission tree. This has important implications for the interpretation of what a phylogeny reveals about the underlying epidemic contact network. In particular, we found that while the within-host evolutionary process obscures the transmission tree, the diversification process and infectivity dynamics also add discriminatory power to differentiate between different types of contact networks. We also found that the possibility to differentiate contact networks depends on how far an epidemic has progressed, where distance-based tree statistics have more power early in an epidemic. Finally, we applied our ABC inference on two different outbreaks from the Swedish HIV-1 epidemic.« less

Evolutionary games on graphs

NASA Astrophysics Data System (ADS)

Szabó, György; Fáth, Gábor

2007-07-01

Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.

Packets Distributing Evolutionary Algorithm Based on PSO for Ad Hoc Network

NASA Astrophysics Data System (ADS)

Xu, Xiao-Feng

2018-03-01

Wireless communication network has such features as limited bandwidth, changeful channel and dynamic topology, etc. Ad hoc network has lots of difficulties in accessing control, bandwidth distribution, resource assign and congestion control. Therefore, a wireless packets distributing Evolutionary algorithm based on PSO (DPSO)for Ad Hoc Network is proposed. Firstly, parameters impact on performance of network are analyzed and researched to obtain network performance effective function. Secondly, the improved PSO Evolutionary Algorithm is used to solve the optimization problem from local to global in the process of network packets distributing. The simulation results show that the algorithm can ensure fairness and timeliness of network transmission, as well as improve ad hoc network resource integrated utilization efficiency.

Network growth models: A behavioural basis for attachment proportional to fitness

NASA Astrophysics Data System (ADS)

Bell, Michael; Perera, Supun; Piraveenan, Mahendrarajah; Bliemer, Michiel; Latty, Tanya; Reid, Chris

2017-02-01

Several growth models have been proposed in the literature for scale-free complex networks, with a range of fitness-based attachment models gaining prominence recently. However, the processes by which such fitness-based attachment behaviour can arise are less well understood, making it difficult to compare the relative merits of such models. This paper analyses an evolutionary mechanism that would give rise to a fitness-based attachment process. In particular, it is proven by analytical and numerical methods that in homogeneous networks, the minimisation of maximum exposure to node unfitness leads to attachment probabilities that are proportional to node fitness. This result is then extended to heterogeneous networks, with supply chain networks being used as an example.

Application of stochastic processes in random growth and evolutionary dynamics

NASA Astrophysics Data System (ADS)

Oikonomou, Panagiotis

We study the effect of power-law distributed randomness on the dynamical behavior of processes such as stochastic growth patterns and evolution. First, we examine the geometrical properties of random shapes produced by a generalized stochastic Loewner Evolution driven by a superposition of a Brownian motion and a stable Levy process. The situation is defined by the usual stochastic Loewner Evolution parameter, kappa, as well as alpha which defines the power-law tail of the stable Levy distribution. We show that the properties of these patterns change qualitatively and singularly at critical values of kappa and alpha. It is reasonable to call such changes "phase transitions". These transitions occur as kappa passes through four and as alpha passes through one. Numerical simulations are used to explore the global scaling behavior of these patterns in each "phase". We show both analytically and numerically that the growth continues indefinitely in the vertical direction for alpha greater than 1, goes as logarithmically with time for alpha equals to 1, and saturates for alpha smaller than 1. The probability density has two different scales corresponding to directions along and perpendicular to the boundary. Scaling functions for the probability density are given for various limiting cases. Second, we study the effect of the architecture of biological networks on their evolutionary dynamics. In recent years, studies of the architecture of large networks have unveiled a common topology, called scale-free, in which a majority of the elements are poorly connected except for a small fraction of highly connected components. We ask how networks with distinct topologies can evolve towards a pre-established target phenotype through a process of random mutations and selection. We use networks of Boolean components as a framework to model a large class of phenotypes. Within this approach, we find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. While homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously towards the target phenotype. Moreover, we show that scale-free networks always evolve faster than homogeneous random networks; remarkably, this property does not depend on the precise value of the topological parameter. By contrast, homogeneous random networks require a specific tuning of their topological parameter in order to optimize their fitness. This model suggests that the evolutionary paths of biological networks, punctuated or continuous, may solely be determined by the network topology.

Modelling the public opinion transmission on social networks under opinion leaders

NASA Astrophysics Data System (ADS)

Li, Zuozhi; Li, Meng; Ji, Wanwan

2017-06-01

In this paper, based on Social Network Analysis (SNA), the social network model of opinion leaders influencing the public opinion transmission is explored. The hot event, A Female Driver Was Beaten Due To Lane Change, has characteristics of individual short-term and non-government intervention, which is used to data extraction, and formed of the network structure on opinion leaders influencing the public opinion transmission. And the evolution mechanism are analyzed in the three evolutionary situations. Opinion leaders influence micro-blogging public opinion on social network evolution model shows that this type of network public opinion transmission is largely constrained by opinion leaders, so the opinion leaders behavior supervising on the spread of this public opinion is pivotal, and which has a guiding significance.

Mesoscopic structure conditions the emergence of cooperation on social networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lozano, S.; Arenas, A.; Sanchez, A.

We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement withmore » the observations in both real substrates. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.« less

Structure versus time in the evolutionary diversification of avian carotenoid metabolic networks.

PubMed

Morrison, Erin S; Badyaev, Alexander V

2018-05-01

Historical associations of genes and proteins are thought to delineate pathways available to subsequent evolution; however, the effects of past functional involvements on contemporary evolution are rarely quantified. Here, we examined the extent to which the structure of a carotenoid enzymatic network persists in avian evolution. Specifically, we tested whether the evolution of carotenoid networks was most concordant with phylogenetically structured expansion from core reactions of common ancestors or with subsampling of biochemical pathway modules from an ancestral network. We compared structural and historical associations in 467 carotenoid networks of extant and ancestral species and uncovered the overwhelming effect of pre-existing metabolic network structure on carotenoid diversification over the last 50 million years of avian evolution. Over evolutionary time, birds repeatedly subsampled and recombined conserved biochemical modules, which likely maintained the overall structure of the carotenoid metabolic network during avian evolution. These findings explain the recurrent convergence of evolutionary distant species in carotenoid metabolism and weak phylogenetic signal in avian carotenoid evolution. Remarkable retention of an ancient metabolic structure throughout extensive and prolonged ecological diversification in avian carotenoid metabolism illustrates a fundamental requirement of organismal evolution - historical continuity of a deterministic network that links past and present functional associations of its components. © 2018 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2018 European Society For Evolutionary Biology.

An IUR evolutionary game model on the patent cooperate of Shandong China

NASA Astrophysics Data System (ADS)

Liu, Mengmeng; Ma, Yinghong; Liu, Zhiyuan; You, Xuemei

2017-06-01

Organizations of industries and university & research institutes cooperate to meet their respective needs based on social contacts, trust and share complementary resources. From the perspective of complex network together with the patent data of Shandong province in China, a novel evolutionary game model on patent cooperation network is presented. Two sides in the game model are industries and universities & research institutes respectively. The cooperation is represented by a connection when a new patent is developed together by the two sides. The optimal strategy of the evolutionary game model is quantified by the average positive cooperation probability p ¯ and the average payoff U ¯ . The feasibility of this game model is simulated on the parameters such as the knowledge spillover, the punishment, the development cost and the distribution coefficient of the benefit. The numerical simulations show that the cooperative behaviors are affected by the variation of parameters. The knowledge spillover displays different behaviors when the punishment is larger than the development cost or less than it. Those results indicate that reasonable punishment would improve the positive cooperation. The appropriate punishment will be useful to enhance the big degree nodes positively cooperate with industries and universities & research institutes. And an equitable plan for the distribution of cooperative profits is half-and-half distribution strategy for the two sides in game.

Between “design” and “bricolage”: Genetic networks, levels of selection, and adaptive evolution

PubMed Central

Wilkins, Adam S.

2007-01-01

The extent to which “developmental constraints” in complex organisms restrict evolutionary directions remains contentious. Yet, other forms of internal constraint, which have received less attention, may also exist. It will be argued here that a set of partial constraints below the level of phenotypes, those involving genes and molecules, influences and channels the set of possible evolutionary trajectories. At the top-most organizational level there are the genetic network modules, whose operations directly underlie complex morphological traits. The properties of these network modules, however, have themselves been set by the evolutionary history of the component genes and their interactions. Characterization of the components, structures, and operational dynamics of specific genetic networks should lead to a better understanding not only of the morphological traits they underlie but of the biases that influence the directions of evolutionary change. Furthermore, such knowledge may permit assessment of the relative degrees of probability of short evolutionary trajectories, those on the microevolutionary scale. In effect, a “network perspective” may help transform evolutionary biology into a scientific enterprise with greater predictive capability than it has hitherto possessed. PMID:17494754

Between "design" and "bricolage": genetic networks, levels of selection, and adaptive evolution.

PubMed

Wilkins, Adam S

2007-05-15

The extent to which "developmental constraints" in complex organisms restrict evolutionary directions remains contentious. Yet, other forms of internal constraint, which have received less attention, may also exist. It will be argued here that a set of partial constraints below the level of phenotypes, those involving genes and molecules, influences and channels the set of possible evolutionary trajectories. At the top-most organizational level there are the genetic network modules, whose operations directly underlie complex morphological traits. The properties of these network modules, however, have themselves been set by the evolutionary history of the component genes and their interactions. Characterization of the components, structures, and operational dynamics of specific genetic networks should lead to a better understanding not only of the morphological traits they underlie but of the biases that influence the directions of evolutionary change. Furthermore, such knowledge may permit assessment of the relative degrees of probability of short evolutionary trajectories, those on the microevolutionary scale. In effect, a "network perspective" may help transform evolutionary biology into a scientific enterprise with greater predictive capability than it has hitherto possessed.

Parametric Sensitivity Analysis of Oscillatory Delay Systems with an Application to Gene Regulation.

PubMed

Ingalls, Brian; Mincheva, Maya; Roussel, Marc R

2017-07-01

A parametric sensitivity analysis for periodic solutions of delay-differential equations is developed. Because phase shifts cause the sensitivity coefficients of a periodic orbit to diverge, we focus on sensitivities of the extrema, from which amplitude sensitivities are computed, and of the period. Delay-differential equations are often used to model gene expression networks. In these models, the parametric sensitivities of a particular genotype define the local geometry of the evolutionary landscape. Thus, sensitivities can be used to investigate directions of gradual evolutionary change. An oscillatory protein synthesis model whose properties are modulated by RNA interference is used as an example. This model consists of a set of coupled delay-differential equations involving three delays. Sensitivity analyses are carried out at several operating points. Comments on the evolutionary implications of the results are offered.

A novel framework of classical and quantum prisoner's dilemma games on coupled networks.

PubMed

Deng, Xinyang; Zhang, Qi; Deng, Yong; Wang, Zhen

2016-03-15

Evolutionary games on multilayer networks are attracting growing interest. While among previous studies, the role of quantum games in such a infrastructure is still virgin and may become a fascinating issue across a myriad of research realms. To mimick two kinds of different interactive environments and mechanisms, in this paper a new framework of classical and quantum prisoner's dilemma games on two-layer coupled networks is considered. Within the proposed model, the impact of coupling factor of networks and entanglement degree in quantum games on the evolutionary process has been studied. Simulation results show that the entanglement has no impact on the evolution of the classical prisoner's dilemma, while the rise of the coupling factor obviously impedes cooperation in this game, and the evolution of quantum prisoner's dilemma is greatly impacted by the combined effect of entanglement and coupling.

A novel framework of classical and quantum prisoner’s dilemma games on coupled networks

PubMed Central

Deng, Xinyang; Zhang, Qi; Deng, Yong; Wang, Zhen

2016-01-01

Evolutionary games on multilayer networks are attracting growing interest. While among previous studies, the role of quantum games in such a infrastructure is still virgin and may become a fascinating issue across a myriad of research realms. To mimick two kinds of different interactive environments and mechanisms, in this paper a new framework of classical and quantum prisoner’s dilemma games on two-layer coupled networks is considered. Within the proposed model, the impact of coupling factor of networks and entanglement degree in quantum games on the evolutionary process has been studied. Simulation results show that the entanglement has no impact on the evolution of the classical prisoner’s dilemma, while the rise of the coupling factor obviously impedes cooperation in this game, and the evolution of quantum prisoner’s dilemma is greatly impacted by the combined effect of entanglement and coupling. PMID:26975447

Using Evolved Fuzzy Neural Networks for Injury Detection from Isokinetic Curves

NASA Astrophysics Data System (ADS)

Couchet, Jorge; Font, José María; Manrique, Daniel

In this paper we propose an evolutionary fuzzy neural networks system for extracting knowledge from a set of time series containing medical information. The series represent isokinetic curves obtained from a group of patients exercising the knee joint on an isokinetic dynamometer. The system has two parts: i) it analyses the time series input in order generate a simplified model of an isokinetic curve; ii) it applies a grammar-guided genetic program to obtain a knowledge base represented by a fuzzy neural network. Once the knowledge base has been generated, the system is able to perform knee injuries detection. The results suggest that evolved fuzzy neural networks perform better than non-evolutionary approaches and have a high accuracy rate during both the training and testing phases. Additionally, they are robust, as the system is able to self-adapt to changes in the problem without human intervention.

Evolutionary Topology of a Currency Network in Asia

NASA Astrophysics Data System (ADS)

Feng, Xiaobing; Wang, Xiaofan

Although recently there are extensive research on currency network using minimum spanning trees approach, the knowledge about the actual evolution of a currency web in Asia is still limited. In the paper, we study the structural evolution of an Asian network using daily exchange rate data. It was found that the correlation between Asian currencies and US Dollar, the previous regional key currency has become weaker and the intra-Asia interactions have increased. This becomes more salient after the exchange rate reform of China. Different from the previous studies, we further reveal that it is the trade volume, national wealth gap and countries growth cycle that has contributed to the evolutionary topology of the minimum spanning tree. These findings provide a valuable platform for theoretical modeling and further analysis.

Adaptive evolutionary walks require neutral intermediates in RNA fitness landscapes.

PubMed

Rendel, Mark D

2011-01-01

In RNA fitness landscapes with interconnected networks of neutral mutations, neutral precursor mutations can play an important role in facilitating the accessibility of epistatic adaptive mutant combinations. I use an exhaustively surveyed fitness landscape model based on short sequence RNA genotypes (and their secondary structure phenotypes) to calculate the minimum rate at which mutants initially appearing as neutral are incorporated into an adaptive evolutionary walk. I show first, that incorporating neutral mutations significantly increases the number of point mutations in a given evolutionary walk when compared to estimates from previous adaptive walk models. Second, that incorporating neutral mutants into such a walk significantly increases the final fitness encountered on that walk - indeed evolutionary walks including neutral steps often reach the global optimum in this model. Third, and perhaps most importantly, evolutionary paths of this kind are often extremely winding in their nature and have the potential to undergo multiple mutations at a given sequence position within a single walk; the potential of these winding paths to mislead phylogenetic reconstruction is briefly considered. Copyright © 2010 Elsevier Inc. All rights reserved.

Evolutionary trends and functional anatomy of the human expanded autophagy network

PubMed Central

Till, Andreas; Saito, Rintaro; Merkurjev, Daria; Liu, Jing-Jing; Syed, Gulam Hussain; Kolnik, Martin; Siddiqui, Aleem; Glas, Martin; Scheffler, Björn; Ideker, Trey; Subramani, Suresh

2015-01-01

All eukaryotic cells utilize autophagy for protein and organelle turnover, thus assuring subcellular quality control, homeostasis, and survival. In order to address recent advances in identification of human autophagy associated genes, and to describe autophagy on a system-wide level, we established an autophagy-centered gene interaction network by merging various primary data sets and by retrieving respective interaction data. The resulting network (‘AXAN’) was analyzed with respect to subnetworks, e.g. the prime gene subnetwork (including the core machinery, signaling pathways and autophagy receptors) and the transcription subnetwork. To describe aspects of evolution within this network, we assessed the presence of protein orthologs across 99 eukaryotic model organisms. We visualized evolutionary trends for prime gene categories and evolutionary tracks for selected AXAN genes. This analysis confirms the eukaryotic origin of autophagy core genes while it points to a diverse evolutionary history of autophagy receptors. Next, we used module identification to describe the functional anatomy of the network at the level of pathway modules. In addition to obvious pathways (e.g., lysosomal degradation, insulin signaling) our data unveil the existence of context-related modules such as Rho GTPase signaling. Last, we used a tripartite, image-based RNAi – screen to test candidate genes predicted to play a role in regulation of autophagy. We verified the Rho GTPase, CDC42, as a novel regulator of autophagy-related signaling. This study emphasizes the applicability of system-wide approaches to gain novel insights into a complex biological process and to describe the human autophagy pathway at a hitherto unprecedented level of detail. PMID:26103419

Emergence and dynamics of self-producing information niches as a step towards pre-evolutionary organization

PubMed Central

Carter, Richard J.; Wiesner, Karoline

2018-01-01

As a step towards understanding pre-evolutionary organization in non-genetic systems, we develop a model to investigate the emergence and dynamics of proto-autopoietic networks in an interacting population of simple information processing entities (automata). Our simulations indicate that dynamically stable strongly connected networks of mutually producing communication channels emerge under specific environmental conditions. We refer to these distinct organizational steady states as information niches. In each case, we measure the information content by the Shannon entropy, and determine the fitness landscape, robustness and transition pathways for information niches subjected to intermittent environmental perturbations under non-evolutionary conditions. By determining the information required to generate each niche, we show that niche transitions are only allowed if accompanied by an equal or increased level of information production that arises internally or via environmental perturbations that serve as an exogenous source of population diversification. Overall, our simulations show how proto-autopoietic networks of basic information processors form and compete, and under what conditions they persist over time or go extinct. These findings may be relevant to understanding how inanimate systems such as chemically communicating protocells can initiate the transition to living matter prior to the onset of contemporary evolutionary and genetic mechanisms. PMID:29343630

a Weighted Local-World Evolving Network Model Based on the Edge Weights Preferential Selection

NASA Astrophysics Data System (ADS)

Li, Ping; Zhao, Qingzhen; Wang, Haitang

2013-05-01

In this paper, we use the edge weights preferential attachment mechanism to build a new local-world evolutionary model for weighted networks. It is different from previous papers that the local-world of our model consists of edges instead of nodes. Each time step, we connect a new node to two existing nodes in the local-world through the edge weights preferential selection. Theoretical analysis and numerical simulations show that the scale of the local-world affect on the weight distribution, the strength distribution and the degree distribution. We give the simulations about the clustering coefficient and the dynamics of infectious diseases spreading. The weight dynamics of our network model can portray the structure of realistic networks such as neural network of the nematode C. elegans and Online Social Network.

Dynamic Evolution Model Based on Social Network Services

NASA Astrophysics Data System (ADS)

Xiong, Xi; Gou, Zhi-Jian; Zhang, Shi-Bin; Zhao, Wen

2013-11-01

Based on the analysis of evolutionary characteristics of public opinion in social networking services (SNS), in the paper we propose a dynamic evolution model, in which opinions are coupled with topology. This model shows the clustering phenomenon of opinions in dynamic network evolution. The simulation results show that the model can fit the data from a social network site. The dynamic evolution of networks accelerates the opinion, separation and aggregation. The scale and the number of clusters are influenced by confidence limit and rewiring probability. Dynamic changes of the topology reduce the number of isolated nodes, while the increased confidence limit allows nodes to communicate more sufficiently. The two effects make the distribution of opinion more neutral. The dynamic evolution of networks generates central clusters with high connectivity and high betweenness, which make it difficult to control public opinions in SNS.

Double-dealing behavior potentially promotes cooperation in evolutionary prisoner's dilemma games

NASA Astrophysics Data System (ADS)

Dai, Qionglin; Li, Haihong; Cheng, Hongyan; Li, Yuting; Yang, Junzhong

2010-11-01

We investigate the effects of double-dealing behavior on cooperation in evolutionary games. Each individual in a population has two attributes: character and action. One's action may be consistent with one's character or not. We provide analytical results by a mean-field description of evolutionary prisoner's dilemma games (PDGs). Moreover, we give numerical results on different networks, ranging from square lattices to scale-free networks (SFNs). Two important conclusions have been drawn from the results on SFNs. Firstly, if only non-influential individuals (those with low degrees) have chances of becoming double-dealers, cooperation is certain to deteriorate. Secondly, when influential individuals (those with high degrees) adopt double-dealing behavior moderately, cooperation would be enhanced, which is in opposition to the traditional belief. These results help us to understand better the social phenomenon of the existence of double-dealers. In addition to the PDG, other types of games including the snowdrift game, the stag-hunt game and the harmony game have also been studied on our model. The results for these three games are also presented, which are consistent with the results for the PDG qualitatively. Furthermore, we consider our model under the co-evolution framework, in which the probability of an individual changing into a double-dealer and the individual strategy both could evolve during the evolutionary process.

Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks

NASA Astrophysics Data System (ADS)

Wu, Yu'E.; Chang, Shuhua; Zhang, Zhipeng; Deng, Zhenghong

2017-01-01

Social reward, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this paper, we study the evolution of cooperation by proposing a reward model in network population, where a third strategy, reward, as an independent yet particular type of cooperation is introduced in 2-person evolutionary games. Specifically, a new kind of role corresponding to reward strategy, reward agents, is defined, which is aimed at increasing the income of cooperators by applying to them a social reward. Results from numerical simulations show that consideration of social reward greatly promotes the evolution of cooperation, which is confirmed for different network topologies and two evolutionary games. Moreover, we explore the microscopic mechanisms for the promotion of cooperation in the three-strategy model. As expected, the reward agents play a vital role in the formation of cooperative clusters, thus resisting the aggression of defectors. Our research might provide valuable insights into further exploring the nature of cooperation in the real world.

Impact of Social Reward on the Evolution of the Cooperation Behavior in Complex Networks

PubMed Central

Wu, Yu’e; Chang, Shuhua; Zhang, Zhipeng; Deng, Zhenghong

2017-01-01

Social reward, as a significant mechanism explaining the evolution of cooperation, has attracted great attention both theoretically and experimentally. In this paper, we study the evolution of cooperation by proposing a reward model in network population, where a third strategy, reward, as an independent yet particular type of cooperation is introduced in 2-person evolutionary games. Specifically, a new kind of role corresponding to reward strategy, reward agents, is defined, which is aimed at increasing the income of cooperators by applying to them a social reward. Results from numerical simulations show that consideration of social reward greatly promotes the evolution of cooperation, which is confirmed for different network topologies and two evolutionary games. Moreover, we explore the microscopic mechanisms for the promotion of cooperation in the three-strategy model. As expected, the reward agents play a vital role in the formation of cooperative clusters, thus resisting the aggression of defectors. Our research might provide valuable insights into further exploring the nature of cooperation in the real world. PMID:28112276

Cooperation in N-person evolutionary snowdrift game in scale-free Barabási Albert networks

NASA Astrophysics Data System (ADS)

Lee, K. H.; Chan, Chun-Him; Hui, P. M.; Zheng, Da-Fang

2008-09-01

Cooperation in the N-person evolutionary snowdrift game (NESG) is studied in scale-free Barabási-Albert (BA) networks. Due to the inhomogeneity of the network, two versions of NESG are proposed and studied. In a model where the size of the competing group varies from agent to agent, the fraction of cooperators drops as a function of the payoff parameter. The networking effect is studied via the fraction of cooperative agents for nodes with a particular degree. For small payoff parameters, it is found that the small- k agents are dominantly cooperators, while large- k agents are of non-cooperators. Studying the spatial correlation reveals that cooperative agents will avoid to be nearest neighbors and the correlation disappears beyond the next-nearest neighbors. The behavior can be explained in terms of the networking effect and payoffs. In another model with a fixed size of competing groups, the fraction of cooperators could show a non-monotonic behavior in the regime of small payoff parameters. This non-trivial behavior is found to be a combined effect of the many agents with the smallest degree in the BA network and the increasing fraction of cooperators among these agents with the payoff for small payoffs.

Network motif frequency vectors reveal evolving metabolic network organisation.

PubMed

Pearcy, Nicole; Crofts, Jonathan J; Chuzhanova, Nadia

2015-01-01

At the systems level many organisms of interest may be described by their patterns of interaction, and as such, are perhaps best characterised via network or graph models. Metabolic networks, in particular, are fundamental to the proper functioning of many important biological processes, and thus, have been widely studied over the past decade or so. Such investigations have revealed a number of shared topological features, such as a short characteristic path-length, large clustering coefficient and hierarchical modular structure. However, the extent to which evolutionary and functional properties of metabolism manifest via this underlying network architecture remains unclear. In this paper, we employ a novel graph embedding technique, based upon low-order network motifs, to compare metabolic network structure for 383 bacterial species categorised according to a number of biological features. In particular, we introduce a new global significance score which enables us to quantify important evolutionary relationships that exist between organisms and their physical environments. Using this new approach, we demonstrate a number of significant correlations between environmental factors, such as growth conditions and habitat variability, and network motif structure, providing evidence that organism adaptability leads to increased complexities in the resultant metabolic networks.

Are there laws of genome evolution?

PubMed

Koonin, Eugene V

2011-08-01

Research in quantitative evolutionary genomics and systems biology led to the discovery of several universal regularities connecting genomic and molecular phenomic variables. These universals include the log-normal distribution of the evolutionary rates of orthologous genes; the power law-like distributions of paralogous family size and node degree in various biological networks; the negative correlation between a gene's sequence evolution rate and expression level; and differential scaling of functional classes of genes with genome size. The universals of genome evolution can be accounted for by simple mathematical models similar to those used in statistical physics, such as the birth-death-innovation model. These models do not explicitly incorporate selection; therefore, the observed universal regularities do not appear to be shaped by selection but rather are emergent properties of gene ensembles. Although a complete physical theory of evolutionary biology is inconceivable, the universals of genome evolution might qualify as "laws of evolutionary genomics" in the same sense "law" is understood in modern physics.

A Novel Handwritten Letter Recognizer Using Enhanced Evolutionary Neural Network

NASA Astrophysics Data System (ADS)

Mahmoudi, Fariborz; Mirzashaeri, Mohsen; Shahamatnia, Ehsan; Faridnia, Saed

This paper introduces a novel design for handwritten letter recognition by employing a hybrid back-propagation neural network with an enhanced evolutionary algorithm. Feeding the neural network consists of a new approach which is invariant to translation, rotation, and scaling of input letters. Evolutionary algorithm is used for the global search of the search space and the back-propagation algorithm is used for the local search. The results have been computed by implementing this approach for recognizing 26 English capital letters in the handwritings of different people. The computational results show that the neural network reaches very satisfying results with relatively scarce input data and a promising performance improvement in convergence of the hybrid evolutionary back-propagation algorithms is exhibited.

Beyond topology: coevolution of structure and flux in metabolic networks.

PubMed

Morrison, E S; Badyaev, A V

2017-10-01

Interactions between the structure of a metabolic network and its functional properties underlie its evolutionary diversification, but the mechanism by which such interactions arise remains elusive. Particularly unclear is whether metabolic fluxes that determine the concentrations of compounds produced by a metabolic network, are causally linked to a network's structure or emerge independently of it. A direct empirical study of populations where both structural and functional properties vary among individuals' metabolic networks is required to establish whether changes in structure affect the distribution of metabolic flux. In a population of house finches (Haemorhous mexicanus), we reconstructed full carotenoid metabolic networks for 442 individuals and uncovered 11 structural variants of this network with different compounds and reactions. We examined the consequences of this structural diversity for the concentrations of plumage-bound carotenoids produced by flux in these networks. We found that concentrations of metabolically derived, but not dietary carotenoids, depended on network structure. Flux was partitioned similarly among compounds in individuals of the same network structure: within each network, compound concentrations were closely correlated. The highest among-individual variation in flux occurred in networks with the strongest among-compound correlations, suggesting that changes in the magnitude, but not the distribution of flux, underlie individual differences in compound concentrations on a static network structure. These findings indicate that the distribution of flux in carotenoid metabolism closely follows network structure. Thus, evolutionary diversification and local adaptations in carotenoid metabolism may depend more on the gain or loss of enzymatic reactions than on changes in flux within a network structure. © 2017 European Society For Evolutionary Biology. Journal of Evolutionary Biology © 2017 European Society For Evolutionary Biology.

Evolutionary neural networks for anomaly detection based on the behavior of a program.

PubMed

Han, Sang-Jun; Cho, Sung-Bae

2006-06-01

The process of learning the behavior of a given program by using machine-learning techniques (based on system-call audit data) is effective to detect intrusions. Rule learning, neural networks, statistics, and hidden Markov models (HMMs) are some of the kinds of representative methods for intrusion detection. Among them, neural networks are known for good performance in learning system-call sequences. In order to apply this knowledge to real-world problems successfully, it is important to determine the structures and weights of these call sequences. However, finding the appropriate structures requires very long time periods because there are no suitable analytical solutions. In this paper, a novel intrusion-detection technique based on evolutionary neural networks (ENNs) is proposed. One advantage of using ENNs is that it takes less time to obtain superior neural networks than when using conventional approaches. This is because they discover the structures and weights of the neural networks simultaneously. Experimental results with the 1999 Defense Advanced Research Projects Agency (DARPA) Intrusion Detection Evaluation (IDEVAL) data confirm that ENNs are promising tools for intrusion detection.

On the Interplay between the Evolvability and Network Robustness in an Evolutionary Biological Network: A Systems Biology Approach

PubMed Central

Chen, Bor-Sen; Lin, Ying-Po

2011-01-01

In the evolutionary process, the random transmission and mutation of genes provide biological diversities for natural selection. In order to preserve functional phenotypes between generations, gene networks need to evolve robustly under the influence of random perturbations. Therefore, the robustness of the phenotype, in the evolutionary process, exerts a selection force on gene networks to keep network functions. However, gene networks need to adjust, by variations in genetic content, to generate phenotypes for new challenges in the network’s evolution, ie, the evolvability. Hence, there should be some interplay between the evolvability and network robustness in evolutionary gene networks. In this study, the interplay between the evolvability and network robustness of a gene network and a biochemical network is discussed from a nonlinear stochastic system point of view. It was found that if the genetic robustness plus environmental robustness is less than the network robustness, the phenotype of the biological network is robust in evolution. The tradeoff between the genetic robustness and environmental robustness in evolution is discussed from the stochastic stability robustness and sensitivity of the nonlinear stochastic biological network, which may be relevant to the statistical tradeoff between bias and variance, the so-called bias/variance dilemma. Further, the tradeoff could be considered as an antagonistic pleiotropic action of a gene network and discussed from the systems biology perspective. PMID:22084563

How mutation affects evolutionary games on graphs

PubMed Central

Allen, Benjamin; Traulsen, Arne; Tarnita, Corina E.; Nowak, Martin A.

2011-01-01

Evolutionary dynamics are affected by population structure, mutation rates and update rules. Spatial or network structure facilitates the clustering of strategies, which represents a mechanism for the evolution of cooperation. Mutation dilutes this effect. Here we analyze how mutation influences evolutionary clustering on graphs. We introduce new mathematical methods to evolutionary game theory, specifically the analysis of coalescing random walks via generating functions. These techniques allow us to derive exact identity-by-descent (IBD) probabilities, which characterize spatial assortment on lattices and Cayley trees. From these IBD probabilities we obtain exact conditions for the evolution of cooperation and other game strategies, showing the dual effects of graph topology and mutation rate. High mutation rates diminish the clustering of cooperators, hindering their evolutionary success. Our model can represent either genetic evolution with mutation, or social imitation processes with random strategy exploration. PMID:21473871

Quantum Prisoner’s Dilemma game on hypergraph networks

NASA Astrophysics Data System (ADS)

Pawela, Łukasz; Sładkowski, Jan

2013-02-01

We study the possible advantages of adopting quantum strategies in multi-player evolutionary games. We base our study on the three-player Prisoner’s Dilemma (PD) game. In order to model the simultaneous interaction between three agents we use hypergraphs and hypergraph networks. In particular, we study two types of networks: a random network and a SF-like network. The obtained results show that in the case of a three-player game on a hypergraph network, quantum strategies are not necessarily stochastically stable strategies. In some cases, the defection strategy can be as good as a quantum one.

Human Inspired Self-developmental Model of Neural Network (HIM): Introducing Content/Form Computing

NASA Astrophysics Data System (ADS)

Krajíček, Jiří

This paper presents cross-disciplinary research between medical/psychological evidence on human abilities and informatics needs to update current models in computer science to support alternative methods for computation and communication. In [10] we have already proposed hypothesis introducing concept of human information model (HIM) as cooperative system. Here we continue on HIM design in detail. In our design, first we introduce Content/Form computing system which is new principle of present methods in evolutionary computing (genetic algorithms, genetic programming). Then we apply this system on HIM (type of artificial neural network) model as basic network self-developmental paradigm. Main inspiration of our natural/human design comes from well known concept of artificial neural networks, medical/psychological evidence and Sheldrake theory of "Nature as Alive" [22].

Model of community emergence in weighted social networks

NASA Astrophysics Data System (ADS)

Kumpula, J. M.; Onnela, J.-P.; Saramäki, J.; Kertész, J.; Kaski, K.

2009-04-01

Over the years network theory has proven to be rapidly expanding methodology to investigate various complex systems and it has turned out to give quite unparalleled insight to their structure, function, and response through data analysis, modeling, and simulation. For social systems in particular the network approach has empirically revealed a modular structure due to interplay between the network topology and link weights between network nodes or individuals. This inspired us to develop a simple network model that could catch some salient features of mesoscopic community and macroscopic topology formation during network evolution. Our model is based on two fundamental mechanisms of network sociology for individuals to find new friends, namely cyclic closure and focal closure, which are mimicked by local search-link-reinforcement and random global attachment mechanisms, respectively. In addition we included to the model a node deletion mechanism by removing all its links simultaneously, which corresponds for an individual to depart from the network. Here we describe in detail the implementation of our model algorithm, which was found to be computationally efficient and produce many empirically observed features of large-scale social networks. Thus this model opens a new perspective for studying such collective social phenomena as spreading, structure formation, and evolutionary processes.

Evolutionary robotics simulations help explain why reciprocity is rare in nature

PubMed Central

André, Jean-Baptiste; Nolfi, Stefano

2016-01-01

The relative rarity of reciprocity in nature, contrary to theoretical predictions that it should be widespread, is currently one of the major puzzles in social evolution theory. Here we use evolutionary robotics to solve this puzzle. We show that models based on game theory are misleading because they neglect the mechanics of behavior. In a series of experiments with simulated robots controlled by artificial neural networks, we find that reciprocity does not evolve, and show that this results from a general constraint that likely also prevents it from evolving in the wild. Reciprocity can evolve if it requires very few mutations, as is usually assumed in evolutionary game theoretic models, but not if, more realistically, it requires the accumulation of many adaptive mutations. PMID:27616139

A general stochastic model for studying time evolution of transition networks

NASA Astrophysics Data System (ADS)

Zhan, Choujun; Tse, Chi K.; Small, Michael

2016-12-01

We consider a class of complex networks whose nodes assume one of several possible states at any time and may change their states from time to time. Such networks represent practical networks of rumor spreading, disease spreading, language evolution, and so on. Here, we derive a model describing the dynamics of this kind of network and a simulation algorithm for studying the network evolutionary behavior. This model, derived at a microscopic level, can reveal the transition dynamics of every node. A numerical simulation is taken as an ;experiment; or ;realization; of the model. We use this model to study the disease propagation dynamics in four different prototypical networks, namely, the regular nearest-neighbor (RN) network, the classical Erdös-Renyí (ER) random graph, the Watts-Strogátz small-world (SW) network, and the Barabási-Albert (BA) scalefree network. We find that the disease propagation dynamics in these four networks generally have different properties but they do share some common features. Furthermore, we utilize the transition network model to predict user growth in the Facebook network. Simulation shows that our model agrees with the historical data. The study can provide a useful tool for a more thorough understanding of the dynamics networks.

Analysis of Network Topologies Underlying Ethylene Growth Response Kinetics

PubMed Central

Prescott, Aaron M.; McCollough, Forest W.; Eldreth, Bryan L.; Binder, Brad M.; Abel, Steven M.

2016-01-01

Most models for ethylene signaling involve a linear pathway. However, measurements of seedling growth kinetics when ethylene is applied and removed have resulted in more complex network models that include coherent feedforward, negative feedback, and positive feedback motifs. The dynamical responses of the proposed networks have not been explored in a quantitative manner. Here, we explore (i) whether any of the proposed models are capable of producing growth-response behaviors consistent with experimental observations and (ii) what mechanistic roles various parts of the network topologies play in ethylene signaling. To address this, we used computational methods to explore two general network topologies: The first contains a coherent feedforward loop that inhibits growth and a negative feedback from growth onto itself (CFF/NFB). In the second, ethylene promotes the cleavage of EIN2, with the product of the cleavage inhibiting growth and promoting the production of EIN2 through a positive feedback loop (PFB). Since few network parameters for ethylene signaling are known in detail, we used an evolutionary algorithm to explore sets of parameters that produce behaviors similar to experimental growth response kinetics of both wildtype and mutant seedlings. We generated a library of parameter sets by independently running the evolutionary algorithm many times. Both network topologies produce behavior consistent with experimental observations, and analysis of the parameter sets allows us to identify important network interactions and parameter constraints. We additionally screened these parameter sets for growth recovery in the presence of sub-saturating ethylene doses, which is an experimentally-observed property that emerges in some of the evolved parameter sets. Finally, we probed simplified networks maintaining key features of the CFF/NFB and PFB topologies. From this, we verified observations drawn from the larger networks about mechanisms underlying ethylene signaling. Analysis of each network topology results in predictions about changes that occur in network components that can be experimentally tested to give insights into which, if either, network underlies ethylene responses. PMID:27625669

Evolutionary Artificial Neural Network Weight Tuning to Optimize Decision Making for an Abstract Game

DTIC Science & Technology

2010-03-01

separate LoA heuristic. If any of the examined heuristics produced competitive player , then the final measurement was a success . Barring that, a...if offline training actually results in a successful player . Whereas offline learning plays many games and then trains as many networks as desired...a competitive Lines of Action player , shedding light on the difficulty of developing a neural network to model such a large and complex solution

Orthoscape: a cytoscape application for grouping and visualization KEGG based gene networks by taxonomy and homology principles.

PubMed

Mustafin, Zakhar Sergeevich; Lashin, Sergey Alexandrovich; Matushkin, Yury Georgievich; Gunbin, Konstantin Vladimirovich; Afonnikov, Dmitry Arkadievich

2017-01-27

There are many available software tools for visualization and analysis of biological networks. Among them, Cytoscape ( http://cytoscape.org/ ) is one of the most comprehensive packages, with many plugins and applications which extends its functionality by providing analysis of protein-protein interaction, gene regulatory and gene co-expression networks, metabolic, signaling, neural as well as ecological-type networks including food webs, communities networks etc. Nevertheless, only three plugins tagged 'network evolution' found in Cytoscape official app store and in literature. We have developed a new Cytoscape 3.0 application Orthoscape aimed to facilitate evolutionary analysis of gene networks and visualize the results. Orthoscape aids in analysis of evolutionary information available for gene sets and networks by highlighting: (1) the orthology relationships between genes; (2) the evolutionary origin of gene network components; (3) the evolutionary pressure mode (diversifying or stabilizing, negative or positive selection) of orthologous groups in general and/or branch-oriented mode. The distinctive feature of Orthoscape is the ability to control all data analysis steps via user-friendly interface. Orthoscape allows its users to analyze gene networks or separated gene sets in the context of evolution. At each step of data analysis, Orthoscape also provides for convenient visualization and data manipulation.

Relative impacts of environmental variation and evolutionary history on the nestedness and modularity of tree–herbivore networks

PubMed Central

Robinson, Kathryn M; Hauzy, Céline; Loeuille, Nicolas; Albrectsen, Benedicte R

2015-01-01

Nestedness and modularity are measures of ecological networks whose causative effects are little understood. We analyzed antagonistic plant–herbivore bipartite networks using common gardens in two contrasting environments comprised of aspen trees with differing evolutionary histories of defence against herbivores. These networks were tightly connected owing to a high level of specialization of arthropod herbivores that spend a large proportion of the life cycle on aspen. The gardens were separated by ten degrees of latitude with resultant differences in abiotic conditions. We evaluated network metrics and reported similar connectance between gardens but greater numbers of links per species in the northern common garden. Interaction matrices revealed clear nestedness, indicating subsetting of the bipartite interactions into specialist divisions, in both the environmental and evolutionary aspen groups, although nestedness values were only significant in the northern garden. Variation in plant vulnerability, measured as the frequency of herbivore specialization in the aspen population, was significantly partitioned by environment (common garden) but not by evolutionary origin of the aspens. Significant values of modularity were observed in all network matrices. Trait-matching indicated that growth traits, leaf morphology, and phenolic metabolites affected modular structure in both the garden and evolutionary groups, whereas extra-floral nectaries had little influence. Further examination of module configuration revealed that plant vulnerability explained considerable variance in web structure. The contrasting conditions between the two gardens resulted in bottom-up effects of the environment, which most strongly influenced the overall network architecture, however, the aspen groups with dissimilar evolutionary history also showed contrasting degrees of nestedness and modularity. Our research therefore shows that, while evolution does affect the structure of aspen–herbivore bipartite networks, the role of environmental variations is a dominant constraint. PMID:26306175

The Handicap Principle for Trust in Computer Security, the Semantic Web and Social Networking

NASA Astrophysics Data System (ADS)

Ma, Zhanshan (Sam); Krings, Axel W.; Hung, Chih-Cheng

Communication is a fundamental function of life, and it exists in almost all living things: from single-cell bacteria to human beings. Communication, together with competition and cooperation,arethree fundamental processes in nature. Computer scientists are familiar with the study of competition or 'struggle for life' through Darwin's evolutionary theory, or even evolutionary computing. They may be equally familiar with the study of cooperation or altruism through the Prisoner's Dilemma (PD) game. However, they are likely to be less familiar with the theory of animal communication. The objective of this article is three-fold: (i) To suggest that the study of animal communication, especially the honesty (reliability) of animal communication, in which some significant advances in behavioral biology have been achieved in the last three decades, should be on the verge to spawn important cross-disciplinary research similar to that generated by the study of cooperation with the PD game. One of the far-reaching advances in the field is marked by the publication of "The Handicap Principle: a Missing Piece of Darwin's Puzzle" by Zahavi (1997). The 'Handicap' principle [34][35], which states that communication signals must be costly in some proper way to be reliable (honest), is best elucidated with evolutionary games, e.g., Sir Philip Sidney (SPS) game [23]. Accordingly, we suggest that the Handicap principle may serve as a fundamental paradigm for trust research in computer science. (ii) To suggest to computer scientists that their expertise in modeling computer networks may help behavioral biologists in their study of the reliability of animal communication networks. This is largely due to the historical reason that, until the last decade, animal communication was studied with the dyadic paradigm (sender-receiver) rather than with the network paradigm. (iii) To pose several open questions, the answers to which may bear some refreshing insights to trust research in computer science, especially secure and resilient computing, the semantic web, and social networking. One important thread unifying the three aspects is the evolutionary game theory modeling or its extensions with survival analysis and agreement algorithms [19][20], which offer powerful game models for describing time-, space-, and covariate-dependent frailty (uncertainty and vulnerability) and deception (honesty).

Modeling an aquatic ecosystem: application of an evolutionary algorithm with genetic doping to reduce prediction uncertainty

NASA Astrophysics Data System (ADS)

Friedel, Michael; Buscema, Massimo

2016-04-01

Aquatic ecosystem models can potentially be used to understand the influence of stresses on catchment resource quality. Given that catchment responses are functions of natural and anthropogenic stresses reflected in sparse and spatiotemporal biological, physical, and chemical measurements, an ecosystem is difficult to model using statistical or numerical methods. We propose an artificial adaptive systems approach to model ecosystems. First, an unsupervised machine-learning (ML) network is trained using the set of available sparse and disparate data variables. Second, an evolutionary algorithm with genetic doping is applied to reduce the number of ecosystem variables to an optimal set. Third, the optimal set of ecosystem variables is used to retrain the ML network. Fourth, a stochastic cross-validation approach is applied to quantify and compare the nonlinear uncertainty in selected predictions of the original and reduced models. Results are presented for aquatic ecosystems (tens of thousands of square kilometers) undergoing landscape change in the USA: Upper Illinois River Basin and Central Colorado Assessment Project Area, and Southland region, NZ.

Community detection in complex networks by using membrane algorithm

NASA Astrophysics Data System (ADS)

Liu, Chuang; Fan, Linan; Liu, Zhou; Dai, Xiang; Xu, Jiamei; Chang, Baoren

Community detection in complex networks is a key problem of network analysis. In this paper, a new membrane algorithm is proposed to solve the community detection in complex networks. The proposed algorithm is based on membrane systems, which consists of objects, reaction rules, and a membrane structure. Each object represents a candidate partition of a complex network, and the quality of objects is evaluated according to network modularity. The reaction rules include evolutionary rules and communication rules. Evolutionary rules are responsible for improving the quality of objects, which employ the differential evolutionary algorithm to evolve objects. Communication rules implement the information exchanged among membranes. Finally, the proposed algorithm is evaluated on synthetic, real-world networks with real partitions known and the large-scaled networks with real partitions unknown. The experimental results indicate the superior performance of the proposed algorithm in comparison with other experimental algorithms.

In silico Evolutionary Developmental Neurobiology and the Origin of Natural Language

NASA Astrophysics Data System (ADS)

Szathmáry, Eörs; Szathmáry, Zoltán; Ittzés, Péter; Orbaán, Geroő; Zachár, István; Huszár, Ferenc; Fedor, Anna; Varga, Máté; Számadó, Szabolcs

It is justified to assume that part of our genetic endowment contributes to our language skills, yet it is impossible to tell at this moment exactly how genes affect the language faculty. We complement experimental biological studies by an in silico approach in that we simulate the evolution of neuronal networks under selection for language-related skills. At the heart of this project is the Evolutionary Neurogenetic Algorithm (ENGA) that is deliberately biomimetic. The design of the system was inspired by important biological phenomena such as brain ontogenesis, neuron morphologies, and indirect genetic encoding. Neuronal networks were selected and were allowed to reproduce as a function of their performance in the given task. The selected neuronal networks in all scenarios were able to solve the communication problem they had to face. The most striking feature of the model is that it works with highly indirect genetic encoding--just as brains do.

Architecture of an Antagonistic Tree/Fungus Network: The Asymmetric Influence of Past Evolutionary History

PubMed Central

Vacher, Corinne; Piou, Dominique; Desprez-Loustau, Marie-Laure

2008-01-01

Background Compartmentalization and nestedness are common patterns in ecological networks. The aim of this study was to elucidate some of the processes shaping these patterns in a well resolved network of host/pathogen interactions. Methology/Principal Findings Based on a long-term (1972–2005) survey of forest health at the regional scale (all French forests; 15 million ha), we uncovered an almost fully connected network of 51 tree taxa and 157 parasitic fungal species. Our analyses revealed that the compartmentalization of the network maps out the ancient evolutionary history of seed plants, but not the ancient evolutionary history of fungal species. The very early divergence of the major fungal phyla may account for this asymmetric influence of past evolutionary history. Unlike compartmentalization, nestedness did not reflect any consistent phylogenetic signal. Instead, it seemed to reflect the ecological features of the current species, such as the relative abundance of tree species and the life-history strategies of fungal pathogens. We discussed how the evolution of host range in fungal species may account for the observed nested patterns. Conclusion/Significance Overall, our analyses emphasized how the current complexity of ecological networks results from the diversification of the species and their interactions over evolutionary times. They confirmed that the current architecture of ecological networks is not only dependant on recent ecological processes. PMID:18320058

Punctuated equilibrium in the large-scale evolution of programming languages†

PubMed Central

Valverde, Sergi; Solé, Ricard V.

2015-01-01

The analogies and differences between biological and cultural evolution have been explored by evolutionary biologists, historians, engineers and linguists alike. Two well-known domains of cultural change are language and technology. Both share some traits relating the evolution of species, but technological change is very difficult to study. A major challenge in our way towards a scientific theory of technological evolution is how to properly define evolutionary trees or clades and how to weight the role played by horizontal transfer of information. Here, we study the large-scale historical development of programming languages, which have deeply marked social and technological advances in the last half century. We analyse their historical connections using network theory and reconstructed phylogenetic networks. Using both data analysis and network modelling, it is shown that their evolution is highly uneven, marked by innovation events where new languages are created out of improved combinations of different structural components belonging to previous languages. These radiation events occur in a bursty pattern and are tied to novel technological and social niches. The method can be extrapolated to other systems and consistently captures the major classes of languages and the widespread horizontal design exchanges, revealing a punctuated evolutionary path. PMID:25994298

Topological enslavement in evolutionary games on correlated multiplex networks

NASA Astrophysics Data System (ADS)

Kleineberg, Kaj-Kolja; Helbing, Dirk

2018-05-01

Governments and enterprises strongly rely on incentives to generate favorable outcomes from social and strategic interactions between individuals. The incentives are usually modeled by payoffs in evolutionary games, such as the prisoners dilemma or the harmony game, with imitation dynamics. Adjusting the incentives by changing the payoff parameters can favor cooperation, as found in the harmony game, over defection, which prevails in the prisoner’s dilemma. Here, we show that this is not always the case if individuals engage in strategic interactions in multiple domains. In particular, we investigate evolutionary games on multiplex networks where individuals obtain an aggregate payoff. We explicitly control the strength of degree correlations between nodes in the different layers of the multiplex. We find that if the multiplex is composed of many layers and degree correlations are strong, the topology of the system enslaves the dynamics and the final outcome, cooperation or defection, becomes independent of the payoff parameters. The fate of the system is then determined by the initial conditions.

Multi Sensor Fusion Using Fitness Adaptive Differential Evolution

NASA Astrophysics Data System (ADS)

Giri, Ritwik; Ghosh, Arnob; Chowdhury, Aritra; Das, Swagatam

The rising popularity of multi-source, multi-sensor networks supports real-life applications calls for an efficient and intelligent approach to information fusion. Traditional optimization techniques often fail to meet the demands. The evolutionary approach provides a valuable alternative due to its inherent parallel nature and its ability to deal with difficult problems. We present a new evolutionary approach based on a modified version of Differential Evolution (DE), called Fitness Adaptive Differential Evolution (FiADE). FiADE treats sensors in the network as distributed intelligent agents with various degrees of autonomy. Existing approaches based on intelligent agents cannot completely answer the question of how their agents could coordinate their decisions in a complex environment. The proposed approach is formulated to produce good result for the problems that are high-dimensional, highly nonlinear, and random. The proposed approach gives better result in case of optimal allocation of sensors. The performance of the proposed approach is compared with an evolutionary algorithm coordination generalized particle model (C-GPM).

Traffic Dimensioning and Performance Modeling of 4G LTE Networks

ERIC Educational Resources Information Center

Ouyang, Ye

2011-01-01

Rapid changes in mobile techniques have always been evolutionary, and the deployment of 4G Long Term Evolution (LTE) networks will be the same. It will be another transition from Third Generation (3G) to Fourth Generation (4G) over a period of several years, as is the case still with the transition from Second Generation (2G) to 3G. As a result,…

Mean-field approximations of fixation time distributions of evolutionary game dynamics on graphs

NASA Astrophysics Data System (ADS)

Ying, Li-Min; Zhou, Jie; Tang, Ming; Guan, Shu-Guang; Zou, Yong

2018-02-01

The mean fixation time is often not accurate for describing the timescales of fixation probabilities of evolutionary games taking place on complex networks. We simulate the game dynamics on top of complex network topologies and approximate the fixation time distributions using a mean-field approach. We assume that there are two absorbing states. Numerically, we show that the mean fixation time is sufficient in characterizing the evolutionary timescales when network structures are close to the well-mixing condition. In contrast, the mean fixation time shows large inaccuracies when networks become sparse. The approximation accuracy is determined by the network structure, and hence by the suitability of the mean-field approach. The numerical results show good agreement with the theoretical predictions.

Stochasticity versus determinism: consequences for realistic gene regulatory network modelling and evolution.

PubMed

Jenkins, Dafyd J; Stekel, Dov J

2010-02-01

Gene regulation is one important mechanism in producing observed phenotypes and heterogeneity. Consequently, the study of gene regulatory network (GRN) architecture, function and evolution now forms a major part of modern biology. However, it is impossible to experimentally observe the evolution of GRNs on the timescales on which living species evolve. In silico evolution provides an approach to studying the long-term evolution of GRNs, but many models have either considered network architecture from non-adaptive evolution, or evolution to non-biological objectives. Here, we address a number of important modelling and biological questions about the evolution of GRNs to the realistic goal of biomass production. Can different commonly used simulation paradigms, in particular deterministic and stochastic Boolean networks, with and without basal gene expression, be used to compare adaptive with non-adaptive evolution of GRNs? Are these paradigms together with this goal sufficient to generate a range of solutions? Will the interaction between a biological goal and evolutionary dynamics produce trade-offs between growth and mutational robustness? We show that stochastic basal gene expression forces shrinkage of genomes due to energetic constraints and is a prerequisite for some solutions. In systems that are able to evolve rates of basal expression, two optima, one with and one without basal expression, are observed. Simulation paradigms without basal expression generate bloated networks with non-functional elements. Further, a range of functional solutions was observed under identical conditions only in stochastic networks. Moreover, there are trade-offs between efficiency and yield, indicating an inherent intertwining of fitness and evolutionary dynamics.

A Multiobjective Sparse Feature Learning Model for Deep Neural Networks.

PubMed

Gong, Maoguo; Liu, Jia; Li, Hao; Cai, Qing; Su, Linzhi

2015-12-01

Hierarchical deep neural networks are currently popular learning models for imitating the hierarchical architecture of human brain. Single-layer feature extractors are the bricks to build deep networks. Sparse feature learning models are popular models that can learn useful representations. But most of those models need a user-defined constant to control the sparsity of representations. In this paper, we propose a multiobjective sparse feature learning model based on the autoencoder. The parameters of the model are learnt by optimizing two objectives, reconstruction error and the sparsity of hidden units simultaneously to find a reasonable compromise between them automatically. We design a multiobjective induced learning procedure for this model based on a multiobjective evolutionary algorithm. In the experiments, we demonstrate that the learning procedure is effective, and the proposed multiobjective model can learn useful sparse features.

Clustering in large networks does not promote upstream reciprocity.

PubMed

Masuda, Naoki

2011-01-01

Upstream reciprocity (also called generalized reciprocity) is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution.

Clustering in Large Networks Does Not Promote Upstream Reciprocity

PubMed Central

Masuda, Naoki

2011-01-01

Upstream reciprocity (also called generalized reciprocity) is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution. PMID:21998641

The evolution of ecosystem ascendency in a complex systems based model.

PubMed

Brinck, Katharina; Jensen, Henrik Jeldtoft

2017-09-07

General patterns in ecosystem development can shed light on driving forces behind ecosystem formation and recovery and have been of long interest. In recent years, the need for integrative and process oriented approaches to capture ecosystem growth, development and organisation, as well as the scope of information theory as a descriptive tool has been addressed from various sides. However data collection of ecological network flows is difficult and tedious and comprehensive models are lacking. We use a hierarchical version of the Tangled Nature Model of evolutionary ecology to study the relationship between structure, flow and organisation in model ecosystems, their development over evolutionary time scales and their relation to ecosystem stability. Our findings support the validity of ecosystem ascendency as a meaningful measure of ecosystem organisation, which increases over evolutionary time scales and significantly drops during periods of disturbance. The results suggest a general trend towards both higher integrity and increased stability driven by functional and structural ecosystem coadaptation. Copyright © 2017 Elsevier Ltd. All rights reserved.

Dynamics, morphogenesis and convergence of evolutionary quantum Prisoner's Dilemma games on networks

PubMed Central

Yong, Xi

2016-01-01

The authors proposed a quantum Prisoner's Dilemma (PD) game as a natural extension of the classic PD game to resolve the dilemma. Here, we establish a new Nash equilibrium principle of the game, propose the notion of convergence and discover the convergence and phase-transition phenomena of the evolutionary games on networks. We investigate the many-body extension of the game or evolutionary games in networks. For homogeneous networks, we show that entanglement guarantees a quick convergence of super cooperation, that there is a phase transition from the convergence of defection to the convergence of super cooperation, and that the threshold for the phase transitions is principally determined by the Nash equilibrium principle of the game, with an accompanying perturbation by the variations of structures of networks. For heterogeneous networks, we show that the equilibrium frequencies of super-cooperators are divergent, that entanglement guarantees emergence of super-cooperation and that there is a phase transition of the emergence with the threshold determined by the Nash equilibrium principle, accompanied by a perturbation by the variations of structures of networks. Our results explore systematically, for the first time, the dynamics, morphogenesis and convergence of evolutionary games in interacting and competing systems. PMID:27118882

Stability Depends on Positive Autoregulation in Boolean Gene Regulatory Networks

PubMed Central

Pinho, Ricardo; Garcia, Victor; Irimia, Manuel; Feldman, Marcus W.

2014-01-01

Network motifs have been identified as building blocks of regulatory networks, including gene regulatory networks (GRNs). The most basic motif, autoregulation, has been associated with bistability (when positive) and with homeostasis and robustness to noise (when negative), but its general importance in network behavior is poorly understood. Moreover, how specific autoregulatory motifs are selected during evolution and how this relates to robustness is largely unknown. Here, we used a class of GRN models, Boolean networks, to investigate the relationship between autoregulation and network stability and robustness under various conditions. We ran evolutionary simulation experiments for different models of selection, including mutation and recombination. Each generation simulated the development of a population of organisms modeled by GRNs. We found that stability and robustness positively correlate with autoregulation; in all investigated scenarios, stable networks had mostly positive autoregulation. Assuming biological networks correspond to stable networks, these results suggest that biological networks should often be dominated by positive autoregulatory loops. This seems to be the case for most studied eukaryotic transcription factor networks, including those in yeast, flies and mammals. PMID:25375153

Interplay between cooperation-enhancing mechanisms in evolutionary games with tag-mediated interactions

NASA Astrophysics Data System (ADS)

Hadzibeganovic, Tarik; Stauffer, Dietrich; Han, Xiao-Pu

2018-04-01

Cooperation is fundamental for the long-term survival of biological, social, and technological networks. Previously, mechanisms for the enhancement of cooperation, such as network reciprocity, have largely been studied in isolation and with often inconclusive findings. Here, we present an evolutionary, multiagent-based, and spatially explicit computer model to specifically address the interactive interplay between such mechanisms. We systematically investigate the effects of phenotypic diversity, network structure, and rewards on cooperative behavior emerging in a population of reproducing artificial decision makers playing tag-mediated evolutionary games. Cooperative interactions are rewarded such that both the benefits of recipients and costs of donators are affected by the reward size. The reward size is determined by the number of cooperative acts occurring within a given reward time frame. Our computational experiments reveal that small reward frames promote unconditional cooperation in populations with both low and high diversity, whereas large reward frames lead to cycles of conditional and unconditional strategies at high but not at low diversity. Moreover, an interaction between rewards and spatial structure shows that relative to small reward frames, there is a strong difference between the frequency of conditional cooperators populating rewired versus non-rewired networks when the reward frame is large. Notably, in a less diverse population, the total number of defections is comparable across different network topologies, whereas in more diverse environments defections become more frequent in a regularly structured than in a rewired, small-world network of contacts. Acknowledging the importance of such interaction effects in social dilemmas will have inevitable consequences for the future design of cooperation-enhancing protocols in large-scale, distributed, and decentralized systems such as peer-to-peer networks.

The autophagy interaction network of the aging model Podospora anserina.

PubMed

Philipp, Oliver; Hamann, Andrea; Osiewacz, Heinz D; Koch, Ina

2017-03-27

Autophagy is a conserved molecular pathway involved in the degradation and recycling of cellular components. It is active either as response to starvation or molecular damage. Evidence is emerging that autophagy plays a key role in the degradation of damaged cellular components and thereby affects aging and lifespan control. In earlier studies, it was found that autophagy in the aging model Podospora anserina acts as a longevity assurance mechanism. However, only little is known about the individual components controlling autophagy in this aging model. Here, we report a biochemical and bioinformatics study to detect the protein-protein interaction (PPI) network of P. anserina combining experimental and theoretical methods. We constructed the PPI network of autophagy in P. anserina based on the corresponding networks of yeast and human. We integrated PaATG8 interaction partners identified in an own yeast two-hybrid analysis using ATG8 of P. anserina as bait. Additionally, we included age-dependent transcriptome data. The resulting network consists of 89 proteins involved in 186 interactions. We applied bioinformatics approaches to analyze the network topology and to prove that the network is not random, but exhibits biologically meaningful properties. We identified hub proteins which play an essential role in the network as well as seven putative sub-pathways, and interactions which are likely to be evolutionary conserved amongst species. We confirmed that autophagy-associated genes are significantly often up-regulated and co-expressed during aging of P. anserina. With the present study, we provide a comprehensive biological network of the autophagy pathway in P. anserina comprising PPI and gene expression data. It is based on computational prediction as well as experimental data. We identified sub-pathways, important hub proteins, and evolutionary conserved interactions. The network clearly illustrates the relation of autophagy to aging processes and enables further specific studies to understand autophagy and aging in P. anserina as well as in other systems.

Evolution of canalizing Boolean networks

NASA Astrophysics Data System (ADS)

Szejka, A.; Drossel, B.

2007-04-01

Boolean networks with canalizing functions are used to model gene regulatory networks. In order to learn how such networks may behave under evolutionary forces, we simulate the evolution of a single Boolean network by means of an adaptive walk, which allows us to explore the fitness landscape. Mutations change the connections and the functions of the nodes. Our fitness criterion is the robustness of the dynamical attractors against small perturbations. We find that with this fitness criterion the global maximum is always reached and that there is a huge neutral space of 100% fitness. Furthermore, in spite of having such a high degree of robustness, the evolved networks still share many features with “chaotic” networks.

Alignment-free protein interaction network comparison

PubMed Central

Ali, Waqar; Rito, Tiago; Reinert, Gesine; Sun, Fengzhu; Deane, Charlotte M.

2014-01-01

Motivation: Biological network comparison software largely relies on the concept of alignment where close matches between the nodes of two or more networks are sought. These node matches are based on sequence similarity and/or interaction patterns. However, because of the incomplete and error-prone datasets currently available, such methods have had limited success. Moreover, the results of network alignment are in general not amenable for distance-based evolutionary analysis of sets of networks. In this article, we describe Netdis, a topology-based distance measure between networks, which offers the possibility of network phylogeny reconstruction. Results: We first demonstrate that Netdis is able to correctly separate different random graph model types independent of network size and density. The biological applicability of the method is then shown by its ability to build the correct phylogenetic tree of species based solely on the topology of current protein interaction networks. Our results provide new evidence that the topology of protein interaction networks contains information about evolutionary processes, despite the lack of conservation of individual interactions. As Netdis is applicable to all networks because of its speed and simplicity, we apply it to a large collection of biological and non-biological networks where it clusters diverse networks by type. Availability and implementation: The source code of the program is freely available at http://www.stats.ox.ac.uk/research/proteins/resources. Contact: w.ali@stats.ox.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25161230

Biological signatures of dynamic river networks from a coupled landscape evolution and neutral community model

NASA Astrophysics Data System (ADS)

Stokes, M.; Perron, J. T.

2017-12-01

Freshwater systems host exceptionally species-rich communities whose spatial structure is dictated by the topology of the river networks they inhabit. Over geologic time, river networks are dynamic; drainage basins shrink and grow, and river capture establishes new connections between previously separated regions. It has been hypothesized that these changes in river network structure influence the evolution of life by exchanging and isolating species, perhaps boosting biodiversity in the process. However, no general model exists to predict the evolutionary consequences of landscape change. We couple a neutral community model of freshwater organisms to a landscape evolution model in which the river network undergoes drainage divide migration and repeated river capture. Neutral community models are macro-ecological models that include stochastic speciation and dispersal to produce realistic patterns of biodiversity. We explore the consequences of three modes of speciation - point mutation, time-protracted, and vicariant (geographic) speciation - by tracking patterns of diversity in time and comparing the final result to an equilibrium solution of the neutral model on the final landscape. Under point mutation, a simple model of stochastic and instantaneous speciation, the results are identical to the equilibrium solution and indicate the dominance of the species-area relationship in forming patterns of diversity. The number of species in a basin is proportional to its area, and regional species richness reaches its maximum when drainage area is evenly distributed among sub-basins. Time-protracted speciation is also modeled as a stochastic process, but in order to produce more realistic rates of diversification, speciation is not assumed to be instantaneous. Rather, each new species must persist for a certain amount of time before it is considered to be established. When vicariance (geographic speciation) is included, there is a transient signature of increased regional diversity after river capture. The results indicate that the mode of speciation and the rate of speciation relative to the rate of divide migration determine the evolutionary signature of river capture.

Investigation of a protein complex network

NASA Astrophysics Data System (ADS)

Mashaghi, A. R.; Ramezanpour, A.; Karimipour, V.

2004-09-01

The budding yeast Saccharomyces cerevisiae is the first eukaryote whose genome has been completely sequenced. It is also the first eukaryotic cell whose proteome (the set of all proteins) and interactome (the network of all mutual interactions between proteins) has been analyzed. In this paper we study the structure of the yeast protein complex network in which weighted edges between complexes represent the number of shared proteins. It is found that the network of protein complexes is a small world network with scale free behavior for many of its distributions. However we find that there are no strong correlations between the weights and degrees of neighboring complexes. To reveal non-random features of the network we also compare it with a null model in which the complexes randomly select their proteins. Finally we propose a simple evolutionary model based on duplication and divergence of proteins.

The drug target genes show higher evolutionary conservation than non-target genes.

PubMed

Lv, Wenhua; Xu, Yongdeng; Guo, Yiying; Yu, Ziqi; Feng, Guanglong; Liu, Panpan; Luan, Meiwei; Zhu, Hongjie; Liu, Guiyou; Zhang, Mingming; Lv, Hongchao; Duan, Lian; Shang, Zhenwei; Li, Jin; Jiang, Yongshuai; Zhang, Ruijie

2016-01-26

Although evidence indicates that drug target genes share some common evolutionary features, there have been few studies analyzing evolutionary features of drug targets from an overall level. Therefore, we conducted an analysis which aimed to investigate the evolutionary characteristics of drug target genes. We compared the evolutionary conservation between human drug target genes and non-target genes by combining both the evolutionary features and network topological properties in human protein-protein interaction network. The evolution rate, conservation score and the percentage of orthologous genes of 21 species were included in our study. Meanwhile, four topological features including the average shortest path length, betweenness centrality, clustering coefficient and degree were considered for comparison analysis. Then we got four results as following: compared with non-drug target genes, 1) drug target genes had lower evolutionary rates; 2) drug target genes had higher conservation scores; 3) drug target genes had higher percentages of orthologous genes and 4) drug target genes had a tighter network structure including higher degrees, betweenness centrality, clustering coefficients and lower average shortest path lengths. These results demonstrate that drug target genes are more evolutionarily conserved than non-drug target genes. We hope that our study will provide valuable information for other researchers who are interested in evolutionary conservation of drug targets.

Complex networks repair strategies: Dynamic models

NASA Astrophysics Data System (ADS)

Fu, Chaoqi; Wang, Ying; Gao, Yangjun; Wang, Xiaoyang

2017-09-01

Network repair strategies are tactical methods that restore the efficiency of damaged networks; however, unreasonable repair strategies not only waste resources, they are also ineffective for network recovery. Most extant research on network repair focuses on static networks, but results and findings on static networks cannot be applied to evolutionary dynamic networks because, in dynamic models, complex network repair has completely different characteristics. For instance, repaired nodes face more severe challenges, and require strategic repair methods in order to have a significant effect. In this study, we propose the Shell Repair Strategy (SRS) to minimize the risk of secondary node failures due to the cascading effect. Our proposed method includes the identification of a set of vital nodes that have a significant impact on network repair and defense. Our identification of these vital nodes reduces the number of switching nodes that face the risk of secondary failures during the dynamic repair process. This is positively correlated with the size of the average degree 〈 k 〉 and enhances network invulnerability.

The Neural Systems of Forgiveness: An Evolutionary Psychological Perspective

PubMed Central

Billingsley, Joseph; Losin, Elizabeth A. R.

2017-01-01

Evolution-minded researchers posit that the suite of human cognitive adaptations may include forgiveness systems. According to these researchers, forgiveness systems regulate interpersonal motivation toward a transgressor in the wake of harm by weighing multiple factors that influence both the potential gains of future interaction with the transgressor and the likelihood of future harm. Although behavioral research generally supports this evolutionary model of forgiveness, the model’s claims have not been examined with available neuroscience specifically in mind, nor has recent neuroscientific research on forgiveness generally considered the evolutionary literature. The current review aims to help bridge this gap by using evolutionary psychology and cognitive neuroscience to mutually inform and interrogate one another. We briefly summarize the evolutionary research on forgiveness, then review recent neuroscientific findings on forgiveness in light of the evolutionary model. We emphasize neuroscientific research that links desire for vengeance to reward-based areas of the brain, that singles out prefrontal areas likely associated with inhibition of vengeful feelings, and that correlates the activity of a theory-of-mind network with assessments of the intentions and blameworthiness of those who commit harm. In addition, we identify gaps in the existing neuroscientific literature, and propose future research directions that might address them, at least in part. PMID:28539904

Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution.

PubMed

Francis, Andrew; Moulton, Vincent

2018-06-07

Phylogenetic networks are an extension of phylogenetic trees which are used to represent evolutionary histories in which reticulation events (such as recombination and hybridization) have occurred. A central question for such networks is that of identifiability, which essentially asks under what circumstances can we reliably identify the phylogenetic network that gave rise to the observed data? Recently, identifiability results have appeared for networks relative to a model of sequence evolution that generalizes the standard Markov models used for phylogenetic trees. However, these results are quite limited in terms of the complexity of the networks that are considered. In this paper, by introducing an alternative probabilistic model for evolution along a network that is based on some ground-breaking work by Thatte for pedigrees, we are able to obtain an identifiability result for a much larger class of phylogenetic networks (essentially the class of so-called tree-child networks). To prove our main theorem, we derive some new results for identifying tree-child networks combinatorially, and then adapt some techniques developed by Thatte for pedigrees to show that our combinatorial results imply identifiability in the probabilistic setting. We hope that the introduction of our new model for networks could lead to new approaches to reliably construct phylogenetic networks. Copyright © 2018 Elsevier Ltd. All rights reserved.

Criticality Is an Emergent Property of Genetic Networks that Exhibit Evolvability

PubMed Central

Torres-Sosa, Christian; Huang, Sui; Aldana, Maximino

2012-01-01

Accumulating experimental evidence suggests that the gene regulatory networks of living organisms operate in the critical phase, namely, at the transition between ordered and chaotic dynamics. Such critical dynamics of the network permits the coexistence of robustness and flexibility which are necessary to ensure homeostatic stability (of a given phenotype) while allowing for switching between multiple phenotypes (network states) as occurs in development and in response to environmental change. However, the mechanisms through which genetic networks evolve such critical behavior have remained elusive. Here we present an evolutionary model in which criticality naturally emerges from the need to balance between the two essential components of evolvability: phenotype conservation and phenotype innovation under mutations. We simulated the Darwinian evolution of random Boolean networks that mutate gene regulatory interactions and grow by gene duplication. The mutating networks were subjected to selection for networks that both (i) preserve all the already acquired phenotypes (dynamical attractor states) and (ii) generate new ones. Our results show that this interplay between extending the phenotypic landscape (innovation) while conserving the existing phenotypes (conservation) suffices to cause the evolution of all the networks in a population towards criticality. Furthermore, the networks produced by this evolutionary process exhibit structures with hubs (global regulators) similar to the observed topology of real gene regulatory networks. Thus, dynamical criticality and certain elementary topological properties of gene regulatory networks can emerge as a byproduct of the evolvability of the phenotypic landscape. PMID:22969419

The evolutionary and ecological consequences of animal social networks: emerging issues.

PubMed

Kurvers, Ralf H J M; Krause, Jens; Croft, Darren P; Wilson, Alexander D M; Wolf, Max

2014-06-01

The first generation of research on animal social networks was primarily aimed at introducing the concept of social networks to the fields of animal behaviour and behavioural ecology. More recently, a diverse body of evidence has shown that social fine structure matters on a broader scale than initially expected, affecting many key ecological and evolutionary processes. Here, we review this development. We discuss the effects of social network structure on evolutionary dynamics (genetic drift, fixation probabilities, and frequency-dependent selection) and social evolution (cooperation and between-individual behavioural differences). We discuss how social network structure can affect important coevolutionary processes (host-pathogen interactions and mutualisms) and population stability. We also discuss the potentially important, but poorly studied, role of social network structure on dispersal and invasion. Throughout, we highlight important areas for future research. Copyright © 2014 Elsevier Ltd. All rights reserved.

Evolving ecological networks and the emergence of biodiversity patterns across temperature gradients.

PubMed

Stegen, James C; Ferriere, Regis; Enquist, Brian J

2012-03-22

In ectothermic organisms, it is hypothesized that metabolic rates mediate influences of temperature on the ecological and evolutionary processes governing biodiversity. However, it is unclear how and to what extent the influence of temperature on metabolism scales up to shape large-scale diversity patterns. In order to clarify the roles of temperature and metabolism, new theory is needed. Here, we establish such theory and model eco-evolutionary dynamics of trophic networks along a broad temperature gradient. In the model temperature can influence, via metabolism, resource supply, consumers' vital rates and mutation rate. Mutation causes heritable variation in consumer body size, which diversifies and governs consumer function in the ecological network. The model predicts diversity to increase with temperature if resource supply is temperature-dependent, whereas temperature-dependent consumer vital rates cause diversity to decrease with increasing temperature. When combining both thermal dependencies, a unimodal temperature-diversity pattern evolves, which is reinforced by temperature-dependent mutation rate. Studying coexistence criteria for two consumers showed that these outcomes are owing to temperature effects on mutual invasibility and facilitation. Our theory shows how and why metabolism can influence diversity, generates predictions useful for understanding biodiversity gradients and represents an extendable framework that could include factors such as colonization history and niche conservatism.

Reverse engineering a gene network using an asynchronous parallel evolution strategy

PubMed Central

2010-01-01

Background The use of reverse engineering methods to infer gene regulatory networks by fitting mathematical models to gene expression data is becoming increasingly popular and successful. However, increasing model complexity means that more powerful global optimisation techniques are required for model fitting. The parallel Lam Simulated Annealing (pLSA) algorithm has been used in such approaches, but recent research has shown that island Evolutionary Strategies can produce faster, more reliable results. However, no parallel island Evolutionary Strategy (piES) has yet been demonstrated to be effective for this task. Results Here, we present synchronous and asynchronous versions of the piES algorithm, and apply them to a real reverse engineering problem: inferring parameters in the gap gene network. We find that the asynchronous piES exhibits very little communication overhead, and shows significant speed-up for up to 50 nodes: the piES running on 50 nodes is nearly 10 times faster than the best serial algorithm. We compare the asynchronous piES to pLSA on the same test problem, measuring the time required to reach particular levels of residual error, and show that it shows much faster convergence than pLSA across all optimisation conditions tested. Conclusions Our results demonstrate that the piES is consistently faster and more reliable than the pLSA algorithm on this problem, and scales better with increasing numbers of nodes. In addition, the piES is especially well suited to further improvements and adaptations: Firstly, the algorithm's fast initial descent speed and high reliability make it a good candidate for being used as part of a global/local search hybrid algorithm. Secondly, it has the potential to be used as part of a hierarchical evolutionary algorithm, which takes advantage of modern multi-core computing architectures. PMID:20196855

Punctuated equilibrium in the large-scale evolution of programming languages.

PubMed

Valverde, Sergi; Solé, Ricard V

2015-06-06

The analogies and differences between biological and cultural evolution have been explored by evolutionary biologists, historians, engineers and linguists alike. Two well-known domains of cultural change are language and technology. Both share some traits relating the evolution of species, but technological change is very difficult to study. A major challenge in our way towards a scientific theory of technological evolution is how to properly define evolutionary trees or clades and how to weight the role played by horizontal transfer of information. Here, we study the large-scale historical development of programming languages, which have deeply marked social and technological advances in the last half century. We analyse their historical connections using network theory and reconstructed phylogenetic networks. Using both data analysis and network modelling, it is shown that their evolution is highly uneven, marked by innovation events where new languages are created out of improved combinations of different structural components belonging to previous languages. These radiation events occur in a bursty pattern and are tied to novel technological and social niches. The method can be extrapolated to other systems and consistently captures the major classes of languages and the widespread horizontal design exchanges, revealing a punctuated evolutionary path. © 2015 The Author(s) Published by the Royal Society. All rights reserved.

An Application Development Platform for Neuromorphic Computing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dean, Mark; Chan, Jason; Daffron, Christopher

2016-01-01

Dynamic Adaptive Neural Network Arrays (DANNAs) are neuromorphic computing systems developed as a hardware based approach to the implementation of neural networks. They feature highly adaptive and programmable structural elements, which model arti cial neural networks with spiking behavior. We design them to solve problems using evolutionary optimization. In this paper, we highlight the current hardware and software implementations of DANNA, including their features, functionalities and performance. We then describe the development of an Application Development Platform (ADP) to support efficient application implementation and testing of DANNA based solutions. We conclude with future directions.

Percolation in insect nest networks: Evidence for optimal wiring

NASA Astrophysics Data System (ADS)

Valverde, Sergi; Corominas-Murtra, Bernat; Perna, Andrea; Kuntz, Pascale; Theraulaz, Guy; Solé, Ricard V.

2009-06-01

Optimization has been shown to be a driving force for the evolution of some biological structures, such as neural maps in the brain or transport networks. Here we show that insect networks also display characteristic traits of optimality. By using a graph representation of the chamber organization of termite nests and a disordered lattice model, it is found that these spatial nests are close to a percolation threshold. This suggests that termites build efficient systems of galleries spanning most of the nest volume at low cost. The evolutionary consequences are outlined.

Energy and time determine scaling in biological and computer designs

PubMed Central

Bezerra, George; Edwards, Benjamin; Brown, James; Forrest, Stephanie

2016-01-01

Metabolic rate in animals and power consumption in computers are analogous quantities that scale similarly with size. We analyse vascular systems of mammals and on-chip networks of microprocessors, where natural selection and human engineering, respectively, have produced systems that minimize both energy dissipation and delivery times. Using a simple network model that simultaneously minimizes energy and time, our analysis explains empirically observed trends in the scaling of metabolic rate in mammals and power consumption and performance in microprocessors across several orders of magnitude in size. Just as the evolutionary transitions from unicellular to multicellular animals in biology are associated with shifts in metabolic scaling, our model suggests that the scaling of power and performance will change as computer designs transition to decentralized multi-core and distributed cyber-physical systems. More generally, a single energy–time minimization principle may govern the design of many complex systems that process energy, materials and information. This article is part of the themed issue ‘The major synthetic evolutionary transitions’. PMID:27431524

Energy and time determine scaling in biological and computer designs.

PubMed

Moses, Melanie; Bezerra, George; Edwards, Benjamin; Brown, James; Forrest, Stephanie

2016-08-19

Metabolic rate in animals and power consumption in computers are analogous quantities that scale similarly with size. We analyse vascular systems of mammals and on-chip networks of microprocessors, where natural selection and human engineering, respectively, have produced systems that minimize both energy dissipation and delivery times. Using a simple network model that simultaneously minimizes energy and time, our analysis explains empirically observed trends in the scaling of metabolic rate in mammals and power consumption and performance in microprocessors across several orders of magnitude in size. Just as the evolutionary transitions from unicellular to multicellular animals in biology are associated with shifts in metabolic scaling, our model suggests that the scaling of power and performance will change as computer designs transition to decentralized multi-core and distributed cyber-physical systems. More generally, a single energy-time minimization principle may govern the design of many complex systems that process energy, materials and information.This article is part of the themed issue 'The major synthetic evolutionary transitions'. © 2016 The Author(s).

Evolutionary Games in Multi-Agent Systems of Weighted Social Networks

NASA Astrophysics Data System (ADS)

Du, Wen-Bo; Cao, Xian-Bin; Zheng, Hao-Ran; Zhou, Hong; Hu, Mao-Bin

Much empirical evidence has shown realistic networks are weighted. Compared with those on unweighted networks, the dynamics on weighted network often exhibit distinctly different phenomena. In this paper, we investigate the evolutionary game dynamics (prisoner's dilemma game and snowdrift game) on a weighted social network consisted of rational agents and focus on the evolution of cooperation in the system. Simulation results show that the cooperation level is strongly affected by the weighted nature of the network. Moreover, the variation of time series has also been investigated. Our work may be helpful in understanding the cooperative behavior in the social systems.

Application of Neural Network Optimized by Mind Evolutionary Computation in Building Energy Prediction

NASA Astrophysics Data System (ADS)

Song, Chen; Zhong-Cheng, Wu; Hong, Lv

2018-03-01

Building Energy forecasting plays an important role in energy management and plan. Using mind evolutionary algorithm to find the optimal network weights and threshold, to optimize the BP neural network, can overcome the problem of the BP neural network into a local minimum point. The optimized network is used for time series prediction, and the same month forecast, to get two predictive values. Then two kinds of predictive values are put into neural network, to get the final forecast value. The effectiveness of the method was verified by experiment with the energy value of three buildings in Hefei.

Hybrid modeling and empirical analysis of automobile supply chain network

NASA Astrophysics Data System (ADS)

Sun, Jun-yan; Tang, Jian-ming; Fu, Wei-ping; Wu, Bing-ying

2017-05-01

Based on the connection mechanism of nodes which automatically select upstream and downstream agents, a simulation model for dynamic evolutionary process of consumer-driven automobile supply chain is established by integrating ABM and discrete modeling in the GIS-based map. Firstly, the rationality is proved by analyzing the consistency of sales and changes in various agent parameters between the simulation model and a real automobile supply chain. Second, through complex network theory, hierarchical structures of the model and relationships of networks at different levels are analyzed to calculate various characteristic parameters such as mean distance, mean clustering coefficients, and degree distributions. By doing so, it verifies that the model is a typical scale-free network and small-world network. Finally, the motion law of this model is analyzed from the perspective of complex self-adaptive systems. The chaotic state of the simulation system is verified, which suggests that this system has typical nonlinear characteristics. This model not only macroscopically illustrates the dynamic evolution of complex networks of automobile supply chain but also microcosmically reflects the business process of each agent. Moreover, the model construction and simulation of the system by means of combining CAS theory and complex networks supplies a novel method for supply chain analysis, as well as theory bases and experience for supply chain analysis of auto companies.

Cascading failures and the emergence of cooperation in evolutionary-game based models of social and economical networks.

PubMed

Wang, Wen-Xu; Lai, Ying-Cheng; Armbruster, Dieter

2011-09-01

We study catastrophic behaviors in large networked systems in the paradigm of evolutionary games by incorporating a realistic "death" or "bankruptcy" mechanism. We find that a cascading bankruptcy process can arise when defection strategies exist and individuals are vulnerable to deficit. Strikingly, we observe that, after the catastrophic cascading process terminates, cooperators are the sole survivors, regardless of the game types and of the connection patterns among individuals as determined by the topology of the underlying network. It is necessary that individuals cooperate with each other to survive the catastrophic failures. Cooperation thus becomes the optimal strategy and absolutely outperforms defection in the game evolution with respect to the "death" mechanism. Our results can be useful for understanding large-scale catastrophe in real-world systems and in particular, they may yield insights into significant social and economical phenomena such as large-scale failures of financial institutions and corporations during an economic recession.

Cascading failures and the emergence of cooperation in evolutionary-game based models of social and economical networks

NASA Astrophysics Data System (ADS)

Wang, Wen-Xu; Lai, Ying-Cheng; Armbruster, Dieter

2011-09-01

We study catastrophic behaviors in large networked systems in the paradigm of evolutionary games by incorporating a realistic "death" or "bankruptcy" mechanism. We find that a cascading bankruptcy process can arise when defection strategies exist and individuals are vulnerable to deficit. Strikingly, we observe that, after the catastrophic cascading process terminates, cooperators are the sole survivors, regardless of the game types and of the connection patterns among individuals as determined by the topology of the underlying network. It is necessary that individuals cooperate with each other to survive the catastrophic failures. Cooperation thus becomes the optimal strategy and absolutely outperforms defection in the game evolution with respect to the "death" mechanism. Our results can be useful for understanding large-scale catastrophe in real-world systems and in particular, they may yield insights into significant social and economical phenomena such as large-scale failures of financial institutions and corporations during an economic recession.

Neural networks with multiple general neuron models: a hybrid computational intelligence approach using Genetic Programming.

PubMed

Barton, Alan J; Valdés, Julio J; Orchard, Robert

2009-01-01

Classical neural networks are composed of neurons whose nature is determined by a certain function (the neuron model), usually pre-specified. In this paper, a type of neural network (NN-GP) is presented in which: (i) each neuron may have its own neuron model in the form of a general function, (ii) any layout (i.e network interconnection) is possible, and (iii) no bias nodes or weights are associated to the connections, neurons or layers. The general functions associated to a neuron are learned by searching a function space. They are not provided a priori, but are rather built as part of an Evolutionary Computation process based on Genetic Programming. The resulting network solutions are evaluated based on a fitness measure, which may, for example, be based on classification or regression errors. Two real-world examples are presented to illustrate the promising behaviour on classification problems via construction of a low-dimensional representation of a high-dimensional parameter space associated to the set of all network solutions.

A Study of Driver's Route Choice Behavior Based on Evolutionary Game Theory

PubMed Central

Jiang, Xiaowei; Ji, Yanjie; Deng, Wei

2014-01-01

This paper proposes a route choice analytic method that embeds cumulative prospect theory in evolutionary game theory to analyze how the drivers adjust their route choice behaviors under the influence of the traffic information. A simulated network with two alternative routes and one variable message sign is built to illustrate the analytic method. We assume that the drivers in the transportation system are bounded rational, and the traffic information they receive is incomplete. An evolutionary game model is constructed to describe the evolutionary process of the drivers' route choice decision-making behaviors. Here we conclude that the traffic information plays an important role in the route choice behavior. The driver's route decision-making process develops towards different evolutionary stable states in accordance with different transportation situations. The analysis results also demonstrate that employing cumulative prospect theory and evolutionary game theory to study the driver's route choice behavior is effective. This analytic method provides an academic support and suggestion for the traffic guidance system, and may optimize the travel efficiency to a certain extent. PMID:25610455

A study of driver's route choice behavior based on evolutionary game theory.

PubMed

Jiang, Xiaowei; Ji, Yanjie; Du, Muqing; Deng, Wei

2014-01-01

This paper proposes a route choice analytic method that embeds cumulative prospect theory in evolutionary game theory to analyze how the drivers adjust their route choice behaviors under the influence of the traffic information. A simulated network with two alternative routes and one variable message sign is built to illustrate the analytic method. We assume that the drivers in the transportation system are bounded rational, and the traffic information they receive is incomplete. An evolutionary game model is constructed to describe the evolutionary process of the drivers' route choice decision-making behaviors. Here we conclude that the traffic information plays an important role in the route choice behavior. The driver's route decision-making process develops towards different evolutionary stable states in accordance with different transportation situations. The analysis results also demonstrate that employing cumulative prospect theory and evolutionary game theory to study the driver's route choice behavior is effective. This analytic method provides an academic support and suggestion for the traffic guidance system, and may optimize the travel efficiency to a certain extent.

Importance of tie strengths in the prisoner's dilemma game on social networks

NASA Astrophysics Data System (ADS)

Xu, Bo; Liu, Lu; You, Weijia

2011-06-01

Though numerous researches have shown that tie strengths play a key role in the formation of collective behavior in social networks, little work has been done to explore their impact on the outcome of evolutionary games. In this Letter, we studied the effect of tie strength in the dynamics of evolutionary prisoner's dilemma games by using online social network datasets. The results show that the fraction of cooperators has a non-trivial dependence on tie strength. Weak ties, just like previous researches on epidemics and information diffusion have shown, play a key role by the maintenance of cooperators in evolutionary prisoner's dilemma games.

Mapping Systemic Risk: Critical Degree and Failures Distribution in Financial Networks.

PubMed

Smerlak, Matteo; Stoll, Brady; Gupta, Agam; Magdanz, James S

2015-01-01

The financial crisis illustrated the need for a functional understanding of systemic risk in strongly interconnected financial structures. Dynamic processes on complex networks being intrinsically difficult to model analytically, most recent studies of this problem have relied on numerical simulations. Here we report analytical results in a network model of interbank lending based on directly relevant financial parameters, such as interest rates and leverage ratios. We obtain a closed-form formula for the "critical degree" (the number of creditors per bank below which an individual shock can propagate throughout the network), and relate failures distributions to network topologies, in particular scalefree ones. Our criterion for the onset of contagion turns out to be isomorphic to the condition for cooperation to evolve on graphs and social networks, as recently formulated in evolutionary game theory. This remarkable connection supports recent calls for a methodological rapprochement between finance and ecology.

Multiple regimes of robust patterns between network structure and biodiversity

NASA Astrophysics Data System (ADS)

Jover, Luis F.; Flores, Cesar O.; Cortez, Michael H.; Weitz, Joshua S.

2015-12-01

Ecological networks such as plant-pollinator and host-parasite networks have structured interactions that define who interacts with whom. The structure of interactions also shapes ecological and evolutionary dynamics. Yet, there is significant ongoing debate as to whether certain structures, e.g., nestedness, contribute positively, negatively or not at all to biodiversity. We contend that examining variation in life history traits is key to disentangling the potential relationship between network structure and biodiversity. Here, we do so by analyzing a dynamic model of virus-bacteria interactions across a spectrum of network structures. Consistent with prior studies, we find plausible parameter domains exhibiting strong, positive relationships between nestedness and biodiversity. Yet, the same model can exhibit negative relationships between nestedness and biodiversity when examined in a distinct, plausible region of parameter space. We discuss steps towards identifying when network structure could, on its own, drive the resilience, sustainability, and even conservation of ecological communities.

Multiple regimes of robust patterns between network structure and biodiversity

PubMed Central

Jover, Luis F.; Flores, Cesar O.; Cortez, Michael H.; Weitz, Joshua S.

2015-01-01

Ecological networks such as plant-pollinator and host-parasite networks have structured interactions that define who interacts with whom. The structure of interactions also shapes ecological and evolutionary dynamics. Yet, there is significant ongoing debate as to whether certain structures, e.g., nestedness, contribute positively, negatively or not at all to biodiversity. We contend that examining variation in life history traits is key to disentangling the potential relationship between network structure and biodiversity. Here, we do so by analyzing a dynamic model of virus-bacteria interactions across a spectrum of network structures. Consistent with prior studies, we find plausible parameter domains exhibiting strong, positive relationships between nestedness and biodiversity. Yet, the same model can exhibit negative relationships between nestedness and biodiversity when examined in a distinct, plausible region of parameter space. We discuss steps towards identifying when network structure could, on its own, drive the resilience, sustainability, and even conservation of ecological communities. PMID:26632996

Mapping Systemic Risk: Critical Degree and Failures Distribution in Financial Networks

PubMed Central

Smerlak, Matteo; Stoll, Brady; Gupta, Agam; Magdanz, James S.

2015-01-01

The financial crisis illustrated the need for a functional understanding of systemic risk in strongly interconnected financial structures. Dynamic processes on complex networks being intrinsically difficult to model analytically, most recent studies of this problem have relied on numerical simulations. Here we report analytical results in a network model of interbank lending based on directly relevant financial parameters, such as interest rates and leverage ratios. We obtain a closed-form formula for the “critical degree” (the number of creditors per bank below which an individual shock can propagate throughout the network), and relate failures distributions to network topologies, in particular scalefree ones. Our criterion for the onset of contagion turns out to be isomorphic to the condition for cooperation to evolve on graphs and social networks, as recently formulated in evolutionary game theory. This remarkable connection supports recent calls for a methodological rapprochement between finance and ecology. PMID:26207631

Equilibria, information and frustration in heterogeneous network games with conflicting preferences

NASA Astrophysics Data System (ADS)

Mazzoli, M.; Sánchez, A.

2017-11-01

Interactions between people are the basis on which the structure of our society arises as a complex system and, at the same time, are the starting point of any physical description of it. In the last few years, much theoretical research has addressed this issue by combining the physics of complex networks with a description of interactions in terms of evolutionary game theory. We here take this research a step further by introducing a most salient societal factor such as the individuals’ preferences, a characteristic that is key to understanding much of the social phenomenology these days. We consider a heterogeneous, agent-based model in which agents interact strategically with their neighbors, but their preferences and payoffs for the possible actions differ. We study how such a heterogeneous network behaves under evolutionary dynamics and different strategic interactions, namely coordination games and best shot games. With this model we study the emergence of the equilibria predicted analytically in random graphs under best response dynamics, and we extend this test to unexplored contexts like proportional imitation and scale free networks. We show that some theoretically predicted equilibria do not arise in simulations with incomplete information, and we demonstrate the importance of the graph topology and the payoff function parameters for some games. Finally, we discuss our results with the available experimental evidence on coordination games, showing that our model agrees better with the experiment than standard economic theories, and draw hints as to how to maximize social efficiency in situations of conflicting preferences.

Tracing the evolutionary origin of vertebrate skeletal tissues: insights from cephalochordate amphioxus.

PubMed

Yong, Luok Wen; Yu, Jr-Kai

2016-08-01

Vertebrate mineralized skeletal tissues are widely considered as an evolutionary novelty. Despite the importance of these tissues to the adaptation and radiation of vertebrate animals, the evolutionary origin of vertebrate skeletal tissues remains largely unclear. Cephalochordates (Amphioxus) occupy a key phylogenetic position and can serve as a valuable model for studying the evolution of vertebrate skeletal tissues. Here we summarize recent advances in amphioxus developmental biology and comparative genomics that can help to elucidate the evolutionary origins of the vertebrate skeletal tissues and their underlying developmental gene regulatory networks (GRN). By making comparisons to the developmental studies in vertebrate models and recent discoveries in paleontology and genomics, it becomes evident that the collagen matrix-based connective tissues secreted by the somite-derived cells in amphioxus likely represent the rudimentary skeletal tissues in chordates. We propose that upon the foundation of this collagenous precursor, novel tissue mineralization genes that arose from gene duplications were incorporated into an ancestral mesodermal GRN that makes connective and supporting tissues, leading to the emergence of highly-mineralized skeletal tissues in early vertebrates. Copyright © 2016 Elsevier Ltd. All rights reserved.

High-Trust Leadership and Blended Learning in the Age of Disruptive Innovation: Strategic Thinking for Colleges and Schools of Education

ERIC Educational Resources Information Center

Holland, Denise D.; Piper, Randy T.

2016-01-01

We introduce diverse definitions of leadership and its evolutionary history and then we integrate this idea network: strategic thinking, high-trust leadership, blended learning, and disruptive innovation. Following the lead of Marx's (2014) model of Teaching Leadership and Strategy and Rehm's (2014) model of High School Student Leadership…

Coevolution of game and network structure with adjustable linking

NASA Astrophysics Data System (ADS)

Qin, Shao-Meng; Zhang, Guo-Yong; Chen, Yong

2009-12-01

Most papers about the evolutionary game on graph assume the statistic network structure. However, in the real world, social interaction could change the relationship among people. And the change of social structure will also affect people’s strategies. We build a coevolution model of prisoner’s dilemma game and network structure to study the dynamic interaction in the real world. Differing from other coevolution models, players rewire their network connections according to the density of cooperation and other players’ payoffs. We use a parameter α to control the effect of payoff in the process of rewiring. Based on the asynchronous update rule and Monte Carlo simulation, we find that, when players prefer to rewire their links to those who are richer, the temptation can increase the cooperation density.

Optimization of Artificial Neural Network using Evolutionary Programming for Prediction of Cascading Collapse Occurrence due to the Hidden Failure Effect

NASA Astrophysics Data System (ADS)

Idris, N. H.; Salim, N. A.; Othman, M. M.; Yasin, Z. M.

2018-03-01

This paper presents the Evolutionary Programming (EP) which proposed to optimize the training parameters for Artificial Neural Network (ANN) in predicting cascading collapse occurrence due to the effect of protection system hidden failure. The data has been collected from the probability of hidden failure model simulation from the historical data. The training parameters of multilayer-feedforward with backpropagation has been optimized with objective function to minimize the Mean Square Error (MSE). The optimal training parameters consists of the momentum rate, learning rate and number of neurons in first hidden layer and second hidden layer is selected in EP-ANN. The IEEE 14 bus system has been tested as a case study to validate the propose technique. The results show the reliable prediction of performance validated through MSE and Correlation Coefficient (R).

EvoluCode: Evolutionary Barcodes as a Unifying Framework for Multilevel Evolutionary Data.

PubMed

Linard, Benjamin; Nguyen, Ngoc Hoan; Prosdocimi, Francisco; Poch, Olivier; Thompson, Julie D

2012-01-01

Evolutionary systems biology aims to uncover the general trends and principles governing the evolution of biological networks. An essential part of this process is the reconstruction and analysis of the evolutionary histories of these complex, dynamic networks. Unfortunately, the methodologies for representing and exploiting such complex evolutionary histories in large scale studies are currently limited. Here, we propose a new formalism, called EvoluCode (Evolutionary barCode), which allows the integration of different evolutionary parameters (eg, sequence conservation, orthology, synteny …) in a unifying format and facilitates the multilevel analysis and visualization of complex evolutionary histories at the genome scale. The advantages of the approach are demonstrated by constructing barcodes representing the evolution of the complete human proteome. Two large-scale studies are then described: (i) the mapping and visualization of the barcodes on the human chromosomes and (ii) automatic clustering of the barcodes to highlight protein subsets sharing similar evolutionary histories and their functional analysis. The methodologies developed here open the way to the efficient application of other data mining and knowledge extraction techniques in evolutionary systems biology studies. A database containing all EvoluCode data is available at: http://lbgi.igbmc.fr/barcodes.

New generation of elastic network models.

PubMed

López-Blanco, José Ramón; Chacón, Pablo

2016-04-01

The intrinsic flexibility of proteins and nucleic acids can be grasped from remarkably simple mechanical models of particles connected by springs. In recent decades, Elastic Network Models (ENMs) combined with Normal Model Analysis widely confirmed their ability to predict biologically relevant motions of biomolecules and soon became a popular methodology to reveal large-scale dynamics in multiple structural biology scenarios. The simplicity, robustness, low computational cost, and relatively high accuracy are the reasons behind the success of ENMs. This review focuses on recent advances in the development and application of ENMs, paying particular attention to combinations with experimental data. Successful application scenarios include large macromolecular machines, structural refinement, docking, and evolutionary conservation. Copyright © 2015 Elsevier Ltd. All rights reserved.

When Reputation Enforces Evolutionary Cooperation in Unreliable MANETs.

PubMed

Tang, Changbing; Li, Ang; Li, Xiang

2015-10-01

In self-organized mobile ad hoc networks (MANETs), network functions rely on cooperation of self-interested nodes, where a challenge is to enforce their mutual cooperation. In this paper, we study cooperative packet forwarding in a one-hop unreliable channel which results from loss of packets and noisy observation of transmissions. We propose an indirect reciprocity framework based on evolutionary game theory, and enforce cooperation of packet forwarding strategies in both structured and unstructured MANETs. Furthermore, we analyze the evolutionary dynamics of cooperative strategies and derive the threshold of benefit-to-cost ratio to guarantee the convergence of cooperation. The numerical simulations verify that the proposed evolutionary game theoretic solution enforces cooperation when the benefit-to-cost ratio of the altruistic exceeds the critical condition. In addition, the network throughput performance of our proposed strategy in structured MANETs is measured, which is in close agreement with that of the full cooperative strategy.

Evolutionary Beamforming Optimization for Radio Frequency Charging in Wireless Rechargeable Sensor Networks.

PubMed

Yao, Ke-Han; Jiang, Jehn-Ruey; Tsai, Chung-Hsien; Wu, Zong-Syun

2017-08-20

This paper investigates how to efficiently charge sensor nodes in a wireless rechargeable sensor network (WRSN) with radio frequency (RF) chargers to make the network sustainable. An RF charger is assumed to be equipped with a uniform circular array (UCA) of 12 antennas with the radius λ , where λ is the RF wavelength. The UCA can steer most RF energy in a target direction to charge a specific WRSN node by the beamforming technology. Two evolutionary algorithms (EAs) using the evolution strategy (ES), namely the Evolutionary Beamforming Optimization (EBO) algorithm and the Evolutionary Beamforming Optimization Reseeding (EBO-R) algorithm, are proposed to nearly optimize the power ratio of the UCA beamforming peak side lobe (PSL) and the main lobe (ML) aimed at the given target direction. The proposed algorithms are simulated for performance evaluation and are compared with a related algorithm, called Particle Swarm Optimization Gravitational Search Algorithm-Explore (PSOGSA-Explore), to show their superiority.

Designing synthetic networks in silico: a generalised evolutionary algorithm approach.

PubMed

Smith, Robert W; van Sluijs, Bob; Fleck, Christian

2017-12-02

Evolution has led to the development of biological networks that are shaped by environmental signals. Elucidating, understanding and then reconstructing important network motifs is one of the principal aims of Systems & Synthetic Biology. Consequently, previous research has focused on finding optimal network structures and reaction rates that respond to pulses or produce stable oscillations. In this work we present a generalised in silico evolutionary algorithm that simultaneously finds network structures and reaction rates (genotypes) that can satisfy multiple defined objectives (phenotypes). The key step to our approach is to translate a schema/binary-based description of biological networks into systems of ordinary differential equations (ODEs). The ODEs can then be solved numerically to provide dynamic information about an evolved networks functionality. Initially we benchmark algorithm performance by finding optimal networks that can recapitulate concentration time-series data and perform parameter optimisation on oscillatory dynamics of the Repressilator. We go on to show the utility of our algorithm by finding new designs for robust synthetic oscillators, and by performing multi-objective optimisation to find a set of oscillators and feed-forward loops that are optimal at balancing different system properties. In sum, our results not only confirm and build on previous observations but we also provide new designs of synthetic oscillators for experimental construction. In this work we have presented and tested an evolutionary algorithm that can design a biological network to produce desired output. Given that previous designs of synthetic networks have been limited to subregions of network- and parameter-space, the use of our evolutionary optimisation algorithm will enable Synthetic Biologists to construct new systems with the potential to display a wider range of complex responses.

Using hybridization networks to retrace the evolution of Indo-European languages.

PubMed

Willems, Matthieu; Lord, Etienne; Laforest, Louise; Labelle, Gilbert; Lapointe, François-Joseph; Di Sciullo, Anna Maria; Makarenkov, Vladimir

2016-09-06

Curious parallels between the processes of species and language evolution have been observed by many researchers. Retracing the evolution of Indo-European (IE) languages remains one of the most intriguing intellectual challenges in historical linguistics. Most of the IE language studies use the traditional phylogenetic tree model to represent the evolution of natural languages, thus not taking into account reticulate evolutionary events, such as language hybridization and word borrowing which can be associated with species hybridization and horizontal gene transfer, respectively. More recently, implicit evolutionary networks, such as split graphs and minimal lateral networks, have been used to account for reticulate evolution in linguistics. Striking parallels existing between the evolution of species and natural languages allowed us to apply three computational biology methods for reconstruction of phylogenetic networks to model the evolution of IE languages. We show how the transfer of methods between the two disciplines can be achieved, making necessary methodological adaptations. Considering basic vocabulary data from the well-known Dyen's lexical database, which contains word forms in 84 IE languages for the meanings of a 200-meaning Swadesh list, we adapt a recently developed computational biology algorithm for building explicit hybridization networks to study the evolution of IE languages and compare our findings to the results provided by the split graph and galled network methods. We conclude that explicit phylogenetic networks can be successfully used to identify donors and recipients of lexical material as well as the degree of influence of each donor language on the corresponding recipient languages. We show that our algorithm is well suited to detect reticulate relationships among languages, and present some historical and linguistic justification for the results obtained. Our findings could be further refined if relevant syntactic, phonological and morphological data could be analyzed along with the available lexical data.

The Evolution of Social and Semantic Networks in Epistemic Communities

ERIC Educational Resources Information Center

Margolin, Drew Berkley

2012-01-01

This study describes and tests a model of scientific inquiry as an evolving, organizational phenomenon. Arguments are derived from organizational ecology and evolutionary theory. The empirical subject of study is an "epistemic community" of scientists publishing on a research topic in physics: the string theoretic concept of…

Hierarchical classification with a competitive evolutionary neural tree.

PubMed

Adams, R G.; Butchart, K; Davey, N

1999-04-01

A new, dynamic, tree structured network, the Competitive Evolutionary Neural Tree (CENT) is introduced. The network is able to provide a hierarchical classification of unlabelled data sets. The main advantage that the CENT offers over other hierarchical competitive networks is its ability to self determine the number, and structure, of the competitive nodes in the network, without the need for externally set parameters. The network produces stable classificatory structures by halting its growth using locally calculated heuristics. The results of network simulations are presented over a range of data sets, including Anderson's IRIS data set. The CENT network demonstrates its ability to produce a representative hierarchical structure to classify a broad range of data sets.

A network approach to analyzing highly recombinant malaria parasite genes.

PubMed

Larremore, Daniel B; Clauset, Aaron; Buckee, Caroline O

2013-01-01

The var genes of the human malaria parasite Plasmodium falciparum present a challenge to population geneticists due to their extreme diversity, which is generated by high rates of recombination. These genes encode a primary antigen protein called PfEMP1, which is expressed on the surface of infected red blood cells and elicits protective immune responses. Var gene sequences are characterized by pronounced mosaicism, precluding the use of traditional phylogenetic tools that require bifurcating tree-like evolutionary relationships. We present a new method that identifies highly variable regions (HVRs), and then maps each HVR to a complex network in which each sequence is a node and two nodes are linked if they share an exact match of significant length. Here, networks of var genes that recombine freely are expected to have a uniformly random structure, but constraints on recombination will produce network communities that we identify using a stochastic block model. We validate this method on synthetic data, showing that it correctly recovers populations of constrained recombination, before applying it to the Duffy Binding Like-α (DBLα) domain of var genes. We find nine HVRs whose network communities map in distinctive ways to known DBLα classifications and clinical phenotypes. We show that the recombinational constraints of some HVRs are correlated, while others are independent. These findings suggest that this micromodular structuring facilitates independent evolutionary trajectories of neighboring mosaic regions, allowing the parasite to retain protein function while generating enormous sequence diversity. Our approach therefore offers a rigorous method for analyzing evolutionary constraints in var genes, and is also flexible enough to be easily applied more generally to any highly recombinant sequences.

A Network Approach to Analyzing Highly Recombinant Malaria Parasite Genes

PubMed Central

Larremore, Daniel B.; Clauset, Aaron; Buckee, Caroline O.

2013-01-01

The var genes of the human malaria parasite Plasmodium falciparum present a challenge to population geneticists due to their extreme diversity, which is generated by high rates of recombination. These genes encode a primary antigen protein called PfEMP1, which is expressed on the surface of infected red blood cells and elicits protective immune responses. Var gene sequences are characterized by pronounced mosaicism, precluding the use of traditional phylogenetic tools that require bifurcating tree-like evolutionary relationships. We present a new method that identifies highly variable regions (HVRs), and then maps each HVR to a complex network in which each sequence is a node and two nodes are linked if they share an exact match of significant length. Here, networks of var genes that recombine freely are expected to have a uniformly random structure, but constraints on recombination will produce network communities that we identify using a stochastic block model. We validate this method on synthetic data, showing that it correctly recovers populations of constrained recombination, before applying it to the Duffy Binding Like-α (DBLα) domain of var genes. We find nine HVRs whose network communities map in distinctive ways to known DBLα classifications and clinical phenotypes. We show that the recombinational constraints of some HVRs are correlated, while others are independent. These findings suggest that this micromodular structuring facilitates independent evolutionary trajectories of neighboring mosaic regions, allowing the parasite to retain protein function while generating enormous sequence diversity. Our approach therefore offers a rigorous method for analyzing evolutionary constraints in var genes, and is also flexible enough to be easily applied more generally to any highly recombinant sequences. PMID:24130474

Underlying Principles of Natural Selection in Network Evolution: Systems Biology Approach

PubMed Central

Chen, Bor-Sen; Wu, Wei-Sheng

2007-01-01

Systems biology is a rapidly expanding field that integrates diverse areas of science such as physics, engineering, computer science, mathematics, and biology toward the goal of elucidating the underlying principles of hierarchical metabolic and regulatory systems in the cell, and ultimately leading to predictive understanding of cellular response to perturbations. Because post-genomics research is taking place throughout the tree of life, comparative approaches offer a way for combining data from many organisms to shed light on the evolution and function of biological networks from the gene to the organismal level. Therefore, systems biology can build on decades of theoretical work in evolutionary biology, and at the same time evolutionary biology can use the systems biology approach to go in new uncharted directions. In this study, we present a review of how the post-genomics era is adopting comparative approaches and dynamic system methods to understand the underlying design principles of network evolution and to shape the nascent field of evolutionary systems biology. Finally, the application of evolutionary systems biology to robust biological network designs is also discussed from the synthetic biology perspective. PMID:19468310

The beta-diversity of species interactions: Untangling the drivers of geographic variation in plant-pollinator diversity and function across scales.

PubMed

Burkle, Laura A; Myers, Jonathan A; Belote, R Travis

2016-01-01

Geographic patterns of biodiversity have long inspired interest in processes that shape the assembly, diversity, and dynamics of communities at different spatial scales. To study mechanisms of community assembly, ecologists often compare spatial variation in community composition (beta-diversity) across environmental and spatial gradients. These same patterns inspired evolutionary biologists to investigate how micro- and macro-evolutionary processes create gradients in biodiversity. Central to these perspectives are species interactions, which contribute to community assembly and geographic variation in evolutionary processes. However, studies of beta-diversity have predominantly focused on single trophic levels, resulting in gaps in our understanding of variation in species-interaction networks (interaction beta-diversity), especially at scales most relevant to evolutionary studies of geographic variation. We outline two challenges and their consequences in scaling-up studies of interaction beta-diversity from local to biogeographic scales using plant-pollinator interactions as a model system in ecology, evolution, and conservation. First, we highlight how variation in regional species pools may contribute to variation in interaction beta-diversity among biogeographic regions with dissimilar evolutionary history. Second, we highlight how pollinator behavior (host-switching) links ecological networks to geographic patterns of plant-pollinator interactions and evolutionary processes. Third, we outline key unanswered questions regarding the role of geographic variation in plant-pollinator interactions for conservation and ecosystem services (pollination) in changing environments. We conclude that the largest advances in the burgeoning field of interaction beta-diversity will come from studies that integrate frameworks in ecology, evolution, and conservation to understand the causes and consequences of interaction beta-diversity across scales. © 2016 Botanical Society of America.

Preferential attachment in evolutionary earthquake networks

NASA Astrophysics Data System (ADS)

Rezaei, Soghra; Moghaddasi, Hanieh; Darooneh, Amir Hossein

2018-04-01

Earthquakes as spatio-temporal complex systems have been recently studied using complex network theory. Seismic networks are dynamical networks due to addition of new seismic events over time leading to establishing new nodes and links to the network. Here we have constructed Iran and Italy seismic networks based on Hybrid Model and testified the preferential attachment hypothesis for the connection of new nodes which states that it is more probable for newly added nodes to join the highly connected nodes comparing to the less connected ones. We showed that the preferential attachment is present in the case of earthquakes network and the attachment rate has a linear relationship with node degree. We have also found the seismic passive points, the most probable points to be influenced by other seismic places, using their preferential attachment values.

Elements of an algorithm for optimizing a parameter-structural neural network

NASA Astrophysics Data System (ADS)

Mrówczyńska, Maria

2016-06-01

The field of processing information provided by measurement results is one of the most important components of geodetic technologies. The dynamic development of this field improves classic algorithms for numerical calculations in the aspect of analytical solutions that are difficult to achieve. Algorithms based on artificial intelligence in the form of artificial neural networks, including the topology of connections between neurons have become an important instrument connected to the problem of processing and modelling processes. This concept results from the integration of neural networks and parameter optimization methods and makes it possible to avoid the necessity to arbitrarily define the structure of a network. This kind of extension of the training process is exemplified by the algorithm called the Group Method of Data Handling (GMDH), which belongs to the class of evolutionary algorithms. The article presents a GMDH type network, used for modelling deformations of the geometrical axis of a steel chimney during its operation.

A model for the multiplex dynamics of two-mode and one-mode networks, with an application to employment preference, friendship, and advice

PubMed Central

Snijders, Tom A.B.; Lomi, Alessandro; Torló, Vanina Jasmine

2012-01-01

We propose a new stochastic actor-oriented model for the co-evolution of two-mode and one-mode networks. The model posits that activities of a set of actors, represented in the two-mode network, co-evolve with exchanges and interactions between the actors, as represented in the one-mode network. The model assumes that the actors, not the activities, have agency. The empirical value of the model is demonstrated by examining how employment preferences co-evolve with friendship and advice relations in a group of seventy-five MBA students. The analysis shows that activity in the two-mode network, as expressed by number of employment preferences, is related to activity in the friendship network, as expressed by outdegrees. Further, advice ties between students lead to agreement with respect to employment preferences. In addition, considering the multiplexity of advice and friendship ties yields a better understanding of the dynamics of the advice relation: tendencies to reciprocation and homophily in advice relations are mediated to an important extent by friendship relations. The discussion pays attention to the implications of this study in the broader context of current efforts to model the co-evolutionary dynamics of social networks and individual behavior. PMID:23690653

Affective Monitoring: A Generic Mechanism for Affect Elicitation

PubMed Central

Phaf, R. Hans; Rotteveel, Mark

2012-01-01

In this paper we sketch a new framework for affect elicitation, which is based on previous evolutionary and connectionist modeling and experimental work from our group. Affective monitoring is considered a local match–mismatch process within a module of the neural network. Negative affect is raised instantly by mismatches, incongruency, disfluency, novelty, incoherence, and dissonance, whereas positive affect follows from matches, congruency, fluency, familiarity, coherence, and resonance, at least when an initial mismatch can be solved quickly. Affective monitoring is considered an evolutionary-early conflict and change detection process operating at the same level as, for instance, attentional selection. It runs in parallel and imparts affective flavor to emotional behavior systems, which involve evolutionary-prepared stimuli and action tendencies related to for instance defensive, exploratory, attachment, or appetitive behavior. Positive affect is represented in the networks by high-frequency oscillations, presumably in the gamma band. Negative affect corresponds to more incoherent lower-frequency oscillations, presumably in the theta band. For affect to become conscious, large-scale synchronization of the oscillations over the network and the construction of emotional experiences are required. These constructions involve perceptions of bodily states and action tendencies, but also appraisals as well as efforts to regulate the emotion. Importantly, affective monitoring accompanies every kind of information processing, but conscious emotions, which result from the later integration of affect in a cognitive context, are much rarer events. PMID:22403557

Cooperation in group-structured populations with two layers of interactions

PubMed Central

Zhang, Yanling; Fu, Feng; Chen, Xiaojie; Xie, Guangming; Wang, Long

2015-01-01

Recently there has been a growing interest in studying multiplex networks where individuals are structured in multiple network layers. Previous agent-based simulations of games on multiplex networks reveal rich dynamics arising from interdependency of interactions along each network layer, yet there is little known about analytical conditions for cooperation to evolve thereof. Here we aim to tackle this issue by calculating the evolutionary dynamics of cooperation in group-structured populations with two layers of interactions. In our model, an individual is engaged in two layers of group interactions simultaneously and uses unrelated strategies across layers. Evolutionary competition of individuals is determined by the total payoffs accrued from two layers of interactions. We also consider migration which allows individuals to move to a new group within each layer. An approach combining the coalescence theory with the theory of random walks is established to overcome the analytical difficulty upon local migration. We obtain the exact results for all “isotropic” migration patterns, particularly for migration tuned with varying ranges. When the two layers use one game, the optimal migration ranges are proved identical across layers and become smaller as the migration probability grows. PMID:26632251

Experimental evolution of protein–protein interaction networks

PubMed Central

Kaçar, Betül; Gaucher, Eric A.

2013-01-01

The modern synthesis of evolutionary theory and genetics has enabled us to discover underlying molecular mechanisms of organismal evolution. We know that in order to maximize an organism's fitness in a particular environment, individual interactions among components of protein and nucleic acid networks need to be optimized by natural selection, or sometimes through random processes, as the organism responds to changes and/or challenges in the environment. Despite the significant role of molecular networks in determining an organism's adaptation to its environment, we still do not know how such inter- and intra-molecular interactions within networks change over time and contribute to an organism's evolvability while maintaining overall network functions. One way to address this challenge is to identify connections between molecular networks and their host organisms, to manipulate these connections, and then attempt to understand how such perturbations influence molecular dynamics of the network and thus influence evolutionary paths and organismal fitness. In the present review, we discuss how integrating evolutionary history with experimental systems that combine tools drawn from molecular evolution, synthetic biology and biochemistry allow us to identify the underlying mechanisms of organismal evolution, particularly from the perspective of protein interaction networks. PMID:23849056

Preferential selection based on strategy persistence and memory promotes cooperation in evolutionary prisoner's dilemma games

NASA Astrophysics Data System (ADS)

Liu, Yuanming; Huang, Changwei; Dai, Qionglin

2018-06-01

Strategy imitation plays a crucial role in evolutionary dynamics when we investigate the spontaneous emergence of cooperation under the framework of evolutionary game theory. Generally, when an individual updates his strategy, he needs to choose a role model whom he will learn from. In previous studies, individuals choose role models randomly from their neighbors. In recent works, researchers have considered that individuals choose role models according to neighbors' attractiveness characterized by the present network topology or historical payoffs. Here, we associate an individual's attractiveness with the strategy persistence, which characterizes how frequently he changes his strategy. We introduce a preferential parameter α to describe the nonlinear correlation between the selection probability and the strategy persistence and the memory length of individuals M into the evolutionary games. We investigate the effects of α and M on cooperation. Our results show that cooperation could be promoted when α > 0 and at the same time M > 1, which corresponds to the situation that individuals are inclined to select their neighbors with relatively higher persistence levels during the evolution. Moreover, we find that the cooperation level could reach the maximum at an optimal memory length when α > 0. Our work sheds light on how to promote cooperation through preferential selection based on strategy persistence and a limited memory length.

Using modified fruit fly optimisation algorithm to perform the function test and case studies

NASA Astrophysics Data System (ADS)

Pan, Wen-Tsao

2013-06-01

Evolutionary computation is a computing mode established by practically simulating natural evolutionary processes based on the concept of Darwinian Theory, and it is a common research method. The main contribution of this paper was to reinforce the function of searching for the optimised solution using the fruit fly optimization algorithm (FOA), in order to avoid the acquisition of local extremum solutions. The evolutionary computation has grown to include the concepts of animal foraging behaviour and group behaviour. This study discussed three common evolutionary computation methods and compared them with the modified fruit fly optimization algorithm (MFOA). It further investigated the ability of the three mathematical functions in computing extreme values, as well as the algorithm execution speed and the forecast ability of the forecasting model built using the optimised general regression neural network (GRNN) parameters. The findings indicated that there was no obvious difference between particle swarm optimization and the MFOA in regards to the ability to compute extreme values; however, they were both better than the artificial fish swarm algorithm and FOA. In addition, the MFOA performed better than the particle swarm optimization in regards to the algorithm execution speed, and the forecast ability of the forecasting model built using the MFOA's GRNN parameters was better than that of the other three forecasting models.

Evolution of SH2 domains and phosphotyrosine signalling networks

PubMed Central

Liu, Bernard A.; Nash, Piers D.

2012-01-01

Src homology 2 (SH2) domains mediate selective protein–protein interactions with tyrosine phosphorylated proteins, and in doing so define specificity of phosphotyrosine (pTyr) signalling networks. SH2 domains and protein-tyrosine phosphatases expand alongside protein-tyrosine kinases (PTKs) to coordinate cellular and organismal complexity in the evolution of the unikont branch of the eukaryotes. Examination of conserved families of PTKs and SH2 domain proteins provides fiduciary marks that trace the evolutionary landscape for the development of complex cellular systems in the proto-metazoan and metazoan lineages. The evolutionary provenance of conserved SH2 and PTK families reveals the mechanisms by which diversity is achieved through adaptations in tissue-specific gene transcription, altered ligand binding, insertions of linear motifs and the gain or loss of domains following gene duplication. We discuss mechanisms by which pTyr-mediated signalling networks evolve through the development of novel and expanded families of SH2 domain proteins and the elaboration of connections between pTyr-signalling proteins. These changes underlie the variety of general and specific signalling networks that give rise to tissue-specific functions and increasingly complex developmental programmes. Examination of SH2 domains from an evolutionary perspective provides insight into the process by which evolutionary expansion and modification of molecular protein interaction domain proteins permits the development of novel protein-interaction networks and accommodates adaptation of signalling networks. PMID:22889907

Nature-Inspired Cognitive Evolution to Play MS. Pac-Man

NASA Astrophysics Data System (ADS)

Tan, Tse Guan; Teo, Jason; Anthony, Patricia

Recent developments in nature-inspired computation have heightened the need for research into the three main areas of scientific, engineering and industrial applications. Some approaches have reported that it is able to solve dynamic problems and very useful for improving the performance of various complex systems. So far however, there has been little discussion about the effectiveness of the application of these models to computer and video games in particular. The focus of this research is to explore the hybridization of nature-inspired computation methods for optimization of neural network-based cognition in video games, in this case the combination of a neural network with an evolutionary algorithm. In essence, a neural network is an attempt to mimic the extremely complex human brain system, which is building an artificial brain that is able to self-learn intelligently. On the other hand, an evolutionary algorithm is to simulate the biological evolutionary processes that evolve potential solutions in order to solve the problems or tasks by applying the genetic operators such as crossover, mutation and selection into the solutions. This paper investigates the abilities of Evolution Strategies (ES) to evolve feed-forward artificial neural network's internal parameters (i.e. weight and bias values) for automatically generating Ms. Pac-man controllers. The main objective of this game is to clear a maze of dots while avoiding the ghosts and to achieve the highest possible score. The experimental results show that an ES-based system can be successfully applied to automatically generate artificial intelligence for a complex, dynamic and highly stochastic video game environment.

Evolutionary dynamics of incubation periods

PubMed Central

Ottino-Loffler, Bertrand; Scott, Jacob G

2017-01-01

The incubation period for typhoid, polio, measles, leukemia and many other diseases follows a right-skewed, approximately lognormal distribution. Although this pattern was discovered more than sixty years ago, it remains an open question to explain its ubiquity. Here, we propose an explanation based on evolutionary dynamics on graphs. For simple models of a mutant or pathogen invading a network-structured population of healthy cells, we show that skewed distributions of incubation periods emerge for a wide range of assumptions about invader fitness, competition dynamics, and network structure. The skewness stems from stochastic mechanisms associated with two classic problems in probability theory: the coupon collector and the random walk. Unlike previous explanations that rely crucially on heterogeneity, our results hold even for homogeneous populations. Thus, we predict that two equally healthy individuals subjected to equal doses of equally pathogenic agents may, by chance alone, show remarkably different time courses of disease. PMID:29266000

Constraints and spandrels of interareal connectomes

PubMed Central

Rubinov, Mikail

2016-01-01

Interareal connectomes are whole-brain wiring diagrams of white-matter pathways. Recent studies have identified modules, hubs, module hierarchies and rich clubs as structural hallmarks of these wiring diagrams. An influential current theory postulates that connectome modules are adequately explained by evolutionary pressures for wiring economy, but that the other hallmarks are not explained by such pressures and are therefore less trivial. Here, we use constraint network models to test these postulates in current gold-standard vertebrate and invertebrate interareal-connectome reconstructions. We show that empirical wiring-cost constraints inadequately explain connectome module organization, and that simultaneous module and hub constraints induce the structural byproducts of hierarchies and rich clubs. These byproducts, known as spandrels in evolutionary biology, include the structural substrate of the default-mode network. Our results imply that currently standard connectome characterizations are based on circular analyses or double dipping, and we emphasize an integrative approach to future connectome analyses for avoiding such pitfalls. PMID:27924867

Constraints and spandrels of interareal connectomes.

PubMed

Rubinov, Mikail

2016-12-07

Interareal connectomes are whole-brain wiring diagrams of white-matter pathways. Recent studies have identified modules, hubs, module hierarchies and rich clubs as structural hallmarks of these wiring diagrams. An influential current theory postulates that connectome modules are adequately explained by evolutionary pressures for wiring economy, but that the other hallmarks are not explained by such pressures and are therefore less trivial. Here, we use constraint network models to test these postulates in current gold-standard vertebrate and invertebrate interareal-connectome reconstructions. We show that empirical wiring-cost constraints inadequately explain connectome module organization, and that simultaneous module and hub constraints induce the structural byproducts of hierarchies and rich clubs. These byproducts, known as spandrels in evolutionary biology, include the structural substrate of the default-mode network. Our results imply that currently standard connectome characterizations are based on circular analyses or double dipping, and we emphasize an integrative approach to future connectome analyses for avoiding such pitfalls.

Evolutionary dynamics of incubation periods.

PubMed

Ottino-Loffler, Bertrand; Scott, Jacob G; Strogatz, Steven H

2017-12-21

The incubation period for typhoid, polio, measles, leukemia and many other diseases follows a right-skewed, approximately lognormal distribution. Although this pattern was discovered more than sixty years ago, it remains an open question to explain its ubiquity. Here, we propose an explanation based on evolutionary dynamics on graphs. For simple models of a mutant or pathogen invading a network-structured population of healthy cells, we show that skewed distributions of incubation periods emerge for a wide range of assumptions about invader fitness, competition dynamics, and network structure. The skewness stems from stochastic mechanisms associated with two classic problems in probability theory: the coupon collector and the random walk. Unlike previous explanations that rely crucially on heterogeneity, our results hold even for homogeneous populations. Thus, we predict that two equally healthy individuals subjected to equal doses of equally pathogenic agents may, by chance alone, show remarkably different time courses of disease.

Parallel Evolutionary Optimization for Neuromorphic Network Training

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schuman, Catherine D; Disney, Adam; Singh, Susheela

One of the key impediments to the success of current neuromorphic computing architectures is the issue of how best to program them. Evolutionary optimization (EO) is one promising programming technique; in particular, its wide applicability makes it especially attractive for neuromorphic architectures, which can have many different characteristics. In this paper, we explore different facets of EO on a spiking neuromorphic computing model called DANNA. We focus on the performance of EO in the design of our DANNA simulator, and on how to structure EO on both multicore and massively parallel computing systems. We evaluate how our parallel methods impactmore » the performance of EO on Titan, the U.S.'s largest open science supercomputer, and BOB, a Beowulf-style cluster of Raspberry Pi's. We also focus on how to improve the EO by evaluating commonality in higher performing neural networks, and present the result of a study that evaluates the EO performed by Titan.« less

Neutrality and Robustness in Evo-Devo: Emergence of Lateral Inhibition

PubMed Central

Munteanu, Andreea; Solé, Ricard V.

2008-01-01

Embryonic development is defined by the hierarchical dynamical process that translates genetic information (genotype) into a spatial gene expression pattern (phenotype) providing the positional information for the correct unfolding of the organism. The nature and evolutionary implications of genotype–phenotype mapping still remain key topics in evolutionary developmental biology (evo-devo). We have explored here issues of neutrality, robustness, and diversity in evo-devo by means of a simple model of gene regulatory networks. The small size of the system allowed an exhaustive analysis of the entire fitness landscape and the extent of its neutrality. This analysis shows that evolution leads to a class of robust genetic networks with an expression pattern characteristic of lateral inhibition. This class is a repertoire of distinct implementations of this key developmental process, the diversity of which provides valuable clues about its underlying causal principles. PMID:19023404

An information entropy model on clinical assessment of patients based on the holographic field of meridian

NASA Astrophysics Data System (ADS)

Wu, Jingjing; Wu, Xinming; Li, Pengfei; Li, Nan; Mao, Xiaomei; Chai, Lihe

2017-04-01

Meridian system is not only the basis of traditional Chinese medicine (TCM) method (e.g. acupuncture, massage), but also the core of TCM's basic theory. This paper has introduced a new informational perspective to understand the reality and the holographic field of meridian. Based on maximum information entropy principle (MIEP), a dynamic equation for the holographic field has been deduced, which reflects the evolutionary characteristics of meridian. By using self-organizing artificial neural network as algorithm, the evolutionary dynamic equation of the holographic field can be resolved to assess properties of meridians and clinically diagnose the health characteristics of patients. Finally, through some cases from clinical patients (e.g. a 30-year-old male patient, an apoplectic patient, an epilepsy patient), we use this model to assess the evolutionary properties of meridians. It is proved that this model not only has significant implications in revealing the essence of meridian in TCM, but also may play a guiding role in clinical assessment of patients based on the holographic field of meridians.

Dynamic Adaptive Neural Network Arrays: A Neuromorphic Architecture

DOE Office of Scientific and Technical Information (OSTI.GOV)

Disney, Adam; Reynolds, John

2015-01-01

Dynamic Adaptive Neural Network Array (DANNA) is a neuromorphic hardware implementation. It differs from most other neuromorphic projects in that it allows for programmability of structure, and it is trained or designed using evolutionary optimization. This paper describes the DANNA structure, how DANNA is trained using evolutionary optimization, and an application of DANNA to a very simple classification task.

Emergence of structured communities through evolutionary dynamics.

PubMed

Shtilerman, Elad; Kessler, David A; Shnerb, Nadav M

2015-10-21

Species-rich communities, in which many competing species coexist in a single trophic level, are quite frequent in nature, but pose a formidable theoretical challenge. In particular, it is known that complex competitive systems become unstable and unfeasible when the number of species is large. Recently, many studies have attributed the stability of natural communities to the structure of the interspecific interaction network, yet the nature of such structures and the underlying mechanisms responsible for them remain open questions. Here we introduce an evolutionary model, based on the generic Lotka-Volterra competitive framework, from which a stable, structured, diverse community emerges spontaneously. The modular structure of the competition matrix reflects the phylogeny of the community, in agreement with the hierarchial taxonomic classification. Closely related species tend to have stronger niche overlap and weaker fitness differences, as opposed to pairs of species from different modules. The competitive-relatedness hypothesis and the idea of emergent neutrality are discussed in the context of this evolutionary model. Copyright © 2015 Elsevier Ltd. All rights reserved.

Inferring explicit weighted consensus networks to represent alternative evolutionary histories

PubMed Central

2013-01-01

Background The advent of molecular biology techniques and constant increase in availability of genetic material have triggered the development of many phylogenetic tree inference methods. However, several reticulate evolution processes, such as horizontal gene transfer and hybridization, have been shown to blur the species evolutionary history by causing discordance among phylogenies inferred from different genes. Methods To tackle this problem, we hereby describe a new method for inferring and representing alternative (reticulate) evolutionary histories of species as an explicit weighted consensus network which can be constructed from a collection of gene trees with or without prior knowledge of the species phylogeny. Results We provide a way of building a weighted phylogenetic network for each of the following reticulation mechanisms: diploid hybridization, intragenic recombination and complete or partial horizontal gene transfer. We successfully tested our method on some synthetic and real datasets to infer the above-mentioned evolutionary events which may have influenced the evolution of many species. Conclusions Our weighted consensus network inference method allows one to infer, visualize and validate statistically major conflicting signals induced by the mechanisms of reticulate evolution. The results provided by the new method can be used to represent the inferred conflicting signals by means of explicit and easy-to-interpret phylogenetic networks. PMID:24359207

The application of the multi-alternative approach in active neural network models

NASA Astrophysics Data System (ADS)

Podvalny, S.; Vasiljev, E.

2017-02-01

The article refers to the construction of intelligent systems based artificial neuron networks are used. We discuss the basic properties of the non-compliance of artificial neuron networks and their biological prototypes. It is shown here that the main reason for these discrepancies is the structural immutability of the neuron network models in the learning process, that is, their passivity. Based on the modern understanding of the biological nervous system as a structured ensemble of nerve cells, it is proposed to abandon the attempts to simulate its work at the level of the elementary neurons functioning processes and proceed to the reproduction of the information structure of data storage and processing on the basis of the general enough evolutionary principles of multialternativity, i.e. the multi-level structural model, diversity and modularity. The implementation method of these principles is offered, using the faceted memory organization in the neuron network with the rearranging active structure. An example of the implementation of the active facet-type neuron network in the intellectual decision-making system in the conditions of critical events development in the electrical distribution system.

Evolutionary analyses of non-genealogical bonds produced by introgressive descent.

PubMed

Bapteste, Eric; Lopez, Philippe; Bouchard, Frédéric; Baquero, Fernando; McInerney, James O; Burian, Richard M

2012-11-06

All evolutionary biologists are familiar with evolutionary units that evolve by vertical descent in a tree-like fashion in single lineages. However, many other kinds of processes contribute to evolutionary diversity. In vertical descent, the genetic material of a particular evolutionary unit is propagated by replication inside its own lineage. In what we call introgressive descent, the genetic material of a particular evolutionary unit propagates into different host structures and is replicated within these host structures. Thus, introgressive descent generates a variety of evolutionary units and leaves recognizable patterns in resemblance networks. We characterize six kinds of evolutionary units, of which five involve mosaic lineages generated by introgressive descent. To facilitate detection of these units in resemblance networks, we introduce terminology based on two notions, P3s (subgraphs of three nodes: A, B, and C) and mosaic P3s, and suggest an apparatus for systematic detection of introgressive descent. Mosaic P3s correspond to a distinct type of evolutionary bond that is orthogonal to the bonds of kinship and genealogy usually examined by evolutionary biologists. We argue that recognition of these evolutionary bonds stimulates radical rethinking of key questions in evolutionary biology (e.g., the relations among evolutionary players in very early phases of evolutionary history, the origin and emergence of novelties, and the production of new lineages). This line of research will expand the study of biological complexity beyond the usual genealogical bonds, revealing additional sources of biodiversity. It provides an important step to a more realistic pluralist treatment of evolutionary complexity.

Iris double recognition based on modified evolutionary neural network

NASA Astrophysics Data System (ADS)

Liu, Shuai; Liu, Yuan-Ning; Zhu, Xiao-Dong; Huo, Guang; Liu, Wen-Tao; Feng, Jia-Kai

2017-11-01

Aiming at multicategory iris recognition under illumination and noise interference, this paper proposes a method of iris double recognition based on a modified evolutionary neural network. An equalization histogram and Laplace of Gaussian operator are used to process the iris to suppress illumination and noise interference and Haar wavelet to convert the iris feature to binary feature encoding. Calculate the Hamming distance for the test iris and template iris , and compare with classification threshold, determine the type of iris. If the iris cannot be identified as a different type, there needs to be a secondary recognition. The connection weights in back-propagation (BP) neural network use modified evolutionary neural network to adaptively train. The modified neural network is composed of particle swarm optimization with mutation operator and BP neural network. According to different iris libraries in different circumstances of experimental results, under illumination and noise interference, the correct recognition rate of this algorithm is higher, the ROC curve is closer to the coordinate axis, the training and recognition time is shorter, and the stability and the robustness are better.

Neighbourhood reaction in the evolution of cooperation.

PubMed

Yang, Guoli; Zhang, Weiming; Xiu, Baoxin

2015-05-07

Combining evolutionary games with adaptive networks, an entangled model between strategy evolution and structure adaptation is researched in this paper. We consider a large population of cooperators C and defectors D placed in the networks, playing the repeated prisoner׳s dilemma (PD) games. Because of the conflicts between social welfare and personal rationality, both strategy and structure are allowed to change. In this paper, the dynamics of strategy originates form the partner imitation based on social learning and the dynamics of structure is driven by the active linking and neighbourhood reaction. Notably, the neighbourhood reaction is investigated considering the changes of interfaces between cooperators and defectors, where some neighbours may get away from the interface once the focal agent changes to different strategy. A rich landscape is demonstrated by changing various embedding parameters, which sheds light upon that reacting promptly to the shifted neighbour will promote the prevalence of cooperation. Our model encapsulates the dynamics of strategy, reaction and structure into the evolutionary games, which manifests some intriguing principles in the competition between two groups in natural populations, artificial systems and even human societies. Copyright © 2015 Elsevier Ltd. All rights reserved.

Object-oriented Bayesian networks for paternity cases with allelic dependencies

PubMed Central

Hepler, Amanda B.; Weir, Bruce S.

2008-01-01

This study extends the current use of Bayesian networks by incorporating the effects of allelic dependencies in paternity calculations. The use of object-oriented networks greatly simplify the process of building and interpreting forensic identification models, allowing researchers to solve new, more complex problems. We explore two paternity examples: the most common scenario where DNA evidence is available from the alleged father, the mother and the child; a more complex casewhere DNA is not available from the alleged father, but is available from the alleged father’s brother. Object-oriented networks are built, using HUGIN, for each example which incorporate the effects of allelic dependence caused by evolutionary relatedness. PMID:19079769

Coevolving agent strategies and network topology for the public goods games

NASA Astrophysics Data System (ADS)

Zhang, C. Y.; Zhang, J. L.; Xie, G. M.; Wang, L.

2011-03-01

Much of human cooperation remains an evolutionary riddle. Coevolutionary public goods games in structured populations are studied where players can change from an unproductive public goods game to a productive one, by evaluating the productivity of the public goods games. In our model, each individual participates in games organized by its neighborhood plus by itself. Coevolution here refers to an evolutionary process entailing both deletion of existing links and addition of new links between agents that accompanies the evolution of their strategies. Furthermore, we investigate the effects of time scale separation of strategy and structure on cooperation level. This study presents the following: Foremost, we observe that high cooperation levels in public goods interactions are attained by the entangled coevolution of strategy and structure. Presented results also confirm that the resulting networks show many features of real systems, such as cooperative behavior and hierarchical clustering. The heterogeneity of the interaction network is held responsible for the observed promotion of cooperation. We hope our work may offer an explanation for the origin of large-scale cooperative behavior among unrelated individuals.

MOCASSIN-prot: a multi-objective clustering approach for protein similarity networks.

PubMed

Keel, Brittney N; Deng, Bo; Moriyama, Etsuko N

2018-04-15

Proteins often include multiple conserved domains. Various evolutionary events including duplication and loss of domains, domain shuffling, as well as sequence divergence contribute to generating complexities in protein structures, and consequently, in their functions. The evolutionary history of proteins is hence best modeled through networks that incorporate information both from the sequence divergence and the domain content. Here, a game-theoretic approach proposed for protein network construction is adapted into the framework of multi-objective optimization, and extended to incorporate clustering refinement procedure. The new method, MOCASSIN-prot, was applied to cluster multi-domain proteins from ten genomes. The performance of MOCASSIN-prot was compared against two protein clustering methods, Markov clustering (TRIBE-MCL) and spectral clustering (SCPS). We showed that compared to these two methods, MOCASSIN-prot, which uses both domain composition and quantitative sequence similarity information, generates fewer false positives. It achieves more functionally coherent protein clusters and better differentiates protein families. MOCASSIN-prot, implemented in Perl and Matlab, is freely available at http://bioinfolab.unl.edu/emlab/MOCASSINprot. emoriyama2@unl.edu. Supplementary data are available at Bioinformatics online.

Neutral Community Dynamics and the Evolution of Species Interactions.

PubMed

Coelho, Marco Túlio P; Rangel, Thiago F

2018-04-01

A contemporary goal in ecology is to determine the ecological and evolutionary processes that generate recurring structural patterns in mutualistic networks. One of the great challenges is testing the capacity of neutral processes to replicate observed patterns in ecological networks, since the original formulation of the neutral theory lacks trophic interactions. Here, we develop a stochastic-simulation neutral model adding trophic interactions to the neutral theory of biodiversity. Without invoking ecological differences among individuals of different species, and assuming that ecological interactions emerge randomly, we demonstrate that a spatially explicit multitrophic neutral model is able to capture the recurrent structural patterns of mutualistic networks (i.e., degree distribution, connectance, nestedness, and phylogenetic signal of species interactions). Nonrandom species distribution, caused by probabilistic events of migration and speciation, create nonrandom network patterns. These findings have broad implications for the interpretation of niche-based processes as drivers of ecological networks, as well as for the integration of network structures with demographic stochasticity.

Statistical mechanics of scale-free gene expression networks

NASA Astrophysics Data System (ADS)

Gross, Eitan

2012-12-01

The gene co-expression networks of many organisms including bacteria, mice and man exhibit scale-free distribution. This heterogeneous distribution of connections decreases the vulnerability of the network to random attacks and thus may confer the genetic replication machinery an intrinsic resilience to such attacks, triggered by changing environmental conditions that the organism may be subject to during evolution. This resilience to random attacks comes at an energetic cost, however, reflected by the lower entropy of the scale-free distribution compared to the more homogenous, random network. In this study we found that the cell cycle-regulated gene expression pattern of the yeast Saccharomyces cerevisiae obeys a power-law distribution with an exponent α = 2.1 and an entropy of 1.58. The latter is very close to the maximal value of 1.65 obtained from linear optimization of the entropy function under the constraint of a constant cost function, determined by the average degree connectivity . We further show that the yeast's gene expression network can achieve scale-free distribution in a process that does not involve growth but rather via re-wiring of the connections between nodes of an ordered network. Our results support the idea of an evolutionary selection, which acts at the level of the protein sequence, and is compatible with the notion of greater biological importance of highly connected nodes in the protein interaction network. Our constrained re-wiring model provides a theoretical framework for a putative thermodynamically driven evolutionary selection process.

An Evolutionary Optimization Framework for Neural Networks and Neuromorphic Architectures

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schuman, Catherine D; Plank, James; Disney, Adam

2016-01-01

As new neural network and neuromorphic architectures are being developed, new training methods that operate within the constraints of the new architectures are required. Evolutionary optimization (EO) is a convenient training method for new architectures. In this work, we review a spiking neural network architecture and a neuromorphic architecture, and we describe an EO training framework for these architectures. We present the results of this training framework on four classification data sets and compare those results to other neural network and neuromorphic implementations. We also discuss how this EO framework may be extended to other architectures.

Networks, Trees, and Treeshrews: Assessing Support and Identifying Conflict with Multiple Loci and a Problematic Root

PubMed Central

Roberts, Trina E.; Sargis, Eric J.; Olson, Link E.

2009-01-01

Multiple unlinked genetic loci often provide a more comprehensive picture of evolutionary history than any single gene can, but analyzing multigene data presents particular challenges. Differing rates and patterns of nucleotide substitution, combined with the limited information available in any data set, can make it difficult to specify a model of evolution. In addition, conflict among loci can be the result of real differences in evolutionary process or of stochastic variance and errors in reconstruction. We used 6 presumably unlinked nuclear loci to investigate relationships within the mammalian family Tupaiidae (Scandentia), containing all but one of the extant tupaiid genera. We used a phylogenetic mixture model to analyze the concatenated data and compared this with results using partitioned models. We found that more complex models were not necessarily preferred under tests using Bayes factors and that model complexity affected both tree length and parameter variance. We also compared the results of single-gene and multigene analyses and used splits networks to analyze the source and degree of conflict among genes. Networks can show specific relationships that are inconsistent with each other; these conflicting and minority relationships, which are implicitly ignored or collapsed by traditional consensus methods, can be useful in identifying the underlying causes of topological uncertainty. In our data, conflict is concentrated around particular relationships, not widespread throughout the tree. This pattern is further clarified by considering conflict surrounding the root separately from conflict within the ingroup. Uncertainty in rooting may be because of the apparent evolutionary distance separating these genera and our outgroup, the tupaiid genus Dendrogale. Unlike a previous mitochondrial study, these nuclear data strongly suggest that the genus Tupaia is not monophyletic with respect to the monotypic Urogale, even when uncertainty about rooting is taken into account. These data concur with mitochondrial DNA on other relationships, including the close affinity of Tupaia tana with the enigmatic Tupaia splendidula and of Tupaia belangeri with Tupaia glis. We also discuss the taxonomic and biogeographic implications of these results. PMID:20525582

Evolutionary Beamforming Optimization for Radio Frequency Charging in Wireless Rechargeable Sensor Networks

PubMed Central

Yao, Ke-Han; Jiang, Jehn-Ruey; Tsai, Chung-Hsien; Wu, Zong-Syun

2017-01-01

This paper investigates how to efficiently charge sensor nodes in a wireless rechargeable sensor network (WRSN) with radio frequency (RF) chargers to make the network sustainable. An RF charger is assumed to be equipped with a uniform circular array (UCA) of 12 antennas with the radius λ, where λ is the RF wavelength. The UCA can steer most RF energy in a target direction to charge a specific WRSN node by the beamforming technology. Two evolutionary algorithms (EAs) using the evolution strategy (ES), namely the Evolutionary Beamforming Optimization (EBO) algorithm and the Evolutionary Beamforming Optimization Reseeding (EBO-R) algorithm, are proposed to nearly optimize the power ratio of the UCA beamforming peak side lobe (PSL) and the main lobe (ML) aimed at the given target direction. The proposed algorithms are simulated for performance evaluation and are compared with a related algorithm, called Particle Swarm Optimization Gravitational Search Algorithm-Explore (PSOGSA-Explore), to show their superiority. PMID:28825648

Neuro-evolutionary computing paradigm for Painlevé equation-II in nonlinear optics

NASA Astrophysics Data System (ADS)

Ahmad, Iftikhar; Ahmad, Sufyan; Awais, Muhammad; Ul Islam Ahmad, Siraj; Asif Zahoor Raja, Muhammad

2018-05-01

The aim of this study is to investigate the numerical treatment of the Painlevé equation-II arising in physical models of nonlinear optics through artificial intelligence procedures by incorporating a single layer structure of neural networks optimized with genetic algorithms, sequential quadratic programming and active set techniques. We constructed a mathematical model for the nonlinear Painlevé equation-II with the help of networks by defining an error-based cost function in mean square sense. The performance of the proposed technique is validated through statistical analyses by means of the one-way ANOVA test conducted on a dataset generated by a large number of independent runs.

Unperturbed Schelling Segregation in Two or Three Dimensions

NASA Astrophysics Data System (ADS)

Barmpalias, George; Elwes, Richard; Lewis-Pye, Andrew

2016-09-01

Schelling's models of segregation, first described in 1969 (Am Econ Rev 59:488-493, 1969) are among the best known models of self-organising behaviour. Their original purpose was to identify mechanisms of urban racial segregation. But his models form part of a family which arises in statistical mechanics, neural networks, social science, and beyond, where populations of agents interact on networks. Despite extensive study, unperturbed Schelling models have largely resisted rigorous analysis, prior results generally focusing on variants in which noise is introduced into the dynamics, the resulting system being amenable to standard techniques from statistical mechanics or stochastic evolutionary game theory (Young in Individual strategy and social structure: an evolutionary theory of institutions, Princeton University Press, Princeton, 1998). A series of recent papers (Brandt et al. in: Proceedings of the 44th annual ACM symposium on theory of computing (STOC 2012), 2012); Barmpalias et al. in: 55th annual IEEE symposium on foundations of computer science, Philadelphia, 2014, J Stat Phys 158:806-852, 2015), has seen the first rigorous analyses of 1-dimensional unperturbed Schelling models, in an asymptotic framework largely unknown in statistical mechanics. Here we provide the first such analysis of 2- and 3-dimensional unperturbed models, establishing most of the phase diagram, and answering a challenge from Brandt et al. in: Proceedings of the 44th annual ACM symposium on theory of computing (STOC 2012), 2012).

Modelling formulations using gene expression programming--a comparative analysis with artificial neural networks.

PubMed

Colbourn, E A; Roskilly, S J; Rowe, R C; York, P

2011-10-09

This study has investigated the utility and potential advantages of gene expression programming (GEP)--a new development in evolutionary computing for modelling data and automatically generating equations that describe the cause-and-effect relationships in a system--to four types of pharmaceutical formulation and compared the models with those generated by neural networks, a technique now widely used in the formulation development. Both methods were capable of discovering subtle and non-linear relationships within the data, with no requirement from the user to specify the functional forms that should be used. Although the neural networks rapidly developed models with higher values for the ANOVA R(2) these were black box and provided little insight into the key relationships. However, GEP, although significantly slower at developing models, generated relatively simple equations describing the relationships that could be interpreted directly. The results indicate that GEP can be considered an effective and efficient modelling technique for formulation data. Copyright © 2011 Elsevier B.V. All rights reserved.

Evolutionary Origins of Cancer Driver Genes and Implications for Cancer Prognosis

PubMed Central

Chu, Xin-Yi; Zhou, Xiong-Hui; Cui, Ze-Jia; Zhang, Hong-Yu

2017-01-01

The cancer atavistic theory suggests that carcinogenesis is a reverse evolution process. It is thus of great interest to explore the evolutionary origins of cancer driver genes and the relevant mechanisms underlying the carcinogenesis. Moreover, the evolutionary features of cancer driver genes could be helpful in selecting cancer biomarkers from high-throughput data. In this study, through analyzing the cancer endogenous molecular networks, we revealed that the subnetwork originating from eukaryota could control the unlimited proliferation of cancer cells, and the subnetwork originating from eumetazoa could recapitulate the other hallmarks of cancer. In addition, investigations based on multiple datasets revealed that cancer driver genes were enriched in genes originating from eukaryota, opisthokonta, and eumetazoa. These results have important implications for enhancing the robustness of cancer prognosis models through selecting the gene signatures by the gene age information. PMID:28708071

Evolutionary Origins of Cancer Driver Genes and Implications for Cancer Prognosis.

PubMed

Chu, Xin-Yi; Jiang, Ling-Han; Zhou, Xiong-Hui; Cui, Ze-Jia; Zhang, Hong-Yu

2017-07-14

The cancer atavistic theory suggests that carcinogenesis is a reverse evolution process. It is thus of great interest to explore the evolutionary origins of cancer driver genes and the relevant mechanisms underlying the carcinogenesis. Moreover, the evolutionary features of cancer driver genes could be helpful in selecting cancer biomarkers from high-throughput data. In this study, through analyzing the cancer endogenous molecular networks, we revealed that the subnetwork originating from eukaryota could control the unlimited proliferation of cancer cells, and the subnetwork originating from eumetazoa could recapitulate the other hallmarks of cancer. In addition, investigations based on multiple datasets revealed that cancer driver genes were enriched in genes originating from eukaryota, opisthokonta, and eumetazoa. These results have important implications for enhancing the robustness of cancer prognosis models through selecting the gene signatures by the gene age information.

Topological properties of robust biological and computational networks

PubMed Central

Navlakha, Saket; He, Xin; Faloutsos, Christos; Bar-Joseph, Ziv

2014-01-01

Network robustness is an important principle in biology and engineering. Previous studies of global networks have identified both redundancy and sparseness as topological properties used by robust networks. By focusing on molecular subnetworks, or modules, we show that module topology is tightly linked to the level of environmental variability (noise) the module expects to encounter. Modules internal to the cell that are less exposed to environmental noise are more connected and less robust than external modules. A similar design principle is used by several other biological networks. We propose a simple change to the evolutionary gene duplication model which gives rise to the rich range of module topologies observed within real networks. We apply these observations to evaluate and design communication networks that are specifically optimized for noisy or malicious environments. Combined, joint analysis of biological and computational networks leads to novel algorithms and insights benefiting both fields. PMID:24789562

Systems level analysis of the Chlamydomonas reinhardtii metabolic network reveals variability in evolutionary co-conservation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chaiboonchoe, Amphun; Ghamsari, Lila; Dohai, Bushra

Metabolic networks, which are mathematical representations of organismal metabolism, are reconstructed to provide computational platforms to guide metabolic engineering experiments and explore fundamental questions on metabolism. Systems level analyses, such as interrogation of phylogenetic relationships within the network, can provide further guidance on the modification of metabolic circuitries. Chlamydomonas reinhardtii, a biofuel relevant green alga that has retained key genes with plant, animal, and protist affinities, serves as an ideal model organism to investigate the interplay between gene function and phylogenetic affinities at multiple organizational levels. Here, using detailed topological and functional analyses, coupled with transcriptomics studies on a metabolicmore » network that we have reconstructed for C. reinhardtii, we show that network connectivity has a significant concordance with the co-conservation of genes; however, a distinction between topological and functional relationships is observable within the network. Dynamic and static modes of co-conservation were defined and observed in a subset of gene-pairs across the network topologically. In contrast, genes with predicted synthetic interactions, or genes involved in coupled reactions, show significant enrichment for both shorter and longer phylogenetic distances. Based on our results, we propose that the metabolic network of C. reinhardtii is assembled with an architecture to minimize phylogenetic profile distances topologically, while it includes an expansion of such distances for functionally interacting genes. This arrangement may increase the robustness of C. reinhardtii's network in dealing with varied environmental challenges that the species may face. As a result, the defined evolutionary constraints within the network, which identify important pairings of genes in metabolism, may offer guidance on synthetic biology approaches to optimize the production of desirable metabolites.« less

Systems level analysis of the Chlamydomonas reinhardtii metabolic network reveals variability in evolutionary co-conservation.

PubMed

Chaiboonchoe, Amphun; Ghamsari, Lila; Dohai, Bushra; Ng, Patrick; Khraiwesh, Basel; Jaiswal, Ashish; Jijakli, Kenan; Koussa, Joseph; Nelson, David R; Cai, Hong; Yang, Xinping; Chang, Roger L; Papin, Jason; Yu, Haiyuan; Balaji, Santhanam; Salehi-Ashtiani, Kourosh

2016-07-19

Metabolic networks, which are mathematical representations of organismal metabolism, are reconstructed to provide computational platforms to guide metabolic engineering experiments and explore fundamental questions on metabolism. Systems level analyses, such as interrogation of phylogenetic relationships within the network, can provide further guidance on the modification of metabolic circuitries. Chlamydomonas reinhardtii, a biofuel relevant green alga that has retained key genes with plant, animal, and protist affinities, serves as an ideal model organism to investigate the interplay between gene function and phylogenetic affinities at multiple organizational levels. Here, using detailed topological and functional analyses, coupled with transcriptomics studies on a metabolic network that we have reconstructed for C. reinhardtii, we show that network connectivity has a significant concordance with the co-conservation of genes; however, a distinction between topological and functional relationships is observable within the network. Dynamic and static modes of co-conservation were defined and observed in a subset of gene-pairs across the network topologically. In contrast, genes with predicted synthetic interactions, or genes involved in coupled reactions, show significant enrichment for both shorter and longer phylogenetic distances. Based on our results, we propose that the metabolic network of C. reinhardtii is assembled with an architecture to minimize phylogenetic profile distances topologically, while it includes an expansion of such distances for functionally interacting genes. This arrangement may increase the robustness of C. reinhardtii's network in dealing with varied environmental challenges that the species may face. The defined evolutionary constraints within the network, which identify important pairings of genes in metabolism, may offer guidance on synthetic biology approaches to optimize the production of desirable metabolites.

Systems level analysis of the Chlamydomonas reinhardtii metabolic network reveals variability in evolutionary co-conservation

DOE PAGES

Chaiboonchoe, Amphun; Ghamsari, Lila; Dohai, Bushra; ...

2016-06-14

Metabolic networks, which are mathematical representations of organismal metabolism, are reconstructed to provide computational platforms to guide metabolic engineering experiments and explore fundamental questions on metabolism. Systems level analyses, such as interrogation of phylogenetic relationships within the network, can provide further guidance on the modification of metabolic circuitries. Chlamydomonas reinhardtii, a biofuel relevant green alga that has retained key genes with plant, animal, and protist affinities, serves as an ideal model organism to investigate the interplay between gene function and phylogenetic affinities at multiple organizational levels. Here, using detailed topological and functional analyses, coupled with transcriptomics studies on a metabolicmore » network that we have reconstructed for C. reinhardtii, we show that network connectivity has a significant concordance with the co-conservation of genes; however, a distinction between topological and functional relationships is observable within the network. Dynamic and static modes of co-conservation were defined and observed in a subset of gene-pairs across the network topologically. In contrast, genes with predicted synthetic interactions, or genes involved in coupled reactions, show significant enrichment for both shorter and longer phylogenetic distances. Based on our results, we propose that the metabolic network of C. reinhardtii is assembled with an architecture to minimize phylogenetic profile distances topologically, while it includes an expansion of such distances for functionally interacting genes. This arrangement may increase the robustness of C. reinhardtii's network in dealing with varied environmental challenges that the species may face. As a result, the defined evolutionary constraints within the network, which identify important pairings of genes in metabolism, may offer guidance on synthetic biology approaches to optimize the production of desirable metabolites.« less

Nonbinary Tree-Based Phylogenetic Networks.

PubMed

Jetten, Laura; van Iersel, Leo

2018-01-01

Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can, for example, represent gene transfer events. Such phylogenetic networks are called tree-based. Here, we consider two possible generalizations of this concept to nonbinary networks, which we call tree-based and strictly-tree-based nonbinary phylogenetic networks. We give simple graph-theoretic characterizations of tree-based and strictly-tree-based nonbinary phylogenetic networks. Moreover, we show for each of these two classes that it can be decided in polynomial time whether a given network is contained in the class. Our approach also provides a new view on tree-based binary phylogenetic networks. Finally, we discuss two examples of nonbinary phylogenetic networks in biology and show how our results can be applied to them.

Predicting the evolution of complex networks via similarity dynamics

NASA Astrophysics Data System (ADS)

Wu, Tao; Chen, Leiting; Zhong, Linfeng; Xian, Xingping

2017-01-01

Almost all real-world networks are subject to constant evolution, and plenty of them have been investigated empirically to uncover the underlying evolution mechanism. However, the evolution prediction of dynamic networks still remains a challenging problem. The crux of this matter is to estimate the future network links of dynamic networks. This paper studies the evolution prediction of dynamic networks with link prediction paradigm. To estimate the likelihood of the existence of links more accurate, an effective and robust similarity index is presented by exploiting network structure adaptively. Moreover, most of the existing link prediction methods do not make a clear distinction between future links and missing links. In order to predict the future links, the networks are regarded as dynamic systems in this paper, and a similarity updating method, spatial-temporal position drift model, is developed to simulate the evolutionary dynamics of node similarity. Then the updated similarities are used as input information for the future links' likelihood estimation. Extensive experiments on real-world networks suggest that the proposed similarity index performs better than baseline methods and the position drift model performs well for evolution prediction in real-world evolving networks.

Evolving bipartite authentication graph partitions

DOE PAGES

Pope, Aaron Scott; Tauritz, Daniel Remy; Kent, Alexander D.

2017-01-16

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of largemore » connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.« less

Coexistence and specialization of pathogen strains on contact networks.

PubMed

Eames, Ken T D; Keeling, Matt J

2006-08-01

The coexistence of different pathogen strains has implications for pathogen variability and disease control and has been explained in a number of different ways. We use contact networks, which represent interactions between individuals through which infection could be transmitted, to investigate strain coexistence. For sexually transmitted diseases the structure of contact networks has received detailed study and has been shown to be a vital determinant of the epidemiological dynamics. By using analytical pairwise models and stochastic simulations, we demonstrate that network structure also has a profound influence on the interaction between pathogen strains. In particular, when the population is serially monogamous, fully cross-reactive strains can coexist, with different strains dominating in network regions with different characteristics. Furthermore, we observe specialization of different strains in different risk groups within the network, suggesting the existence of diverging evolutionary pressures.

Evolving bipartite authentication graph partitions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pope, Aaron Scott; Tauritz, Daniel Remy; Kent, Alexander D.

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of largemore » connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.« less

Evolutionary prisoner's dilemma games coevolving on adaptive networks.

PubMed

Lee, Hsuan-Wei; Malik, Nishant; Mucha, Peter J

2018-02-01

We study a model for switching strategies in the Prisoner's Dilemma game on adaptive networks of player pairings that coevolve as players attempt to maximize their return. We use a node-based strategy model wherein each player follows one strategy at a time (cooperate or defect) across all of its neighbors, changing that strategy and possibly changing partners in response to local changes in the network of player pairing and in the strategies used by connected partners. We compare and contrast numerical simulations with existing pair approximation differential equations for describing this system, as well as more accurate equations developed here using the framework of approximate master equations. We explore the parameter space of the model, demonstrating the relatively high accuracy of the approximate master equations for describing the system observations made from simulations. We study two variations of this partner-switching model to investigate the system evolution, predict stationary states, and compare the total utilities and other qualitative differences between these two model variants.

A Unifying Mathematical Framework for Genetic Robustness, Environmental Robustness, Network Robustness and their Trade-off on Phenotype Robustness in Biological Networks Part I: Gene Regulatory Networks in Systems and Evolutionary Biology

PubMed Central

Chen, Bor-Sen; Lin, Ying-Po

2013-01-01

Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties observed in biological systems at different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be enough to confer intrinsic robustness in order to tolerate intrinsic parameter fluctuations, genetic robustness for buffering genetic variations, and environmental robustness for resisting environmental disturbances. With this, the phenotypic stability of biological network can be maintained, thus guaranteeing phenotype robustness. This paper presents a survey on biological systems and then develops a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation in systems and evolutionary biology. Further, from the unifying mathematical framework, it was discovered that the phenotype robustness criterion for biological networks at different levels relies upon intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness. When this is true, the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in systems and evolutionary biology can also be investigated through their corresponding phenotype robustness criterion from the systematic point of view. PMID:23515240

A Unifying Mathematical Framework for Genetic Robustness, Environmental Robustness, Network Robustness and their Trade-off on Phenotype Robustness in Biological Networks Part I: Gene Regulatory Networks in Systems and Evolutionary Biology.

PubMed

Chen, Bor-Sen; Lin, Ying-Po

2013-01-01

Robust stabilization and environmental disturbance attenuation are ubiquitous systematic properties observed in biological systems at different levels. The underlying principles for robust stabilization and environmental disturbance attenuation are universal to both complex biological systems and sophisticated engineering systems. In many biological networks, network robustness should be enough to confer intrinsic robustness in order to tolerate intrinsic parameter fluctuations, genetic robustness for buffering genetic variations, and environmental robustness for resisting environmental disturbances. With this, the phenotypic stability of biological network can be maintained, thus guaranteeing phenotype robustness. This paper presents a survey on biological systems and then develops a unifying mathematical framework for investigating the principles of both robust stabilization and environmental disturbance attenuation in systems and evolutionary biology. Further, from the unifying mathematical framework, it was discovered that the phenotype robustness criterion for biological networks at different levels relies upon intrinsic robustness + genetic robustness + environmental robustness ≦ network robustness. When this is true, the phenotype robustness can be maintained in spite of intrinsic parameter fluctuations, genetic variations, and environmental disturbances. Therefore, the trade-offs between intrinsic robustness, genetic robustness, environmental robustness, and network robustness in systems and evolutionary biology can also be investigated through their corresponding phenotype robustness criterion from the systematic point of view.

A Game-Theoretic Response Strategy for Coordinator Attack in Wireless Sensor Networks

PubMed Central

Liu, Jianhua; Yue, Guangxue; Shang, Huiliang; Li, Hongjie

2014-01-01

The coordinator is a specific node that controls the whole network and has a significant impact on the performance in cooperative multihop ZigBee wireless sensor networks (ZWSNs). However, the malicious node attacks coordinator nodes in an effort to waste the resources and disrupt the operation of the network. Attacking leads to a failure of one round of communication between the source nodes and destination nodes. Coordinator selection is a technique that can considerably defend against attack and reduce the data delivery delay, and increase network performance of cooperative communications. In this paper, we propose an adaptive coordinator selection algorithm using game and fuzzy logic aiming at both minimizing the average number of hops and maximizing network lifetime. The proposed game model consists of two interrelated formulations: a stochastic game for dynamic defense and a best response policy using evolutionary game formulation for coordinator selection. The stable equilibrium best policy to response defense is obtained from this game model. It is shown that the proposed scheme can improve reliability and save energy during the network lifetime with respect to security. PMID:25105171

A game-theoretic response strategy for coordinator attack in wireless sensor networks.

PubMed

Liu, Jianhua; Yue, Guangxue; Shen, Shigen; Shang, Huiliang; Li, Hongjie

2014-01-01

The coordinator is a specific node that controls the whole network and has a significant impact on the performance in cooperative multihop ZigBee wireless sensor networks (ZWSNs). However, the malicious node attacks coordinator nodes in an effort to waste the resources and disrupt the operation of the network. Attacking leads to a failure of one round of communication between the source nodes and destination nodes. Coordinator selection is a technique that can considerably defend against attack and reduce the data delivery delay, and increase network performance of cooperative communications. In this paper, we propose an adaptive coordinator selection algorithm using game and fuzzy logic aiming at both minimizing the average number of hops and maximizing network lifetime. The proposed game model consists of two interrelated formulations: a stochastic game for dynamic defense and a best response policy using evolutionary game formulation for coordinator selection. The stable equilibrium best policy to response defense is obtained from this game model. It is shown that the proposed scheme can improve reliability and save energy during the network lifetime with respect to security.

Female mating preferences determine system-level evolution in a gene network model.

PubMed

Fierst, Janna L

2013-06-01

Environmental patterns of directional, stabilizing and fluctuating selection can influence the evolution of system-level properties like evolvability and mutational robustness. Intersexual selection produces strong phenotypic selection and these dynamics may also affect the response to mutation and the potential for future adaptation. In order to to assess the influence of mating preferences on these evolutionary properties, I modeled a male trait and female preference determined by separate gene regulatory networks. I studied three sexual selection scenarios: sexual conflict, a Gaussian model of the Fisher process described in Lande (in Proc Natl Acad Sci 78(6):3721-3725, 1981) and a good genes model in which the male trait signalled his mutational condition. I measured the effects these mating preferences had on the potential for traits and preferences to evolve towards new states, and mutational robustness of both the phenotype and the individual's overall viability. All types of sexual selection increased male phenotypic robustness relative to a randomly mating population. The Fisher model also reduced male evolvability and mutational robustness for viability. Under good genes sexual selection, males evolved an increased mutational robustness for viability. Females choosing their mates is a scenario that is sufficient to create selective forces that impact genetic evolution and shape the evolutionary response to mutation and environmental selection. These dynamics will inevitably develop in any population where sexual selection is operating, and affect the potential for future adaptation.

Functional vs. Structural Modularity: do they imply each other?

NASA Astrophysics Data System (ADS)

Toroczkai, Zoltan

2009-03-01

While many deterministic and stochastic processes have been proposed to produce heterogeneous graphs mimicking real-world networks, only a handful of studies attempt to connect structure and dynamics with the function(s) performed by the network. In this talk I will present an approach built on the premise that structure, dynamics, and their observed heterogeneity, are implementations of various functions and their compositions. After a brief review of real-world networks where this connection can explicitly be made, I will focus on biological networks. Biological networks are known to possess functionally specialized modules, which perform tasks almost independently of each other. While proposals have been made for the evolutionary emergence of modularity, it is far from clear that adaptation on evolutionary timescales is the sole mechanism leading to functional specialization. We show that non-evolutionary learning can also lead to the formation of functionally specialized modules in a system exposed to multiple environmental constraints. A natural example suggesting that this is possible is the cerebral cortex, where there are clearly delineated functional areas in spite of the largely uniform anatomical construction of the cortical tissue. However, as numerous experiments show, when damaged, regions specialized for a certain function can be retrained to perform functions normally attributed to other regions. We use the paradigm of neural networks to represent a multitasking system, and use several non-evolutionary learning algorithms as mechanisms for phenotypic adaptation. We show that for a network learning to perform multiple tasks, the degree of independence between the tasks dictates the degree of functional specialization emerging in the network. To uncover the functional modules, we introduce a method of node knockouts that explicitly rates the contribution of each node to different tasks (differential robustness). Through a concrete example we also demonstrate the potential inability of purely topology-based clustering methods to detect functional modules. The robustness of these results suggests that similar mechanisms might be responsible for the emergence of functional specialization in other multitasking networks, as well, including social networks.

Upon Accounting for the Impact of Isoenzyme Loss, Gene Deletion Costs Anticorrelate with Their Evolutionary Rates.

PubMed

Jacobs, Christopher; Lambourne, Luke; Xia, Yu; Segrè, Daniel

2017-01-01

System-level metabolic network models enable the computation of growth and metabolic phenotypes from an organism's genome. In particular, flux balance approaches have been used to estimate the contribution of individual metabolic genes to organismal fitness, offering the opportunity to test whether such contributions carry information about the evolutionary pressure on the corresponding genes. Previous failure to identify the expected negative correlation between such computed gene-loss cost and sequence-derived evolutionary rates in Saccharomyces cerevisiae has been ascribed to a real biological gap between a gene's fitness contribution to an organism "here and now" and the same gene's historical importance as evidenced by its accumulated mutations over millions of years of evolution. Here we show that this negative correlation does exist, and can be exposed by revisiting a broadly employed assumption of flux balance models. In particular, we introduce a new metric that we call "function-loss cost", which estimates the cost of a gene loss event as the total potential functional impairment caused by that loss. This new metric displays significant negative correlation with evolutionary rate, across several thousand minimal environments. We demonstrate that the improvement gained using function-loss cost over gene-loss cost is explained by replacing the base assumption that isoenzymes provide unlimited capacity for backup with the assumption that isoenzymes are completely non-redundant. We further show that this change of the assumption regarding isoenzymes increases the recall of epistatic interactions predicted by the flux balance model at the cost of a reduction in the precision of the predictions. In addition to suggesting that the gene-to-reaction mapping in genome-scale flux balance models should be used with caution, our analysis provides new evidence that evolutionary gene importance captures much more than strict essentiality.

Studying the evolutionary relationships and phylogenetic trees of 21 groups of tRNA sequences based on complex networks.

PubMed

Wei, Fangping; Chen, Bowen

2012-03-01

To find out the evolutionary relationships among different tRNA sequences of 21 amino acids, 22 networks are constructed. One is constructed from whole tRNAs, and the other 21 networks are constructed from the tRNAs which carry the same amino acids. A new method is proposed such that the alignment scores of any two amino acids groups are determined by the average degree and the average clustering coefficient of their networks. The anticodon feature of isolated tRNA and the phylogenetic trees of 21 group networks are discussed. We find that some isolated tRNA sequences in 21 networks still connect with other tRNAs outside their group, which reflects the fact that those tRNAs might evolve by intercrossing among these 21 groups. We also find that most anticodons among the same cluster are only one base different in the same sites when S ≥ 70, and they stay in the same rank in the ladder of evolutionary relationships. Those observations seem to agree on that some tRNAs might mutate from the same ancestor sequences based on point mutation mechanisms.

Deconstructing the relationships between phylogenetic diversity and ecology: a case study on ecosystem functioning.

PubMed

Davies, T Jonathan; Urban, Mark C; Rayfield, Bronwyn; Cadotte, Marc W; Peres-Neto, Pedro R

2016-09-01

Recent studies have supported a link between phylogenetic diversity and various ecological properties including ecosystem function. However, such studies typically assume that phylogenetic branches of equivalent length are more or less interchangeable. Here we suggest that there is a need to consider not only branch lengths but also their placement on the phylogeny. We demonstrate how two common indices of network centrality can be used to describe the evolutionary distinctiveness of network elements (nodes and branches) on a phylogeny. If phylogenetic diversity enhances ecosystem function via complementarity and the representation of functional diversity, we would predict a correlation between evolutionary distinctiveness of network elements and their contribution to ecosystem process. In contrast, if one or a few evolutionary innovations play key roles in ecosystem function, the relationship between evolutionary distinctiveness and functional contribution may be weak or absent. We illustrate how network elements associated with high functional contribution can be identified from regressions between phylogenetic diversity and productivity using a well-known empirical data set on plant productivity from the Cedar Creek Long-Term Ecological Research. We find no association between evolutionary distinctiveness and ecosystem functioning, but we are able to identify phylogenetic elements associated with species of known high functional contribution within the Fabaceae. Our perspective provides a useful guide in the search for ecological traits linking diversity and ecosystem function, and suggests a more nuanced consideration of phylogenetic diversity is required in the conservation and biodiversity-ecosystem-function literature. © 2016 by the Ecological Society of America.

Petri net modeling of high-order genetic systems using grammatical evolution.

PubMed

Moore, Jason H; Hahn, Lance W

2003-11-01

Understanding how DNA sequence variations impact human health through a hierarchy of biochemical and physiological systems is expected to improve the diagnosis, prevention, and treatment of common, complex human diseases. We have previously developed a hierarchical dynamic systems approach based on Petri nets for generating biochemical network models that are consistent with genetic models of disease susceptibility. This modeling approach uses an evolutionary computation approach called grammatical evolution as a search strategy for optimal Petri net models. We have previously demonstrated that this approach routinely identifies biochemical network models that are consistent with a variety of genetic models in which disease susceptibility is determined by nonlinear interactions between two DNA sequence variations. In the present study, we evaluate whether the Petri net approach is capable of identifying biochemical networks that are consistent with disease susceptibility due to higher order nonlinear interactions between three DNA sequence variations. The results indicate that our model-building approach is capable of routinely identifying good, but not perfect, Petri net models. Ideas for improving the algorithm for this high-dimensional problem are presented.

Human behavior in Prisoner's Dilemma experiments suppresses network reciprocity

NASA Astrophysics Data System (ADS)

Gracia-Lázaro, Carlos; Cuesta, José A.; Sánchez, Angel; Moreno, Yamir

2012-03-01

During the last few years, much research has been devoted to strategic interactions on complex networks. In this context, the Prisoner's Dilemma has become a paradigmatic model, and it has been established that imitative evolutionary dynamics lead to very different outcomes depending on the details of the network. We here report that when one takes into account the real behavior of people observed in the experiments, both at the mean-field level and on utterly different networks, the observed level of cooperation is the same. We thus show that when human subjects interact in a heterogeneous mix including cooperators, defectors and moody conditional cooperators, the structure of the population does not promote or inhibit cooperation with respect to a well mixed population.

Breaking symmetry: the zebrafish as a model for understanding left-right asymmetry in the developing brain.

PubMed

Roussigne, Myriam; Blader, Patrick; Wilson, Stephen W

2012-03-01

How does left-right asymmetry develop in the brain and how does the resultant asymmetric circuitry impact on brain function and lateralized behaviors? By enabling scientists to address these questions at the levels of genes, neurons, circuitry and behavior,the zebrafish model system provides a route to resolve the complexity of brain lateralization. In this review, we present the progress made towards characterizing the nature of the gene networks and the sequence of morphogenetic events involved in the asymmetric development of zebrafish epithalamus. In an attempt to integrate the recent extensive knowledge into a working model and to identify the future challenges,we discuss how insights gained at a cellular/developmental level can be linked to the data obtained at a molecular/genetic level. Finally, we present some evolutionary thoughts and discuss how significant discoveries made in zebrafish should provide entry points to better understand the evolutionary origins of brain lateralization.

BioJazz: in silico evolution of cellular networks with unbounded complexity using rule-based modeling.

PubMed

Feng, Song; Ollivier, Julien F; Swain, Peter S; Soyer, Orkun S

2015-10-30

Systems biologists aim to decipher the structure and dynamics of signaling and regulatory networks underpinning cellular responses; synthetic biologists can use this insight to alter existing networks or engineer de novo ones. Both tasks will benefit from an understanding of which structural and dynamic features of networks can emerge from evolutionary processes, through which intermediary steps these arise, and whether they embody general design principles. As natural evolution at the level of network dynamics is difficult to study, in silico evolution of network models can provide important insights. However, current tools used for in silico evolution of network dynamics are limited to ad hoc computer simulations and models. Here we introduce BioJazz, an extendable, user-friendly tool for simulating the evolution of dynamic biochemical networks. Unlike previous tools for in silico evolution, BioJazz allows for the evolution of cellular networks with unbounded complexity by combining rule-based modeling with an encoding of networks that is akin to a genome. We show that BioJazz can be used to implement biologically realistic selective pressures and allows exploration of the space of network architectures and dynamics that implement prescribed physiological functions. BioJazz is provided as an open-source tool to facilitate its further development and use. Source code and user manuals are available at: http://oss-lab.github.io/biojazz and http://osslab.lifesci.warwick.ac.uk/BioJazz.aspx. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.

Evolving learning rules and emergence of cooperation in spatial prisoner's dilemma.

PubMed

Moyano, Luis G; Sánchez, Angel

2009-07-07

In the evolutionary Prisoner's dilemma (PD) game, agents play with each other and update their strategies in every generation according to some microscopic dynamical rule. In its spatial version, agents do not play with every other but, instead, interact only with their neighbours, thus mimicking the existing of a social or contact network that defines who interacts with whom. In this work, we explore evolutionary, spatial PD systems consisting of two types of agents, each with a certain update (reproduction, learning) rule. We investigate two different scenarios: in the first case, update rules remain fixed for the entire evolution of the system; in the second case, agents update both strategy and update rule in every generation. We show that in a well-mixed population the evolutionary outcome is always full defection. We subsequently focus on two-strategy competition with nearest-neighbour interactions on the contact network and synchronised update of strategies. Our results show that, for an important range of the parameters of the game, the final state of the system is largely different from that arising from the usual setup of a single, fixed dynamical rule. Furthermore, the results are also very different if update rules are fixed or evolve with the strategies. In these respect, we have studied representative update rules, finding that some of them may become extinct while others prevail. We describe the new and rich variety of final outcomes that arise from this co-evolutionary dynamics. We include examples of other neighbourhoods and asynchronous updating that confirm the robustness of our conclusions. Our results pave the way to an evolutionary rationale for modelling social interactions through game theory with a preferred set of update rules.

Connecting the dots between genes, biochemistry, and disease susceptibility: systems biology modeling in human genetics.

PubMed

Moore, Jason H; Boczko, Erik M; Summar, Marshall L

2005-02-01

Understanding how DNA sequence variations impact human health through a hierarchy of biochemical and physiological systems is expected to improve the diagnosis, prevention, and treatment of common, complex human diseases. We have previously developed a hierarchical dynamic systems approach based on Petri nets for generating biochemical network models that are consistent with genetic models of disease susceptibility. This modeling approach uses an evolutionary computation approach called grammatical evolution as a search strategy for optimal Petri net models. We have previously demonstrated that this approach routinely identifies biochemical network models that are consistent with a variety of genetic models in which disease susceptibility is determined by nonlinear interactions between two or more DNA sequence variations. We review here this approach and then discuss how it can be used to model biochemical and metabolic data in the context of genetic studies of human disease susceptibility.

Hybrid intelligent methodology to design translation invariant morphological operators for Brazilian stock market prediction.

PubMed

Araújo, Ricardo de A

2010-12-01

This paper presents a hybrid intelligent methodology to design increasing translation invariant morphological operators applied to Brazilian stock market prediction (overcoming the random walk dilemma). The proposed Translation Invariant Morphological Robust Automatic phase-Adjustment (TIMRAA) method consists of a hybrid intelligent model composed of a Modular Morphological Neural Network (MMNN) with a Quantum-Inspired Evolutionary Algorithm (QIEA), which searches for the best time lags to reconstruct the phase space of the time series generator phenomenon and determines the initial (sub-optimal) parameters of the MMNN. Each individual of the QIEA population is further trained by the Back Propagation (BP) algorithm to improve the MMNN parameters supplied by the QIEA. Also, for each prediction model generated, it uses a behavioral statistical test and a phase fix procedure to adjust time phase distortions observed in stock market time series. Furthermore, an experimental analysis is conducted with the proposed method through four Brazilian stock market time series, and the achieved results are discussed and compared to results found with random walk models and the previously introduced Time-delay Added Evolutionary Forecasting (TAEF) and Morphological-Rank-Linear Time-lag Added Evolutionary Forecasting (MRLTAEF) methods. Copyright © 2010 Elsevier Ltd. All rights reserved.

Network Analysis of Plasmidomes: The Azospirillum brasilense Sp245 Case

PubMed Central

Fondi, Marco

2014-01-01

Azospirillum brasilense is a nitrogen-fixing bacterium living in association with plant roots. The genome of the strain Sp245, isolated in Brazil from wheat roots, consists of one chromosome and six plasmids. In this work, the A. brasilense Sp245 plasmids were analyzed in order to shed some light on the evolutionary pathways they followed over time. To this purpose, a similarity network approach was applied in order to identify the evolutionary relationships among all the A. brasilense plasmids encoded proteins; in this context a computational pipeline specifically devoted to the analysis and the visualization of the network-like evolutionary relationships among different plasmids molecules was developed. This information was supplemented with a detailed (in silico) functional characterization of both the connected (i.e., sharing homology with other sequences in the dataset) and the unconnected (i.e., not sharing homology) components of the network. Furthermore, the most likely source organism for each of the genes encoded by A. brasilense plasmids was checked, allowing the identification of possible trends of gene loss/gain in this microorganism. Data obtained provided a detailed description of the evolutionary landscape of the plasmids of A. brasilense Sp245, suggesting some of the molecular mechanisms responsible for the present-day structure of these molecules. PMID:25610702

Phylogeny and evolutionary histories of Pyrus L. revealed by phylogenetic trees and networks based on data from multiple DNA sequences.

PubMed

Zheng, Xiaoyan; Cai, Danying; Potter, Daniel; Postman, Joseph; Liu, Jing; Teng, Yuanwen

2014-11-01

Reconstructing the phylogeny of Pyrus has been difficult due to the wide distribution of the genus and lack of informative data. In this study, we collected 110 accessions representing 25 Pyrus species and constructed both phylogenetic trees and phylogenetic networks based on multiple DNA sequence datasets. Phylogenetic trees based on both cpDNA and nuclear LFY2int2-N (LN) data resulted in poor resolution, especially, only five primary species were monophyletic in the LN tree. A phylogenetic network of LN suggested that reticulation caused by hybridization is one of the major evolutionary processes for Pyrus species. Polytomies of the gene trees and star-like structure of cpDNA networks suggested rapid radiation is another major evolutionary process, especially for the occidental species. Pyrus calleryana and P. regelii were the earliest diverged Pyrus species. Two North African species, P. cordata, P. spinosa and P. betulaefolia were descendent of primitive stock Pyrus species and still share some common molecular characters. Southwestern China, where a large number of P. pashia populations are found, is probably the most important diversification center of Pyrus. More accessions and nuclear genes are needed for further understanding the evolutionary histories of Pyrus. Copyright © 2014 Elsevier Inc. All rights reserved.

Generation of oscillating gene regulatory network motifs

NASA Astrophysics Data System (ADS)

van Dorp, M.; Lannoo, B.; Carlon, E.

2013-07-01

Using an improved version of an evolutionary algorithm originally proposed by François and Hakim [Proc. Natl. Acad. Sci. USAPNASA60027-842410.1073/pnas.0304532101 101, 580 (2004)], we generated small gene regulatory networks in which the concentration of a target protein oscillates in time. These networks may serve as candidates for oscillatory modules to be found in larger regulatory networks and protein interaction networks. The algorithm was run for 105 times to produce a large set of oscillating modules, which were systematically classified and analyzed. The robustness of the oscillations against variations of the kinetic rates was also determined, to filter out the least robust cases. Furthermore, we show that the set of evolved networks can serve as a database of models whose behavior can be compared to experimentally observed oscillations. The algorithm found three smallest (core) oscillators in which nonlinearities and number of components are minimal. Two of those are two-gene modules: the mixed feedback loop, already discussed in the literature, and an autorepressed gene coupled with a heterodimer. The third one is a single gene module which is competitively regulated by a monomer and a dimer. The evolutionary algorithm also generated larger oscillating networks, which are in part extensions of the three core modules and in part genuinely new modules. The latter includes oscillators which do not rely on feedback induced by transcription factors, but are purely of post-transcriptional type. Analysis of post-transcriptional mechanisms of oscillation may provide useful information for circadian clock research, as recent experiments showed that circadian rhythms are maintained even in the absence of transcription.

Older partner selection promotes the prevalence of cooperation in evolutionary games.

PubMed

Yang, Guoli; Huang, Jincai; Zhang, Weiming

2014-10-21

Evolutionary games typically come with the interplays between evolution of individual strategy and adaptation to network structure. How these dynamics in the co-evolution promote (or obstruct) the cooperation is regarded as an important topic in social, economic, and biological fields. Combining spatial selection with partner choice, the focus of this paper is to identify which neighbour should be selected as a role to imitate during the process of co-evolution. Age, an internal attribute and kind of local piece of information regarding the survivability of the agent, is a significant consideration for the selection strategy. The analysis and simulations presented, demonstrate that older partner selection for strategy imitation could foster the evolution of cooperation. The younger partner selection, however, may decrease the level of cooperation. Our model highlights the importance of agent׳s age on the promotion of cooperation in evolutionary games, both efficiently and effectively. Copyright © 2014 Elsevier Ltd. All rights reserved.

Q&A: How do gene regulatory networks control environmental responses in plants?

PubMed

Sun, Ying; Dinneny, José R

2018-04-11

A gene regulatory network (GRN) describes the hierarchical relationship between transcription factors, associated proteins, and their target genes. Studying GRNs allows us to understand how a plant's genotype and environment are integrated to regulate downstream physiological responses. Current efforts in plants have focused on defining the GRNs that regulate functions such as development and stress response and have been performed primarily in genetically tractable model plant species such as Arabidopsis thaliana. Future studies will likely focus on how GRNs function in non-model plants and change over evolutionary time to allow for adaptation to extreme environments. This broader understanding will inform efforts to engineer GRNs to create tailored crop traits.

Evolution of complex dynamics

NASA Astrophysics Data System (ADS)

Wilds, Roy; Kauffman, Stuart A.; Glass, Leon

2008-09-01

We study the evolution of complex dynamics in a model of a genetic regulatory network. The fitness is associated with the topological entropy in a class of piecewise linear equations, and the mutations are associated with changes in the logical structure of the network. We compare hill climbing evolution, in which only mutations that increase the fitness are allowed, with neutral evolution, in which mutations that leave the fitness unchanged are allowed. The simple structure of the fitness landscape enables us to estimate analytically the rates of hill climbing and neutral evolution. In this model, allowing neutral mutations accelerates the rate of evolutionary advancement for low mutation frequencies. These results are applicable to evolution in natural and technological systems.

Evolutionary dynamics of cooperation in neutral populations

NASA Astrophysics Data System (ADS)

Szolnoki, Attila; Perc, Matjaž

2018-01-01

Cooperation is a difficult proposition in the face of Darwinian selection. Those that defect have an evolutionary advantage over cooperators who should therefore die out. However, spatial structure enables cooperators to survive through the formation of homogeneous clusters, which is the hallmark of network reciprocity. Here we go beyond this traditional setup and study the spatiotemporal dynamics of cooperation in a population of populations. We use the prisoner's dilemma game as the mathematical model and show that considering several populations simultaneously gives rise to fascinating spatiotemporal dynamics and pattern formation. Even the simplest assumption that strategies between different populations are payoff-neutral with one another results in the spontaneous emergence of cyclic dominance, where defectors of one population become prey of cooperators in the other population, and vice versa. Moreover, if social interactions within different populations are characterized by significantly different temptations to defect, we observe that defectors in the population with the largest temptation counterintuitively vanish the fastest, while cooperators that hang on eventually take over the whole available space. Our results reveal that considering the simultaneous presence of different populations significantly expands the complexity of evolutionary dynamics in structured populations, and it allows us to understand the stability of cooperation under adverse conditions that could never be bridged by network reciprocity alone.

Topology Property and Dynamic Behavior of a Growing Spatial Network

NASA Astrophysics Data System (ADS)

Cao, Xian-Bin; Du, Wen-Bo; Hu, Mao-Bin; Rong, Zhi-Hai; Sun, Peng; Chen, Cai-Long

In this paper, we propose a growing spatial network (GSN) model and investigate its topology properties and dynamical behaviors. The model is generated by adding one node i with m links into a square lattice at each time step and the new node i is connected to the existing nodes with probabilities proportional to: ({kj})α /dij2, where kj is the degree of node j, α is the tunable parameter and dij is the Euclidean distance between i and j. It is found that both the degree heterogeneity and the clustering coefficient monotonously increase with the increment of α, while the average shortest path length monotonously decreases. Moreover, the evolutionary game dynamics and network traffic dynamics are investigated. Simulation results show that the value of α can also greatly influence the dynamic behaviors.

Elucidating the genotype-phenotype relationships and network perturbations of human shared and specific disease genes from an evolutionary perspective.

PubMed

Begum, Tina; Ghosh, Tapash Chandra

2014-10-05

To date, numerous studies have been attempted to determine the extent of variation in evolutionary rates between human disease and nondisease (ND) genes. In our present study, we have considered human autosomal monogenic (Mendelian) disease genes, which were classified into two groups according to the number of phenotypic defects, that is, specific disease (SPD) gene (one gene: one defect) and shared disease (SHD) gene (one gene: multiple defects). Here, we have compared the evolutionary rates of these two groups of genes, that is, SPD genes and SHD genes with respect to ND genes. We observed that the average evolutionary rates are slow in SHD group, intermediate in SPD group, and fast in ND group. Group-to-group evolutionary rate differences remain statistically significant regardless of their gene expression levels and number of defects. We demonstrated that disease genes are under strong selective constraint if they emerge through edgetic perturbation or drug-induced perturbation of the interactome network, show tissue-restricted expression, and are involved in transmembrane transport. Among all the factors, our regression analyses interestingly suggest the independent effects of 1) drug-induced perturbation and 2) the interaction term of expression breadth and transmembrane transport on protein evolutionary rates. We reasoned that the drug-induced network disruption is a combination of several edgetic perturbations and, thus, has more severe effect on gene phenotypes. © The Author(s) 2014. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution.

Test scheduling optimization for 3D network-on-chip based on cloud evolutionary algorithm of Pareto multi-objective

NASA Astrophysics Data System (ADS)

Xu, Chuanpei; Niu, Junhao; Ling, Jing; Wang, Suyan

2018-03-01

In this paper, we present a parallel test strategy for bandwidth division multiplexing under the test access mechanism bandwidth constraint. The Pareto solution set is combined with a cloud evolutionary algorithm to optimize the test time and power consumption of a three-dimensional network-on-chip (3D NoC). In the proposed method, all individuals in the population are sorted in non-dominated order and allocated to the corresponding level. Individuals with extreme and similar characteristics are then removed. To increase the diversity of the population and prevent the algorithm from becoming stuck around local optima, a competition strategy is designed for the individuals. Finally, we adopt an elite reservation strategy and update the individuals according to the cloud model. Experimental results show that the proposed algorithm converges to the optimal Pareto solution set rapidly and accurately. This not only obtains the shortest test time, but also optimizes the power consumption of the 3D NoC.

Global Migration Dynamics Underlie Evolution and Persistence of Human Influenza A (H3N2)

PubMed Central

Bedford, Trevor; Cobey, Sarah; Beerli, Peter; Pascual, Mercedes

2010-01-01

The global migration patterns of influenza viruses have profound implications for the evolutionary and epidemiological dynamics of the disease. We developed a novel approach to reconstruct the genetic history of human influenza A (H3N2) collected worldwide over 1998 to 2009 and used it to infer the global network of influenza transmission. Consistent with previous models, we find that China and Southeast Asia lie at the center of this global network. However, we also find that strains of influenza circulate outside of Asia for multiple seasons, persisting through dynamic migration between northern and southern regions. The USA acts as the primary hub of temperate transmission and, together with China and Southeast Asia, forms the trunk of influenza's evolutionary tree. These findings suggest that antiviral use outside of China and Southeast Asia may lead to the evolution of long-term local and potentially global antiviral resistance. Our results might also aid the design of surveillance efforts and of vaccines better tailored to different geographic regions. PMID:20523898

Evolutionary prisoner's dilemma games on the network with punishment and opportunistic partner switching

NASA Astrophysics Data System (ADS)

Takesue, H.

2018-02-01

Punishment and partner switching are two well-studied mechanisms that support the evolution of cooperation. Observation of human behaviour suggests that the extent to which punishment is adopted depends on the usage of alternative mechanisms, including partner switching. In this study, we investigate the combined effect of punishment and partner switching in evolutionary prisoner's dilemma games conducted on a network. In the model, agents are located on the network and participate in the prisoner's dilemma games with punishment. In addition, they can opportunistically switch interaction partners to improve their payoff. Our Monte Carlo simulation showed that a large frequency of punishers is required to suppress defectors when the frequency of partner switching is low. In contrast, cooperation is the most abundant strategy when the frequency of partner switching is high regardless of the strength of punishment. Interestingly, cooperators become abundant not because they avoid the cost of inflicting punishment and earn a larger average payoff per game but rather because they have more numerous opportunities to be referred to as a role agent by defectors. Our results imply that the fluidity of social relationships has a profound effect on the adopted strategy in maintaining cooperation.

Detection of Oil Chestnuts Infected by Blue Mold Using Near-Infrared Hyperspectral Imaging Combined with Artificial Neural Networks.

PubMed

Feng, Lei; Zhu, Susu; Lin, Fucheng; Su, Zhenzhu; Yuan, Kangpei; Zhao, Yiying; He, Yong; Zhang, Chu

2018-06-15

Mildew damage is a major reason for chestnut poor quality and yield loss. In this study, a near-infrared hyperspectral imaging system in the 874⁻1734 nm spectral range was applied to detect the mildew damage to chestnuts caused by blue mold. Principal component analysis (PCA) scored images were firstly employed to qualitatively and intuitively distinguish moldy chestnuts from healthy chestnuts. Spectral data were extracted from the hyperspectral images. A successive projections algorithm (SPA) was used to select 12 optimal wavelengths. Artificial neural networks, including back propagation neural network (BPNN), evolutionary neural network (ENN), extreme learning machine (ELM), general regression neural network (GRNN) and radial basis neural network (RBNN) were used to build models using the full spectra and optimal wavelengths to distinguish moldy chestnuts. BPNN and ENN models using full spectra and optimal wavelengths obtained satisfactory performances, with classification accuracies all surpassing 99%. The results indicate the potential for the rapid and non-destructive detection of moldy chestnuts by hyperspectral imaging, which would help to develop online detection system for healthy and blue mold infected chestnuts.

A new model of the spinal locomotor networks of a salamander and its properties.

PubMed

Liu, Qiang; Yang, Huizhen; Zhang, Jinxue; Wang, Jingzhuo

2018-05-22

A salamander is an ideal animal for studying the spinal locomotor network mechanism of vertebrates from an evolutionary perspective since it represents the transition from an aquatic to a terrestrial animal. However, little is known about the spinal locomotor network of a salamander. A spinal locomotor network model is a useful tool for exploring the working mechanism of the spinal networks of salamanders. A new spinal locomotor network model for a salamander is built for a three-dimensional (3D) biomechanical model of the salamander using a novel locomotion-controlled neural network model. Based on recent experimental data on the spinal circuitry and observational results of gaits of vertebrates, we assume that different interneuron sets recruited for mediating the frequency of spinal circuits are also related to the generation of different gaits. The spinal locomotor networks of salamanders are divided into low-frequency networks for walking and high-frequency networks for swimming. Additionally, a new topological structure between the body networks and limb networks is built, which only uses the body networks to coordinate the motion of limbs. There are no direct synaptic connections among limb networks. These techniques differ from existing salamander spinal locomotor network models. A simulation is performed and analyzed to validate the properties of the new spinal locomotor networks of salamanders. The simulation results show that the new spinal locomotor networks can generate a forward walking gait, a backward walking gait, a swimming gait, and a turning gait during swimming and walking. These gaits can be switched smoothly by changing external inputs from the brainstem. These properties are consistent with those of a real salamander. However, it is still difficult for the new spinal locomotor networks to generate highly efficient turning during walking, 3D swimming, nonrhythmic movements, and so on. New experimental data are required for further validation.

Self-organizing network services with evolutionary adaptation.

PubMed

Nakano, Tadashi; Suda, Tatsuya

2005-09-01

This paper proposes a novel framework for developing adaptive and scalable network services. In the proposed framework, a network service is implemented as a group of autonomous agents that interact in the network environment. Agents in the proposed framework are autonomous and capable of simple behaviors (e.g., replication, migration, and death). In this paper, an evolutionary adaptation mechanism is designed using genetic algorithms (GAs) for agents to evolve their behaviors and improve their fitness values (e.g., response time to a service request) to the environment. The proposed framework is evaluated through simulations, and the simulation results demonstrate the ability of autonomous agents to adapt to the network environment. The proposed framework may be suitable for disseminating network services in dynamic and large-scale networks where a large number of data and services need to be replicated, moved, and deleted in a decentralized manner.

Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.

PubMed

Mirzaei, Sajad; Wu, Yufeng

2016-01-01

Hybridization networks represent plausible evolutionary histories of species that are affected by reticulate evolutionary processes. An established computational problem on hybridization networks is constructing the most parsimonious hybridization network such that each of the given phylogenetic trees (called gene trees) is "displayed" in the network. There have been several previous approaches, including an exact method and several heuristics, for this NP-hard problem. However, the exact method is only applicable to a limited range of data, and heuristic methods can be less accurate and also slow sometimes. In this paper, we develop a new algorithm for constructing near parsimonious networks for multiple binary gene trees. This method is more efficient for large numbers of gene trees than previous heuristics. This new method also produces more parsimonious results on many simulated datasets as well as a real biological dataset than a previous method. We also show that our method produces topologically more accurate networks for many datasets.

PROPER: global protein interaction network alignment through percolation matching.

PubMed

Kazemi, Ehsan; Hassani, Hamed; Grossglauser, Matthias; Pezeshgi Modarres, Hassan

2016-12-12

The alignment of protein-protein interaction (PPI) networks enables us to uncover the relationships between different species, which leads to a deeper understanding of biological systems. Network alignment can be used to transfer biological knowledge between species. Although different PPI-network alignment algorithms were introduced during the last decade, developing an accurate and scalable algorithm that can find alignments with high biological and structural similarities among PPI networks is still challenging. In this paper, we introduce a new global network alignment algorithm for PPI networks called PROPER. Compared to other global network alignment methods, our algorithm shows higher accuracy and speed over real PPI datasets and synthetic networks. We show that the PROPER algorithm can detect large portions of conserved biological pathways between species. Also, using a simple parsimonious evolutionary model, we explain why PROPER performs well based on several different comparison criteria. We highlight that PROPER has high potential in further applications such as detecting biological pathways, finding protein complexes and PPI prediction. The PROPER algorithm is available at http://proper.epfl.ch .

Beam-column joint shear prediction using hybridized deep learning neural network with genetic algorithm

NASA Astrophysics Data System (ADS)

Mundher Yaseen, Zaher; Abdulmohsin Afan, Haitham; Tran, Minh-Tung

2018-04-01

Scientifically evidenced that beam-column joints are a critical point in the reinforced concrete (RC) structure under the fluctuation loads effects. In this novel hybrid data-intelligence model developed to predict the joint shear behavior of exterior beam-column structure frame. The hybrid data-intelligence model is called genetic algorithm integrated with deep learning neural network model (GA-DLNN). The genetic algorithm is used as prior modelling phase for the input approximation whereas the DLNN predictive model is used for the prediction phase. To demonstrate this structural problem, experimental data is collected from the literature that defined the dimensional and specimens’ properties. The attained findings evidenced the efficitveness of the hybrid GA-DLNN in modelling beam-column joint shear problem. In addition, the accurate prediction achived with less input variables owing to the feasibility of the evolutionary phase.

Evolutionary design of a generalized polynomial neural network for modelling sediment transport in clean pipes

NASA Astrophysics Data System (ADS)

Ebtehaj, Isa; Bonakdari, Hossein; Khoshbin, Fatemeh

2016-10-01

To determine the minimum velocity required to prevent sedimentation, six different models were proposed to estimate the densimetric Froude number (Fr). The dimensionless parameters of the models were applied along with a combination of the group method of data handling (GMDH) and the multi-target genetic algorithm. Therefore, an evolutionary design of the generalized GMDH was developed using a genetic algorithm with a specific coding scheme so as not to restrict connectivity configurations to abutting layers only. In addition, a new preserving mechanism by the multi-target genetic algorithm was utilized for the Pareto optimization of GMDH. The results indicated that the most accurate model was the one that used the volumetric concentration of sediment (CV), relative hydraulic radius (d/R), dimensionless particle number (Dgr) and overall sediment friction factor (λs) in estimating Fr. Furthermore, the comparison between the proposed method and traditional equations indicated that GMDH is more accurate than existing equations.

The effects of node exclusion on the centrality measures in graph models of interacting economic agents

NASA Astrophysics Data System (ADS)

Caetano, Marco Antonio Leonel; Yoneyama, Takashi

2015-07-01

This work concerns the study of the effects felt by a network as a whole when a specific node is perturbed. Many real world systems can be described by network models in which the interactions of the various agents can be represented as an edge of a graph. With a graph model in hand, it is possible to evaluate the effect of deleting some of its edges on the architecture and values of nodes of the network. Eventually a node may end up isolated from the rest of the network and an interesting problem is to have a quantitative measure of the impact of such an event. For instance, in the field of finance, the network models are very popular and the proposed methodology allows to carry out "what if" tests in terms of weakening the links between the economic agents, represented as nodes. The two main concepts employed in the proposed methodology are (i) the vibrational IC-Information Centrality, which can provide a measure of the relative importance of a particular node in a network and (ii) autocatalytic networks that can indicate the evolutionary trends of the network. Although these concepts were originally proposed in the context of other fields of knowledge, they were also found to be useful in analyzing financial networks. In order to illustrate the applicability of the proposed methodology, a case of study using the actual data comprising stock market indices of 12 countries is presented.

Supercooperation in evolutionary games on correlated weighted networks.

PubMed

Buesser, Pierre; Tomassini, Marco

2012-01-01

In this work we study the behavior of classical two-person, two-strategies evolutionary games on a class of weighted networks derived from Barabási-Albert and random scale-free unweighted graphs. Using customary imitative dynamics, our numerical simulation results show that the presence of link weights that are correlated in a particular manner with the degree of the link end points leads to unprecedented levels of cooperation in the whole games' phase space, well above those found for the corresponding unweighted complex networks. We provide intuitive explanations for this favorable behavior by transforming the weighted networks into unweighted ones with particular topological properties. The resulting structures help us to understand why cooperation can thrive and also give ideas as to how such supercooperative networks might be built.

Computational architecture of the yeast regulatory network

NASA Astrophysics Data System (ADS)

Maslov, Sergei; Sneppen, Kim

2005-12-01

The topology of regulatory networks contains clues to their overall design principles and evolutionary history. We find that while in- and out-degrees of a given protein in the regulatory network are not correlated with each other, there exists a strong negative correlation between the out-degree of a regulatory protein and in-degrees of its targets. Such correlation positions large regulatory modules on the periphery of the network and makes them rather well separated from each other. We also address the question of relative importance of different classes of proteins quantified by the lethality of null-mutants lacking one of them as well as by the level of their evolutionary conservation. It was found that in the yeast regulatory network highly connected proteins are in fact less important than their low-connected counterparts.

Kernel spectral clustering with memory effect

NASA Astrophysics Data System (ADS)

Langone, Rocco; Alzate, Carlos; Suykens, Johan A. K.

2013-05-01

Evolving graphs describe many natural phenomena changing over time, such as social relationships, trade markets, metabolic networks etc. In this framework, performing community detection and analyzing the cluster evolution represents a critical task. Here we propose a new model for this purpose, where the smoothness of the clustering results over time can be considered as a valid prior knowledge. It is based on a constrained optimization formulation typical of Least Squares Support Vector Machines (LS-SVM), where the objective function is designed to explicitly incorporate temporal smoothness. The latter allows the model to cluster the current data well and to be consistent with the recent history. We also propose new model selection criteria in order to carefully choose the hyper-parameters of our model, which is a crucial issue to achieve good performances. We successfully test the model on four toy problems and on a real world network. We also compare our model with Evolutionary Spectral Clustering, which is a state-of-the-art algorithm for community detection of evolving networks, illustrating that the kernel spectral clustering with memory effect can achieve better or equal performances.

Probability, statistics, and computational science.

PubMed

Beerenwinkel, Niko; Siebourg, Juliane

2012-01-01

In this chapter, we review basic concepts from probability theory and computational statistics that are fundamental to evolutionary genomics. We provide a very basic introduction to statistical modeling and discuss general principles, including maximum likelihood and Bayesian inference. Markov chains, hidden Markov models, and Bayesian network models are introduced in more detail as they occur frequently and in many variations in genomics applications. In particular, we discuss efficient inference algorithms and methods for learning these models from partially observed data. Several simple examples are given throughout the text, some of which point to models that are discussed in more detail in subsequent chapters.

The evolutionary advantage of limited network knowledge.

PubMed

Larson, Jennifer M

2016-06-07

Groups of individuals have social networks that structure interactions within the groups; evolutionary theory increasingly uses this fact to explain the emergence of cooperation (Eshel and Cavalli-Sforza, 1982; Boyd and Richerson, 1988, 1989; Ohtsuki et al., 2006; Nowak et al., 2010; Van Veelen et al., 2012). This approach has resulted in a number of important insights for the evolution of cooperation in the biological and social sciences, but omits a key function of social networks that has persisted throughout recent evolutionary history (Apicella et al., 2012): their role in transmitting gossip about behavior within a group. Accounting for this well-established role of social networks among rational agents in a setting of indirect reciprocity not only shows a new mechanism by which the structure of networks is fitness-relevant, but also reveals that knowledge of social networks can be fitness-relevant as well. When groups enforce cooperation by sanctioning peers whom gossip reveals to have deviated, individuals in certain peripheral network positions are tempting targets of uncooperative behavior because gossip they share about misbehavior spreads slowly through the network. The ability to identify these individuals creates incentives to behave uncooperatively. Consequently, groups comprised of individuals who knew precise information about their social networks would be at a fitness disadvantage relative to groups of individuals with a coarser knowledge of their networks. Empirical work has consistently shown that modern humans know little about the structure of their own social networks and perform poorly when tasked with learning new ones. This robust empirical regularity may be the product of natural selection in an environment of strong selective pressure at the group level. Imprecise views of networks make enforcing cooperation easier. Copyright © 2016 Elsevier Ltd. All rights reserved.

Clustered marginalization of minorities during social transitions induced by co-evolution of behaviour and network structure

NASA Astrophysics Data System (ADS)

Schleussner, Carl-Friedrich; Donges, Jonathan F.; Engemann, Denis A.; Levermann, Anders

2016-08-01

Large-scale transitions in societies are associated with both individual behavioural change and restructuring of the social network. These two factors have often been considered independently, yet recent advances in social network research challenge this view. Here we show that common features of societal marginalization and clustering emerge naturally during transitions in a co-evolutionary adaptive network model. This is achieved by explicitly considering the interplay between individual interaction and a dynamic network structure in behavioural selection. We exemplify this mechanism by simulating how smoking behaviour and the network structure get reconfigured by changing social norms. Our results are consistent with empirical findings: The prevalence of smoking was reduced, remaining smokers were preferentially connected among each other and formed increasingly marginalized clusters. We propose that self-amplifying feedbacks between individual behaviour and dynamic restructuring of the network are main drivers of the transition. This generative mechanism for co-evolution of individual behaviour and social network structure may apply to a wide range of examples beyond smoking.

Clustered marginalization of minorities during social transitions induced by co-evolution of behaviour and network structure.

PubMed

Schleussner, Carl-Friedrich; Donges, Jonathan F; Engemann, Denis A; Levermann, Anders

2016-08-11

Large-scale transitions in societies are associated with both individual behavioural change and restructuring of the social network. These two factors have often been considered independently, yet recent advances in social network research challenge this view. Here we show that common features of societal marginalization and clustering emerge naturally during transitions in a co-evolutionary adaptive network model. This is achieved by explicitly considering the interplay between individual interaction and a dynamic network structure in behavioural selection. We exemplify this mechanism by simulating how smoking behaviour and the network structure get reconfigured by changing social norms. Our results are consistent with empirical findings: The prevalence of smoking was reduced, remaining smokers were preferentially connected among each other and formed increasingly marginalized clusters. We propose that self-amplifying feedbacks between individual behaviour and dynamic restructuring of the network are main drivers of the transition. This generative mechanism for co-evolution of individual behaviour and social network structure may apply to a wide range of examples beyond smoking.

Evolutionary Space Communications Architectures for Human/Robotic Exploration and Science Missions

NASA Technical Reports Server (NTRS)

Bhasin, Kul; Hayden, Jeffrey L.

2004-01-01

NASA enterprises have growing needs for an advanced, integrated, communications infrastructure that will satisfy the capabilities needed for multiple human, robotic and scientific missions beyond 2015. Furthermore, the reliable, multipoint infrastructure is required to provide continuous, maximum coverage of areas of concentrated activities, such as around Earth and in the vicinity of the Moon or Mars, with access made available on demand of the human or robotic user. As a first step, the definitions of NASA's future space communications and networking architectures are underway. Architectures that describe the communications and networking needed between the nodal regions consisting of Earth, Moon, Lagrange points, Mars, and the places of interest within the inner and outer solar system have been laid out. These architectures will need the modular flexibility that must be included in the communication and networking technologies to enable the infrastructure to grow in capability with time and to transform from supporting robotic missions in the solar system to supporting human ventures to Mars, Jupiter, Jupiter's moons, and beyond. The protocol-based networking capability seamlessly connects the backbone, access, inter-spacecraft and proximity network elements of the architectures employed in the infrastructure. In this paper, we present the summary of NASA's near and long term needs and capability requirements that were gathered by participative methods. We describe an integrated architecture concept and model that will enable communications for evolutionary robotic and human science missions. We then define the communication nodes, their requirements, and various options to connect them.

Evolutionary Space Communications Architectures for Human/Robotic Exploration and Science Missions

NASA Astrophysics Data System (ADS)

Bhasin, Kul; Hayden, Jeffrey L.

2004-02-01

NASA enterprises have growing needs for an advanced, integrated, communications infrastructure that will satisfy the capabilities needed for multiple human, robotic and scientific missions beyond 2015. Furthermore, the reliable, multipoint infrastructure is required to provide continuous, maximum coverage of areas of concentrated activities, such as around Earth and in the vicinity of the Moon or Mars, with access made available on demand of the human or robotic user. As a first step, the definitions of NASA's future space communications and networking architectures are underway. Architectures that describe the communications and networking needed between the nodal regions consisting of Earth, Moon, Lagrange points, Mars, and the places of interest within the inner and outer solar system have been laid out. These architectures will need the modular flexibility that must be included in the communication and networking technologies to enable the infrastructure to grow in capability with time and to transform from supporting robotic missions in the solar system to supporting human ventures to Mars, Jupiter, Jupiter's moons, and beyond. The protocol-based networking capability seamlessly connects the backbone, access, inter-spacecraft and proximity network elements of the architectures employed in the infrastructure. In this paper, we present the summary of NASA's near and long term needs and capability requirements that were gathered by participative methods. We describe an integrated architecture concept and model that will enable communications for evolutionary robotic and human science missions. We then define the communication nodes, their requirements, and various options to connect them.

Structural principles within the human-virus protein-protein interaction network

PubMed Central

Franzosa, Eric A.; Xia, Yu

2011-01-01

General properties of the antagonistic biomolecular interactions between viruses and their hosts (exogenous interactions) remain poorly understood, and may differ significantly from known principles governing the cooperative interactions within the host (endogenous interactions). Systems biology approaches have been applied to study the combined interaction networks of virus and human proteins, but such efforts have so far revealed only low-resolution patterns of host-virus interaction. Here, we layer curated and predicted 3D structural models of human-virus and human-human protein complexes on top of traditional interaction networks to reconstruct the human-virus structural interaction network. This approach reveals atomic resolution, mechanistic patterns of host-virus interaction, and facilitates systematic comparison with the host’s endogenous interactions. We find that exogenous interfaces tend to overlap with and mimic endogenous interfaces, thereby competing with endogenous binding partners. The endogenous interfaces mimicked by viral proteins tend to participate in multiple endogenous interactions which are transient and regulatory in nature. While interface overlap in the endogenous network results largely from gene duplication followed by divergent evolution, viral proteins frequently achieve interface mimicry without any sequence or structural similarity to an endogenous binding partner. Finally, while endogenous interfaces tend to evolve more slowly than the rest of the protein surface, exogenous interfaces—including many sites of endogenous-exogenous overlap—tend to evolve faster, consistent with an evolutionary “arms race” between host and pathogen. These significant biophysical, functional, and evolutionary differences between host-pathogen and within-host protein-protein interactions highlight the distinct consequences of antagonism versus cooperation in biological networks. PMID:21680884

Collective influence in evolutionary social dilemmas

NASA Astrophysics Data System (ADS)

Szolnoki, Attila; Perc, Matjaž

2016-03-01

When evolutionary games are contested in structured populations, the degree of each player in the network plays an important role. If they exist, hubs often determine the fate of the population in remarkable ways. Recent research based on optimal percolation in random networks has shown, however, that the degree is neither the sole nor the best predictor of influence in complex networks. Low-degree nodes may also be optimal influencers if they are hierarchically linked to hubs. Taking this into account leads to the formalism of collective influence in complex networks, which as we show here, has far-reaching implications for the favorable resolution of social dilemmas. In particular, there exists an optimal hierarchical depth for the determination of collective influence that we use to describe the potency of players for passing their strategies, which depends on the strength of the social dilemma. Interestingly, the degree, which corresponds to the baseline depth zero, is optimal only when the temptation to defect is small. Our research reveals that evolutionary success stories are related to spreading processes which are rooted in favorable hierarchical structures that extend beyond local neighborhoods.

A gene network model accounting for development and evolution of mammalian teeth

PubMed Central

Salazar-Ciudad, Isaac; Jernvall, Jukka

2002-01-01

Generation of morphological diversity remains a challenge for evolutionary biologists because it is unclear how an ultimately finite number of genes involved in initial pattern formation integrates with morphogenesis. Ideally, models used to search for the simplest developmental principles on how genes produce form should account for both developmental process and evolutionary change. Here we present a model reproducing the morphology of mammalian teeth by integrating experimental data on gene interactions and growth into a morphodynamic mechanism in which developing morphology has a causal role in patterning. The model predicts the course of tooth-shape development in different mammalian species and also reproduces key transitions in evolution. Furthermore, we reproduce the known expression patterns of several genes involved in tooth development and their dynamics over developmental time. Large morphological effects frequently can be achieved by small changes, according to this model, and similar morphologies can be produced by different changes. This finding may be consistent with why predicting the morphological outcomes of molecular experiments is challenging. Nevertheless, models incorporating morphology and gene activity show promise for linking genotypes to phenotypes. PMID:12048258

Assessment of traffic noise levels in urban areas using different soft computing techniques.

PubMed

Tomić, J; Bogojević, N; Pljakić, M; Šumarac-Pavlović, D

2016-10-01

Available traffic noise prediction models are usually based on regression analysis of experimental data, and this paper presents the application of soft computing techniques in traffic noise prediction. Two mathematical models are proposed and their predictions are compared to data collected by traffic noise monitoring in urban areas, as well as to predictions of commonly used traffic noise models. The results show that application of evolutionary algorithms and neural networks may improve process of development, as well as accuracy of traffic noise prediction.

Simultaneously selecting appropriate partners for gaming and strategy adaptation to enhance network reciprocity in the prisoner's dilemma

NASA Astrophysics Data System (ADS)

Tanimoto, Jun

2014-01-01

Network reciprocity is one mechanism for adding social viscosity, which leads to cooperative equilibrium in 2 × 2 prisoner's dilemma games. Previous studies have shown that cooperation can be enhanced by using a skewed, rather than a random, selection of partners for either strategy adaptation or the gaming process. Here we show that combining both processes for selecting a gaming partner and an adaptation partner further enhances cooperation, provided that an appropriate selection rule and parameters are adopted. We also show that this combined model significantly enhances cooperation by reducing the degree of activity in the underlying network; we measure the degree of activity with a quantity called effective degree. More precisely, during the initial evolutionary stage in which the global cooperation fraction declines because initially allocated cooperators becoming defectors, the model shows that weak cooperative clusters perish and only a few strong cooperative clusters survive. This finding is the most important key to attaining significant network reciprocity.

A spread willingness computing-based information dissemination model.

PubMed

Huang, Haojing; Cui, Zhiming; Zhang, Shukui

2014-01-01

This paper constructs a kind of spread willingness computing based on information dissemination model for social network. The model takes into account the impact of node degree and dissemination mechanism, combined with the complex network theory and dynamics of infectious diseases, and further establishes the dynamical evolution equations. Equations characterize the evolutionary relationship between different types of nodes with time. The spread willingness computing contains three factors which have impact on user's spread behavior: strength of the relationship between the nodes, views identity, and frequency of contact. Simulation results show that different degrees of nodes show the same trend in the network, and even if the degree of node is very small, there is likelihood of a large area of information dissemination. The weaker the relationship between nodes, the higher probability of views selection and the higher the frequency of contact with information so that information spreads rapidly and leads to a wide range of dissemination. As the dissemination probability and immune probability change, the speed of information dissemination is also changing accordingly. The studies meet social networking features and can help to master the behavior of users and understand and analyze characteristics of information dissemination in social network.

A Spread Willingness Computing-Based Information Dissemination Model

PubMed Central

Cui, Zhiming; Zhang, Shukui

2014-01-01

This paper constructs a kind of spread willingness computing based on information dissemination model for social network. The model takes into account the impact of node degree and dissemination mechanism, combined with the complex network theory and dynamics of infectious diseases, and further establishes the dynamical evolution equations. Equations characterize the evolutionary relationship between different types of nodes with time. The spread willingness computing contains three factors which have impact on user's spread behavior: strength of the relationship between the nodes, views identity, and frequency of contact. Simulation results show that different degrees of nodes show the same trend in the network, and even if the degree of node is very small, there is likelihood of a large area of information dissemination. The weaker the relationship between nodes, the higher probability of views selection and the higher the frequency of contact with information so that information spreads rapidly and leads to a wide range of dissemination. As the dissemination probability and immune probability change, the speed of information dissemination is also changing accordingly. The studies meet social networking features and can help to master the behavior of users and understand and analyze characteristics of information dissemination in social network. PMID:25110738

Local Nash equilibrium in social networks.

PubMed

Zhang, Yichao; Aziz-Alaoui, M A; Bertelle, Cyrille; Guan, Jihong

2014-08-29

Nash equilibrium is widely present in various social disputes. As of now, in structured static populations, such as social networks, regular, and random graphs, the discussions on Nash equilibrium are quite limited. In a relatively stable static gaming network, a rational individual has to comprehensively consider all his/her opponents' strategies before they adopt a unified strategy. In this scenario, a new strategy equilibrium emerges in the system. We define this equilibrium as a local Nash equilibrium. In this paper, we present an explicit definition of the local Nash equilibrium for the two-strategy games in structured populations. Based on the definition, we investigate the condition that a system reaches the evolutionary stable state when the individuals play the Prisoner's dilemma and snow-drift game. The local Nash equilibrium provides a way to judge whether a gaming structured population reaches the evolutionary stable state on one hand. On the other hand, it can be used to predict whether cooperators can survive in a system long before the system reaches its evolutionary stable state for the Prisoner's dilemma game. Our work therefore provides a theoretical framework for understanding the evolutionary stable state in the gaming populations with static structures.

Local Nash Equilibrium in Social Networks

PubMed Central

Zhang, Yichao; Aziz-Alaoui, M. A.; Bertelle, Cyrille; Guan, Jihong

2014-01-01

Nash equilibrium is widely present in various social disputes. As of now, in structured static populations, such as social networks, regular, and random graphs, the discussions on Nash equilibrium are quite limited. In a relatively stable static gaming network, a rational individual has to comprehensively consider all his/her opponents' strategies before they adopt a unified strategy. In this scenario, a new strategy equilibrium emerges in the system. We define this equilibrium as a local Nash equilibrium. In this paper, we present an explicit definition of the local Nash equilibrium for the two-strategy games in structured populations. Based on the definition, we investigate the condition that a system reaches the evolutionary stable state when the individuals play the Prisoner's dilemma and snow-drift game. The local Nash equilibrium provides a way to judge whether a gaming structured population reaches the evolutionary stable state on one hand. On the other hand, it can be used to predict whether cooperators can survive in a system long before the system reaches its evolutionary stable state for the Prisoner's dilemma game. Our work therefore provides a theoretical framework for understanding the evolutionary stable state in the gaming populations with static structures. PMID:25169150

Local Nash Equilibrium in Social Networks

NASA Astrophysics Data System (ADS)

Zhang, Yichao; Aziz-Alaoui, M. A.; Bertelle, Cyrille; Guan, Jihong

2014-08-01

Nash equilibrium is widely present in various social disputes. As of now, in structured static populations, such as social networks, regular, and random graphs, the discussions on Nash equilibrium are quite limited. In a relatively stable static gaming network, a rational individual has to comprehensively consider all his/her opponents' strategies before they adopt a unified strategy. In this scenario, a new strategy equilibrium emerges in the system. We define this equilibrium as a local Nash equilibrium. In this paper, we present an explicit definition of the local Nash equilibrium for the two-strategy games in structured populations. Based on the definition, we investigate the condition that a system reaches the evolutionary stable state when the individuals play the Prisoner's dilemma and snow-drift game. The local Nash equilibrium provides a way to judge whether a gaming structured population reaches the evolutionary stable state on one hand. On the other hand, it can be used to predict whether cooperators can survive in a system long before the system reaches its evolutionary stable state for the Prisoner's dilemma game. Our work therefore provides a theoretical framework for understanding the evolutionary stable state in the gaming populations with static structures.

Deciphering the Interdependence between Ecological and Evolutionary Networks.

PubMed

Melián, Carlos J; Matthews, Blake; de Andreazzi, Cecilia S; Rodríguez, Jorge P; Harmon, Luke J; Fortuna, Miguel A

2018-05-24

Biological systems consist of elements that interact within and across hierarchical levels. For example, interactions among genes determine traits of individuals, competitive and cooperative interactions among individuals influence population dynamics, and interactions among species affect the dynamics of communities and ecosystem processes. Such systems can be represented as hierarchical networks, but can have complex dynamics when interdependencies among levels of the hierarchy occur. We propose integrating ecological and evolutionary processes in hierarchical networks to explore interdependencies in biological systems. We connect gene networks underlying predator-prey trait distributions to food webs. Our approach addresses longstanding questions about how complex traits and intraspecific trait variation affect the interdependencies among biological levels and the stability of meta-ecosystems. Copyright © 2018 Elsevier Ltd. All rights reserved.

Approaches to Macroevolution: 1. General Concepts and Origin of Variation.

PubMed

Jablonski, David

2017-01-01

Approaches to macroevolution require integration of its two fundamental components, i.e. the origin and the sorting of variation, in a hierarchical framework. Macroevolution occurs in multiple currencies that are only loosely correlated, notably taxonomic diversity, morphological disparity, and functional variety. The origin of variation within this conceptual framework is increasingly understood in developmental terms, with the semi-hierarchical structure of gene regulatory networks (GRNs, used here in a broad sense incorporating not just the genetic circuitry per se but the factors controlling the timing and location of gene expression and repression), the non-linear relation between magnitude of genetic change and the phenotypic results, the evolutionary potential of co-opting existing GRNs, and developmental responsiveness to nongenetic signals (i.e. epigenetics and plasticity), all requiring modification of standard microevolutionary models, and rendering difficult any simple definition of evolutionary novelty. The developmental factors underlying macroevolution create anisotropic probabilities-i.e., an uneven density distribution-of evolutionary change around any given phenotypic starting point, and the potential for coordinated changes among traits that can accommodate change via epigenetic mechanisms. From this standpoint, "punctuated equilibrium" and "phyletic gradualism" simply represent two cells in a matrix of evolutionary models of phenotypic change, and the origin of trends and evolutionary novelty are not simply functions of ecological opportunity. Over long timescales, contingency becomes especially important, and can be viewed in terms of macroevolutionary lags (the temporal separation between the origin of a trait or clade and subsequent diversification); such lags can arise by several mechanisms: as geological or phylogenetic artifacts, or when diversifications require synergistic interactions among traits, or between traits and external events. The temporal and spatial patterns of the origins of evolutionary novelties are a challenge to macroevolutionary theory; individual events can be described retrospectively, but a general model relating development, genetics, and ecology is needed. An accompanying paper (Jablonski in Evol Biol 2017) reviews diversity dynamics and the sorting of variation, with some general conclusions.

Predictive genomics: a cancer hallmark network framework for predicting tumor clinical phenotypes using genome sequencing data.

PubMed

Wang, Edwin; Zaman, Naif; Mcgee, Shauna; Milanese, Jean-Sébastien; Masoudi-Nejad, Ali; O'Connor-McCourt, Maureen

2015-02-01

Tumor genome sequencing leads to documenting thousands of DNA mutations and other genomic alterations. At present, these data cannot be analyzed adequately to aid in the understanding of tumorigenesis and its evolution. Moreover, we have little insight into how to use these data to predict clinical phenotypes and tumor progression to better design patient treatment. To meet these challenges, we discuss a cancer hallmark network framework for modeling genome sequencing data to predict cancer clonal evolution and associated clinical phenotypes. The framework includes: (1) cancer hallmarks that can be represented by a few molecular/signaling networks. 'Network operational signatures' which represent gene regulatory logics/strengths enable to quantify state transitions and measures of hallmark traits. Thus, sets of genomic alterations which are associated with network operational signatures could be linked to the state/measure of hallmark traits. The network operational signature transforms genotypic data (i.e., genomic alterations) to regulatory phenotypic profiles (i.e., regulatory logics/strengths), to cellular phenotypic profiles (i.e., hallmark traits) which lead to clinical phenotypic profiles (i.e., a collection of hallmark traits). Furthermore, the framework considers regulatory logics of the hallmark networks under tumor evolutionary dynamics and therefore also includes: (2) a self-promoting positive feedback loop that is dominated by a genomic instability network and a cell survival/proliferation network is the main driver of tumor clonal evolution. Surrounding tumor stroma and its host immune systems shape the evolutionary paths; (3) cell motility initiating metastasis is a byproduct of the above self-promoting loop activity during tumorigenesis; (4) an emerging hallmark network which triggers genome duplication dominates a feed-forward loop which in turn could act as a rate-limiting step for tumor formation; (5) mutations and other genomic alterations have specific patterns and tissue-specificity, which are driven by aging and other cancer-inducing agents. This framework represents the logics of complex cancer biology as a myriad of phenotypic complexities governed by a limited set of underlying organizing principles. It therefore adds to our understanding of tumor evolution and tumorigenesis, and moreover, potential usefulness of predicting tumors' evolutionary paths and clinical phenotypes. Strategies of using this framework in conjunction with genome sequencing data in an attempt to predict personalized drug targets, drug resistance, and metastasis for cancer patients, as well as cancer risks for healthy individuals are discussed. Accurate prediction of cancer clonal evolution and clinical phenotypes will have substantial impact on timely diagnosis, personalized treatment and personalized prevention of cancer. Crown Copyright © 2014. Published by Elsevier Ltd. All rights reserved.

Evolution of Hormone Signaling Networks in Plant Defense.

PubMed

Berens, Matthias L; Berry, Hannah M; Mine, Akira; Argueso, Cristiana T; Tsuda, Kenichi

2017-08-04

Studies with model plants such as Arabidopsis thaliana have revealed that phytohormones are central regulators of plant defense. The intricate network of phytohormone signaling pathways enables plants to activate appropriate and effective defense responses against pathogens as well as to balance defense and growth. The timing of the evolution of most phytohormone signaling pathways seems to coincide with the colonization of land, a likely requirement for plant adaptations to the more variable terrestrial environments, which included the presence of pathogens. In this review, we explore the evolution of defense hormone signaling networks by combining the model plant-based knowledge about molecular components mediating phytohormone signaling and cross talk with available genome information of other plant species. We highlight conserved hubs in hormone cross talk and discuss evolutionary advantages of defense hormone cross talk. Finally, we examine possibilities of engineering hormone cross talk for improvement of plant fitness and crop production.

Patterns of coordinated cortical remodeling during adolescence and their associations with functional specialization and evolutionary expansion.

PubMed

Sotiras, Aristeidis; Toledo, Jon B; Gur, Raquel E; Gur, Ruben C; Satterthwaite, Theodore D; Davatzikos, Christos

2017-03-28

During adolescence, the human cortex undergoes substantial remodeling to support a rapid expansion of behavioral repertoire. Accurately quantifying these changes is a prerequisite for understanding normal brain development, as well as the neuropsychiatric disorders that emerge in this vulnerable period. Past accounts have demonstrated substantial regional heterogeneity in patterns of brain development, but frequently have been limited by small samples and analytics that do not evaluate complex multivariate imaging patterns. Capitalizing on recent advances in multivariate analysis methods, we used nonnegative matrix factorization (NMF) to uncover coordinated patterns of cortical development in a sample of 934 youths ages 8-20, who completed structural neuroimaging as part of the Philadelphia Neurodevelopmental Cohort. Patterns of structural covariance (PSCs) derived by NMF were highly reproducible over a range of resolutions, and differed markedly from common gyral-based structural atlases. Moreover, PSCs were largely symmetric and showed correspondence to specific large-scale functional networks. The level of correspondence was ordered according to their functional role and position in the evolutionary hierarchy, being high in lower-order visual and somatomotor networks and diminishing in higher-order association cortex. Furthermore, PSCs showed divergent developmental associations, with PSCs in higher-order association cortex networks showing greater changes with age than primary somatomotor and visual networks. Critically, such developmental changes within PSCs were significantly associated with the degree of evolutionary cortical expansion. Together, our findings delineate a set of structural brain networks that undergo coordinated cortical thinning during adolescence, which is in part governed by evolutionary novelty and functional specialization.

Multi-Objective Community Detection Based on Memetic Algorithm

PubMed Central

2015-01-01

Community detection has drawn a lot of attention as it can provide invaluable help in understanding the function and visualizing the structure of networks. Since single objective optimization methods have intrinsic drawbacks to identifying multiple significant community structures, some methods formulate the community detection as multi-objective problems and adopt population-based evolutionary algorithms to obtain multiple community structures. Evolutionary algorithms have strong global search ability, but have difficulty in locating local optima efficiently. In this study, in order to identify multiple significant community structures more effectively, a multi-objective memetic algorithm for community detection is proposed by combining multi-objective evolutionary algorithm with a local search procedure. The local search procedure is designed by addressing three issues. Firstly, nondominated solutions generated by evolutionary operations and solutions in dominant population are set as initial individuals for local search procedure. Then, a new direction vector named as pseudonormal vector is proposed to integrate two objective functions together to form a fitness function. Finally, a network specific local search strategy based on label propagation rule is expanded to search the local optimal solutions efficiently. The extensive experiments on both artificial and real-world networks evaluate the proposed method from three aspects. Firstly, experiments on influence of local search procedure demonstrate that the local search procedure can speed up the convergence to better partitions and make the algorithm more stable. Secondly, comparisons with a set of classic community detection methods illustrate the proposed method can find single partitions effectively. Finally, the method is applied to identify hierarchical structures of networks which are beneficial for analyzing networks in multi-resolution levels. PMID:25932646

Multi-objective community detection based on memetic algorithm.

PubMed

Wu, Peng; Pan, Li

2015-01-01

Community detection has drawn a lot of attention as it can provide invaluable help in understanding the function and visualizing the structure of networks. Since single objective optimization methods have intrinsic drawbacks to identifying multiple significant community structures, some methods formulate the community detection as multi-objective problems and adopt population-based evolutionary algorithms to obtain multiple community structures. Evolutionary algorithms have strong global search ability, but have difficulty in locating local optima efficiently. In this study, in order to identify multiple significant community structures more effectively, a multi-objective memetic algorithm for community detection is proposed by combining multi-objective evolutionary algorithm with a local search procedure. The local search procedure is designed by addressing three issues. Firstly, nondominated solutions generated by evolutionary operations and solutions in dominant population are set as initial individuals for local search procedure. Then, a new direction vector named as pseudonormal vector is proposed to integrate two objective functions together to form a fitness function. Finally, a network specific local search strategy based on label propagation rule is expanded to search the local optimal solutions efficiently. The extensive experiments on both artificial and real-world networks evaluate the proposed method from three aspects. Firstly, experiments on influence of local search procedure demonstrate that the local search procedure can speed up the convergence to better partitions and make the algorithm more stable. Secondly, comparisons with a set of classic community detection methods illustrate the proposed method can find single partitions effectively. Finally, the method is applied to identify hierarchical structures of networks which are beneficial for analyzing networks in multi-resolution levels.

Brownian model of transcriptome evolution and phylogenetic network visualization between tissues.

PubMed

Gu, Xun; Ruan, Hang; Su, Zhixi; Zou, Yangyun

2017-09-01

While phylogenetic analysis of transcriptomes of the same tissue is usually congruent with the species tree, the controversy emerges when multiple tissues are included, that is, whether species from the same tissue are clustered together, or different tissues from the same species are clustered together. Recent studies have suggested that phylogenetic network approach may shed some lights on our understanding of multi-tissue transcriptome evolution; yet the underlying evolutionary mechanism remains unclear. In this paper we develop a Brownian-based model of transcriptome evolution under the phylogenetic network that can statistically distinguish between the patterns of species-clustering and tissue-clustering. Our model can be used as a null hypothesis (neutral transcriptome evolution) for testing any correlation in tissue evolution, can be applied to cancer transcriptome evolution to study whether two tumors of an individual appeared independently or via metastasis, and can be useful to detect convergent evolution at the transcriptional level. Copyright © 2017. Published by Elsevier Inc.

The relative efficiency of modular and non-modular networks of different size

PubMed Central

Tosh, Colin R.; McNally, Luke

2015-01-01

Most biological networks are modular but previous work with small model networks has indicated that modularity does not necessarily lead to increased functional efficiency. Most biological networks are large, however, and here we examine the relative functional efficiency of modular and non-modular neural networks at a range of sizes. We conduct a detailed analysis of efficiency in networks of two size classes: ‘small’ and ‘large’, and a less detailed analysis across a range of network sizes. The former analysis reveals that while the modular network is less efficient than one of the two non-modular networks considered when networks are small, it is usually equally or more efficient than both non-modular networks when networks are large. The latter analysis shows that in networks of small to intermediate size, modular networks are much more efficient that non-modular networks of the same (low) connective density. If connective density must be kept low to reduce energy needs for example, this could promote modularity. We have shown how relative functionality/performance scales with network size, but the precise nature of evolutionary relationship between network size and prevalence of modularity will depend on the costs of connectivity. PMID:25631996

Unfavorable Individuals in Social Gaming Networks.

PubMed

Zhang, Yichao; Chen, Guanrong; Guan, Jihong; Zhang, Zhongzhi; Zhou, Shuigeng

2015-12-09

In social gaming networks, the current research focus has been on the origin of widespread reciprocal behaviors when individuals play non-cooperative games. In this paper, we investigate the topological properties of unfavorable individuals in evolutionary games. The unfavorable individuals are defined as the individuals gaining the lowest average payoff in a round of game. Since the average payoff is normally considered as a measure of fitness, the unfavorable individuals are very likely to be eliminated or change their strategy updating rules from a Darwinian perspective. Considering that humans can hardly adopt a unified strategy to play with their neighbors, we propose a divide-and-conquer game model, where individuals can interact with their neighbors in the network with appropriate strategies. We test and compare a series of highly rational strategy updating rules. In the tested scenarios, our analytical and simulation results surprisingly reveal that the less-connected individuals in degree-heterogeneous networks are more likely to become the unfavorable individuals. Our finding suggests that the connectivity of individuals as a social capital fundamentally changes the gaming environment. Our model, therefore, provides a theoretical framework for further understanding the social gaming networks.

Crucial role of strategy updating for coexistence of strategies in interaction networks.

PubMed

Zhang, Jianlei; Zhang, Chunyan; Cao, Ming; Weissing, Franz J

2015-04-01

Network models are useful tools for studying the dynamics of social interactions in a structured population. After a round of interactions with the players in their local neighborhood, players update their strategy based on the comparison of their own payoff with the payoff of one of their neighbors. Here we show that the assumptions made on strategy updating are of crucial importance for the strategy dynamics. In the first step, we demonstrate that seemingly small deviations from the standard assumptions on updating have major implications for the evolutionary outcome of two cooperation games: cooperation can more easily persist in a Prisoner's Dilemma game, while it can go more easily extinct in a Snowdrift game. To explain these outcomes, we develop a general model for the updating of states in a network that allows us to derive conditions for the steady-state coexistence of states (or strategies). The analysis reveals that coexistence crucially depends on the number of agents consulted for updating. We conclude that updating rules are as important for evolution on a network as network structure and the nature of the interaction.

Crucial role of strategy updating for coexistence of strategies in interaction networks

NASA Astrophysics Data System (ADS)

Zhang, Jianlei; Zhang, Chunyan; Cao, Ming; Weissing, Franz J.

2015-04-01

Network models are useful tools for studying the dynamics of social interactions in a structured population. After a round of interactions with the players in their local neighborhood, players update their strategy based on the comparison of their own payoff with the payoff of one of their neighbors. Here we show that the assumptions made on strategy updating are of crucial importance for the strategy dynamics. In the first step, we demonstrate that seemingly small deviations from the standard assumptions on updating have major implications for the evolutionary outcome of two cooperation games: cooperation can more easily persist in a Prisoner's Dilemma game, while it can go more easily extinct in a Snowdrift game. To explain these outcomes, we develop a general model for the updating of states in a network that allows us to derive conditions for the steady-state coexistence of states (or strategies). The analysis reveals that coexistence crucially depends on the number of agents consulted for updating. We conclude that updating rules are as important for evolution on a network as network structure and the nature of the interaction.

Unfavorable Individuals in Social Gaming Networks

NASA Astrophysics Data System (ADS)

Zhang, Yichao; Chen, Guanrong; Guan, Jihong; Zhang, Zhongzhi; Zhou, Shuigeng

2015-12-01

In social gaming networks, the current research focus has been on the origin of widespread reciprocal behaviors when individuals play non-cooperative games. In this paper, we investigate the topological properties of unfavorable individuals in evolutionary games. The unfavorable individuals are defined as the individuals gaining the lowest average payoff in a round of game. Since the average payoff is normally considered as a measure of fitness, the unfavorable individuals are very likely to be eliminated or change their strategy updating rules from a Darwinian perspective. Considering that humans can hardly adopt a unified strategy to play with their neighbors, we propose a divide-and-conquer game model, where individuals can interact with their neighbors in the network with appropriate strategies. We test and compare a series of highly rational strategy updating rules. In the tested scenarios, our analytical and simulation results surprisingly reveal that the less-connected individuals in degree-heterogeneous networks are more likely to become the unfavorable individuals. Our finding suggests that the connectivity of individuals as a social capital fundamentally changes the gaming environment. Our model, therefore, provides a theoretical framework for further understanding the social gaming networks.

Evolutionary rewiring of bacterial regulatory networks

PubMed Central

Taylor, Tiffany B.; Mulley, Geraldine; McGuffin, Liam J.; Johnson, Louise J.; Brockhurst, Michael A.; Arseneault, Tanya; Silby, Mark W.; Jackson, Robert W.

2015-01-01

Bacteria have evolved complex regulatory networks that enable integration of multiple intracellular and extracellular signals to coordinate responses to environmental changes. However, our knowledge of how regulatory systems function and evolve is still relatively limited. There is often extensive homology between components of different networks, due to past cycles of gene duplication, divergence, and horizontal gene transfer, raising the possibility of cross-talk or redundancy. Consequently, evolutionary resilience is built into gene networks - homology between regulators can potentially allow rapid rescue of lost regulatory function across distant regions of the genome. In our recent study [Taylor, et al. Science (2015), 347(6225)] we find that mutations that facilitate cross-talk between pathways can contribute to gene network evolution, but that such mutations come with severe pleiotropic costs. Arising from this work are a number of questions surrounding how this phenomenon occurs. PMID:28357301

Neutral evolution of mutational robustness

PubMed Central

van Nimwegen, Erik; Crutchfield, James P.; Huynen, Martijn

1999-01-01

We introduce and analyze a general model of a population evolving over a network of selectively neutral genotypes. We show that the population’s limit distribution on the neutral network is solely determined by the network topology and given by the principal eigenvector of the network’s adjacency matrix. Moreover, the average number of neutral mutant neighbors per individual is given by the matrix spectral radius. These results quantify the extent to which populations evolve mutational robustness—the insensitivity of the phenotype to mutations—and thus reduce genetic load. Because the average neutrality is independent of evolutionary parameters—such as mutation rate, population size, and selective advantage—one can infer global statistics of neutral network topology by using simple population data available from in vitro or in vivo evolution. Populations evolving on neutral networks of RNA secondary structures show excellent agreement with our theoretical predictions. PMID:10449760

The topological requirements for robust perfect adaptation in networks of any size.

PubMed

Araujo, Robyn P; Liotta, Lance A

2018-05-01

Robustness, and the ability to function and thrive amid changing and unfavorable environments, is a fundamental requirement for living systems. Until now it has been an open question how large and complex biological networks can exhibit robust behaviors, such as perfect adaptation to a variable stimulus, since complexity is generally associated with fragility. Here we report that all networks that exhibit robust perfect adaptation (RPA) to a persistent change in stimulus are decomposable into well-defined modules, of which there exist two distinct classes. These two modular classes represent a topological basis for all RPA-capable networks, and generate the full set of topological realizations of the internal model principle for RPA in complex, self-organizing, evolvable bionetworks. This unexpected result supports the notion that evolutionary processes are empowered by simple and scalable modular design principles that promote robust performance no matter how large or complex the underlying networks become.

Spontaneous Symmetry Breaking in Interdependent Networked Game

PubMed Central

Jin, Qing; Wang, Lin; Xia, Cheng-Yi; Wang, Zhen

2014-01-01

Spatial evolution game has traditionally assumed that players interact with direct neighbors on a single network, which is isolated and not influenced by other systems. However, this is not fully consistent with recent research identification that interactions between networks play a crucial rule for the outcome of evolutionary games taking place on them. In this work, we introduce the simple game model into the interdependent networks composed of two networks. By means of imitation dynamics, we display that when the interdependent factor α is smaller than a threshold value αC, the symmetry of cooperation can be guaranteed. Interestingly, as interdependent factor exceeds αC, spontaneous symmetry breaking of fraction of cooperators presents itself between different networks. With respect to the breakage of symmetry, it is induced by asynchronous expansion between heterogeneous strategy couples of both networks, which further enriches the content of spatial reciprocity. Moreover, our results can be well predicted by the strategy-couple pair approximation method. PMID:24526076

Evolving phenotypic networks in silico.

PubMed

François, Paul

2014-11-01

Evolved gene networks are constrained by natural selection. Their structures and functions are consequently far from being random, as exemplified by the multiple instances of parallel/convergent evolution. One can thus ask if features of actual gene networks can be recovered from evolutionary first principles. I review a method for in silico evolution of small models of gene networks aiming at performing predefined biological functions. I summarize the current implementation of the algorithm, insisting on the construction of a proper "fitness" function. I illustrate the approach on three examples: biochemical adaptation, ligand discrimination and vertebrate segmentation (somitogenesis). While the structure of the evolved networks is variable, dynamics of our evolved networks are usually constrained and present many similar features to actual gene networks, including properties that were not explicitly selected for. In silico evolution can thus be used to predict biological behaviours without a detailed knowledge of the mapping between genotype and phenotype. Copyright © 2014 The Author. Published by Elsevier Ltd.. All rights reserved.

Looking for the optimal rate of recombination for evolutionary dynamics

NASA Astrophysics Data System (ADS)

Saakian, David B.

2018-01-01

We consider many-site mutation-recombination models of evolution with selection. We are looking for situations where the recombination increases the mean fitness of the population, and there is an optimal recombination rate. We found two fitness landscapes supporting such nonmonotonic behavior of the mean fitness versus the recombination rate. The first case is related to the evolution near the error threshold on a neutral-network-like fitness landscape, for moderate genome lengths and large population. The more realistic case is the second one, in which we consider the evolutionary dynamics of a finite population on a rugged fitness landscape (the smooth fitness landscape plus some random contributions to the fitness). We also give the solution to the horizontal gene transfer model in the case of asymmetric mutations. To obtain nonmonotonic behavior for both mutation and recombination, we need a specially designed (ideal) fitness landscape.

Design of robust flow processing networks with time-programmed responses

NASA Astrophysics Data System (ADS)

Kaluza, P.; Mikhailov, A. S.

2012-04-01

Can artificially designed networks reach the levels of robustness against local damage which are comparable with those of the biochemical networks of a living cell? We consider a simple model where the flow applied to an input node propagates through the network and arrives at different times to the output nodes, thus generating a pattern of coordinated responses. By using evolutionary optimization algorithms, functional networks - with required time-programmed responses - were constructed. Then, continuing the evolution, such networks were additionally optimized for robustness against deletion of individual nodes or links. In this manner, large ensembles of functional networks with different kinds of robustness were obtained, making statistical investigations and comparison of their structural properties possible. We have found that, generally, different architectures are needed for various kinds of robustness. The differences are statistically revealed, for example, in the Laplacian spectra of the respective graphs. On the other hand, motif distributions of robust networks do not differ from those of the merely functional networks; they are found to belong to the first Alon superfamily, the same as that of the gene transcription networks of single-cell organisms.

MOCASSIN-prot: A multi-objective clustering approach for protein similarity networks

USDA-ARS?s Scientific Manuscript database

Motivation: Proteins often include multiple conserved domains. Various evolutionary events including duplication and loss of domains, domain shuffling, as well as sequence divergence contribute to generating complexities in protein structures, and consequently, in their functions. The evolutionary h...

Strategy evolution driven by switching probabilities in structured multi-agent systems

NASA Astrophysics Data System (ADS)

Zhang, Jianlei; Chen, Zengqiang; Li, Zhiqi

2017-10-01

Evolutionary mechanism driving the commonly seen cooperation among unrelated individuals is puzzling. Related models for evolutionary games on graphs traditionally assume that players imitate their successful neighbours with higher benefits. Notably, an implicit assumption here is that players are always able to acquire the required pay-off information. To relax this restrictive assumption, a contact-based model has been proposed, where switching probabilities between strategies drive the strategy evolution. However, the explicit and quantified relation between a player's switching probability for her strategies and the number of her neighbours remains unknown. This is especially a key point in heterogeneously structured system, where players may differ in the numbers of their neighbours. Focusing on this, here we present an augmented model by introducing an attenuation coefficient and evaluate its influence on the evolution dynamics. Results show that the individual influence on others is negatively correlated with the contact numbers specified by the network topologies. Results further provide the conditions under which the coexisting strategies can be calculated analytically.

Forecasting Caspian Sea level changes using satellite altimetry data (June 1992-December 2013) based on evolutionary support vector regression algorithms and gene expression programming

NASA Astrophysics Data System (ADS)

Imani, Moslem; You, Rey-Jer; Kuo, Chung-Yen

2014-10-01

Sea level forecasting at various time intervals is of great importance in water supply management. Evolutionary artificial intelligence (AI) approaches have been accepted as an appropriate tool for modeling complex nonlinear phenomena in water bodies. In the study, we investigated the ability of two AI techniques: support vector machine (SVM), which is mathematically well-founded and provides new insights into function approximation, and gene expression programming (GEP), which is used to forecast Caspian Sea level anomalies using satellite altimetry observations from June 1992 to December 2013. SVM demonstrates the best performance in predicting Caspian Sea level anomalies, given the minimum root mean square error (RMSE = 0.035) and maximum coefficient of determination (R2 = 0.96) during the prediction periods. A comparison between the proposed AI approaches and the cascade correlation neural network (CCNN) model also shows the superiority of the GEP and SVM models over the CCNN.

Using a two-phase evolutionary framework to select multiple network spreaders based on community structure

NASA Astrophysics Data System (ADS)

Fu, Yu-Hsiang; Huang, Chung-Yuan; Sun, Chuen-Tsai

2016-11-01

Using network community structures to identify multiple influential spreaders is an appropriate method for analyzing the dissemination of information, ideas and infectious diseases. For example, data on spreaders selected from groups of customers who make similar purchases may be used to advertise products and to optimize limited resource allocation. Other examples include community detection approaches aimed at identifying structures and groups in social or complex networks. However, determining the number of communities in a network remains a challenge. In this paper we describe our proposal for a two-phase evolutionary framework (TPEF) for determining community numbers and maximizing community modularity. Lancichinetti-Fortunato-Radicchi benchmark networks were used to test our proposed method and to analyze execution time, community structure quality, convergence, and the network spreading effect. Results indicate that our proposed TPEF generates satisfactory levels of community quality and convergence. They also suggest a need for an index, mechanism or sampling technique to determine whether a community detection approach should be used for selecting multiple network spreaders.

Evolutionary Approach of Virtual Communities of Practice: A Reflection within a Network of Spanish Rural Schools

NASA Astrophysics Data System (ADS)

Frossard, Frédérique; Trifonova, Anna; Barajas Frutos, Mario

The isolation of rural communities creates special necessities for teachers and students in rural schools. The present article describes "Rural Virtual School", a Virtual Community of Practice (VCoP) in which Spanish teachers of rural schools share learning resources and teaching methodologies through social software applications. The article arrives to an evolutionary model, in which the use of the social software tools evolves together with the needs and the activities of the VCoP through the different stages of its lifetime. Currently, the community has reached a high level of maturity and, in order to keep its momentum, the members intentionally use appropriate technologies specially designed to enhance rich innovative educational approaches, through which they collaboratively generate creative practices.

Evolutionary transitions in controls reconcile adaptation with continuity of evolution.

PubMed

Badyaev, Alexander V

2018-05-19

Evolution proceeds by accumulating functional solutions, necessarily forming an uninterrupted lineage from past solutions of ancestors to the current design of extant forms. At the population level, this process requires an organismal architecture in which the maintenance of local adaptation does not preclude the ability to innovate in the same traits and their continuous evolution. Representing complex traits as networks enables us to visualize a fundamental principle that resolves tension between adaptation and continuous evolution: phenotypic states encompassing adaptations traverse the continuous multi-layered landscape of past physical, developmental and functional associations among traits. The key concept that captures such traversing is network controllability - the ability to move a network from one state into another while maintaining its functionality (reflecting evolvability) and to efficiently propagate information or products through the network within a phenotypic state (maintaining its robustness). Here I suggest that transitions in network controllability - specifically in the topology of controls - help to explain how robustness and evolvability are balanced during evolution. I will focus on evolutionary transitions in degeneracy of metabolic networks - a ubiquitous property of phenotypic robustness where distinct pathways achieve the same end product - to suggest that associated changes in network controls is a common rule underlying phenomena as distinct as phenotypic plasticity, organismal accommodation of novelties, genetic assimilation, and macroevolutionary diversification. Capitalizing on well understood principles by which network structure translates into function of control nodes, I show that accumulating redundancy in one type of network controls inevitably leads to the emergence of another type of controls, forming evolutionary cycles of network controllability that, ultimately, reconcile local adaptation with continuity of evolution. Copyright © 2018 Elsevier Ltd. All rights reserved.

Functional Inference of Complex Anatomical Tendinous Networks at a Macroscopic Scale via Sparse Experimentation

PubMed Central

Saxena, Anupam; Lipson, Hod; Valero-Cuevas, Francisco J.

2012-01-01

In systems and computational biology, much effort is devoted to functional identification of systems and networks at the molecular-or cellular scale. However, similarly important networks exist at anatomical scales such as the tendon network of human fingers: the complex array of collagen fibers that transmits and distributes muscle forces to finger joints. This network is critical to the versatility of the human hand, and its function has been debated since at least the 16th century. Here, we experimentally infer the structure (both topology and parameter values) of this network through sparse interrogation with force inputs. A population of models representing this structure co-evolves in simulation with a population of informative future force inputs via the predator-prey estimation-exploration algorithm. Model fitness depends on their ability to explain experimental data, while the fitness of future force inputs depends on causing maximal functional discrepancy among current models. We validate our approach by inferring two known synthetic Latex networks, and one anatomical tendon network harvested from a cadaver's middle finger. We find that functionally similar but structurally diverse models can exist within a narrow range of the training set and cross-validation errors. For the Latex networks, models with low training set error [<4%] and resembling the known network have the smallest cross-validation errors [∼5%]. The low training set [<4%] and cross validation [<7.2%] errors for models for the cadaveric specimen demonstrate what, to our knowledge, is the first experimental inference of the functional structure of complex anatomical networks. This work expands current bioinformatics inference approaches by demonstrating that sparse, yet informative interrogation of biological specimens holds significant computational advantages in accurate and efficient inference over random testing, or assuming model topology and only inferring parameters values. These findings also hold clues to both our evolutionary history and the development of versatile machines. PMID:23144601

A toolbox model of evolution of metabolic pathways on networks of arbitrary topology.

PubMed

Pang, Tin Yau; Maslov, Sergei

2011-05-01

In prokaryotic genomes the number of transcriptional regulators is known to be proportional to the square of the total number of protein-coding genes. A toolbox model of evolution was recently proposed to explain this empirical scaling for metabolic enzymes and their regulators. According to its rules, the metabolic network of an organism evolves by horizontal transfer of pathways from other species. These pathways are part of a larger "universal" network formed by the union of all species-specific networks. It remained to be understood, however, how the topological properties of this universal network influence the scaling law of functional content of genomes in the toolbox model. Here we answer this question by first analyzing the scaling properties of the toolbox model on arbitrary tree-like universal networks. We prove that critical branching topology, in which the average number of upstream neighbors of a node is equal to one, is both necessary and sufficient for quadratic scaling. We further generalize the rules of the model to incorporate reactions with multiple substrates/products as well as branched and cyclic metabolic pathways. To achieve its metabolic tasks, the new model employs evolutionary optimized pathways with minimal number of reactions. Numerical simulations of this realistic model on the universal network of all reactions in the KEGG database produced approximately quadratic scaling between the number of regulated pathways and the size of the metabolic network. To quantify the geometrical structure of individual pathways, we investigated the relationship between their number of reactions, byproducts, intermediate, and feedback metabolites. Our results validate and explain the ubiquitous appearance of the quadratic scaling for a broad spectrum of topologies of underlying universal metabolic networks. They also demonstrate why, in spite of "small-world" topology, real-life metabolic networks are characterized by a broad distribution of pathway lengths and sizes of metabolic regulons in regulatory networks.

Functional inference of complex anatomical tendinous networks at a macroscopic scale via sparse experimentation.

PubMed

Saxena, Anupam; Lipson, Hod; Valero-Cuevas, Francisco J

2012-01-01

In systems and computational biology, much effort is devoted to functional identification of systems and networks at the molecular-or cellular scale. However, similarly important networks exist at anatomical scales such as the tendon network of human fingers: the complex array of collagen fibers that transmits and distributes muscle forces to finger joints. This network is critical to the versatility of the human hand, and its function has been debated since at least the 16(th) century. Here, we experimentally infer the structure (both topology and parameter values) of this network through sparse interrogation with force inputs. A population of models representing this structure co-evolves in simulation with a population of informative future force inputs via the predator-prey estimation-exploration algorithm. Model fitness depends on their ability to explain experimental data, while the fitness of future force inputs depends on causing maximal functional discrepancy among current models. We validate our approach by inferring two known synthetic Latex networks, and one anatomical tendon network harvested from a cadaver's middle finger. We find that functionally similar but structurally diverse models can exist within a narrow range of the training set and cross-validation errors. For the Latex networks, models with low training set error [<4%] and resembling the known network have the smallest cross-validation errors [∼5%]. The low training set [<4%] and cross validation [<7.2%] errors for models for the cadaveric specimen demonstrate what, to our knowledge, is the first experimental inference of the functional structure of complex anatomical networks. This work expands current bioinformatics inference approaches by demonstrating that sparse, yet informative interrogation of biological specimens holds significant computational advantages in accurate and efficient inference over random testing, or assuming model topology and only inferring parameters values. These findings also hold clues to both our evolutionary history and the development of versatile machines.

Classification and Lineage Tracing of SH2 Domains Throughout Eukaryotes.

PubMed

Liu, Bernard A

2017-01-01

Today there exists a rapidly expanding number of sequenced genomes. Cataloging protein interaction domains such as the Src Homology 2 (SH2) domain across these various genomes can be accomplished with ease due to existing algorithms and predictions models. An evolutionary analysis of SH2 domains provides a step towards understanding how SH2 proteins integrated with existing signaling networks to position phosphotyrosine signaling as a crucial driver of robust cellular communication networks in metazoans. However organizing and tracing SH2 domain across organisms and understanding their evolutionary trajectory remains a challenge. This chapter describes several methodologies towards analyzing the evolutionary trajectory of SH2 domains including a global SH2 domain classification system, which facilitates annotation of new SH2 sequences essential for tracing the lineage of SH2 domains throughout eukaryote evolution. This classification utilizes a combination of sequence homology, protein domain architecture and the boundary positions between introns and exons within the SH2 domain or genes encoding these domains. Discrete SH2 families can then be traced across various genomes to provide insight into its origins. Furthermore, additional methods for examining potential mechanisms for divergence of SH2 domains from structural changes to alterations in the protein domain content and genome duplication will be discussed. Therefore a better understanding of SH2 domain evolution may enhance our insight into the emergence of phosphotyrosine signaling and the expansion of protein interaction domains.

Assessing Advanced Technology in CENATE

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tallent, Nathan R.; Barker, Kevin J.; Gioiosa, Roberto

PNNL's Center for Advanced Technology Evaluation (CENATE) is a new U.S. Department of Energy center whose mission is to assess and facilitate access to emerging computing technology. CENATE is assessing a range of advanced technologies, from evolutionary to disruptive. Technologies of interest include the processor socket (homogeneous and accelerated systems), memories (dynamic, static, memory cubes), motherboards, networks (network interface cards and switches), and input/output and storage devices. CENATE is developing a multi-perspective evaluation process based on integrating advanced system instrumentation, performance measurements, and modeling and simulation. We show evaluations of two emerging network technologies: silicon photonics interconnects and the Datamore » Vortex network. CENATE's evaluation also addresses the question of which machine is best for a given workload under certain constraints. We show a performance-power tradeoff analysis of a well-known machine learning application on two systems.« less

Network dynamics of eukaryotic LTR retroelements beyond phylogenetic trees

PubMed Central

Llorens, Carlos; Muñoz-Pomer, Alfonso; Bernad, Lucia; Botella, Hector; Moya, Andrés

2009-01-01

Background Sequencing projects have allowed diverse retroviruses and LTR retrotransposons from different eukaryotic organisms to be characterized. It is known that retroviruses and other retro-transcribing viruses evolve from LTR retrotransposons and that this whole system clusters into five families: Ty3/Gypsy, Retroviridae, Ty1/Copia, Bel/Pao and Caulimoviridae. Phylogenetic analyses usually show that these split into multiple distinct lineages but what is yet to be understood is how deep evolution occurred in this system. Results We combined phylogenetic and graph analyses to investigate the history of LTR retroelements both as a tree and as a network. We used 268 non-redundant LTR retroelements, many of them introduced for the first time in this work, to elucidate all possible LTR retroelement phylogenetic patterns. These were superimposed over the tree of eukaryotes to investigate the dynamics of the system, at distinct evolutionary times. Next, we investigated phenotypic features such as duplication and variability of amino acid motifs, and several differences in genomic ORF organization. Using this information we characterized eight reticulate evolution markers to construct phenotypic network models. Conclusion The evolutionary history of LTR retroelements can be traced as a time-evolving network that depends on phylogenetic patterns, epigenetic host-factors and phenotypic plasticity. The Ty1/Copia and the Ty3/Gypsy families represent the oldest patterns in this network that we found mimics eukaryotic macroevolution. The emergence of the Bel/Pao, Retroviridae and Caulimoviridae families in this network can be related with distinct inflations of the Ty3/Gypsy family, at distinct evolutionary times. This suggests that Ty3/Gypsy ancestors diversified much more than their Ty1/Copia counterparts, at distinct geological eras. Consistent with the principle of preferential attachment, the connectivities among phenotypic markers, taken as network-represented combinations, are power-law distributed. This evidences an inflationary mode of evolution where the system diversity; 1) expands continuously alternating vertical and gradual processes of phylogenetic divergence with episodes of modular, saltatory and reticulate evolution; 2) is governed by the intrinsic capability of distinct LTR retroelement host-communities to self-organize their phenotypes according to emergent laws characteristic of complex systems. Reviewers This article was reviewed by Eugene V. Koonin, Eric Bapteste, and Enmanuelle Lerat (nominated by King Jordan) PMID:19883502

Upon accounting for the impact of isoenzyme loss, gene deletion costs anticorrelate with their evolutionary rates

DOE PAGES

Jacobs, Christopher; Lambourne, Luke; Xia, Yu; ...

2017-01-20

Here, system-level metabolic network models enable the computation of growth and metabolic phenotypes from an organism's genome. In particular, flux balance approaches have been used to estimate the contribution of individual metabolic genes to organismal fitness, offering the opportunity to test whether such contributions carry information about the evolutionary pressure on the corresponding genes. Previous failure to identify the expected negative correlation between such computed gene-loss cost and sequence-derived evolutionary rates in Saccharomyces cerevisiae has been ascribed to a real biological gap between a gene's fitness contribution to an organism "here and now"º and the same gene's historical importance asmore » evidenced by its accumulated mutations over millions of years of evolution. Here we show that this negative correlation does exist, and can be exposed by revisiting a broadly employed assumption of flux balance models. In particular, we introduce a new metric that we call "function-loss cost", which estimates the cost of a gene loss event as the total potential functional impairment caused by that loss. This new metric displays significant negative correlation with evolutionary rate, across several thousand minimal environments. We demonstrate that the improvement gained using function-loss cost over gene-loss cost is explained by replacing the base assumption that isoenzymes provide unlimited capacity for backup with the assumption that isoenzymes are completely non-redundant. We further show that this change of the assumption regarding isoenzymes increases the recall of epistatic interactions predicted by the flux balance model at the cost of a reduction in the precision of the predictions. In addition to suggesting that the gene-to-reaction mapping in genome-scale flux balance models should be used with caution, our analysis provides new evidence that evolutionary gene importance captures much more than strict essentiality.« less

Upon accounting for the impact of isoenzyme loss, gene deletion costs anticorrelate with their evolutionary rates

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jacobs, Christopher; Lambourne, Luke; Xia, Yu

Here, system-level metabolic network models enable the computation of growth and metabolic phenotypes from an organism's genome. In particular, flux balance approaches have been used to estimate the contribution of individual metabolic genes to organismal fitness, offering the opportunity to test whether such contributions carry information about the evolutionary pressure on the corresponding genes. Previous failure to identify the expected negative correlation between such computed gene-loss cost and sequence-derived evolutionary rates in Saccharomyces cerevisiae has been ascribed to a real biological gap between a gene's fitness contribution to an organism "here and now"º and the same gene's historical importance asmore » evidenced by its accumulated mutations over millions of years of evolution. Here we show that this negative correlation does exist, and can be exposed by revisiting a broadly employed assumption of flux balance models. In particular, we introduce a new metric that we call "function-loss cost", which estimates the cost of a gene loss event as the total potential functional impairment caused by that loss. This new metric displays significant negative correlation with evolutionary rate, across several thousand minimal environments. We demonstrate that the improvement gained using function-loss cost over gene-loss cost is explained by replacing the base assumption that isoenzymes provide unlimited capacity for backup with the assumption that isoenzymes are completely non-redundant. We further show that this change of the assumption regarding isoenzymes increases the recall of epistatic interactions predicted by the flux balance model at the cost of a reduction in the precision of the predictions. In addition to suggesting that the gene-to-reaction mapping in genome-scale flux balance models should be used with caution, our analysis provides new evidence that evolutionary gene importance captures much more than strict essentiality.« less

Evolutionary Ensemble for In Silico Prediction of Ames Test Mutagenicity

NASA Astrophysics Data System (ADS)

Chen, Huanhuan; Yao, Xin

Driven by new regulations and animal welfare, the need to develop in silico models has increased recently as alternative approaches to safety assessment of chemicals without animal testing. This paper describes a novel machine learning ensemble approach to building an in silico model for the prediction of the Ames test mutagenicity, one of a battery of the most commonly used experimental in vitro and in vivo genotoxicity tests for safety evaluation of chemicals. Evolutionary random neural ensemble with negative correlation learning (ERNE) [1] was developed based on neural networks and evolutionary algorithms. ERNE combines the method of bootstrap sampling on training data with the method of random subspace feature selection to ensure diversity in creating individuals within an initial ensemble. Furthermore, while evolving individuals within the ensemble, it makes use of the negative correlation learning, enabling individual NNs to be trained as accurate as possible while still manage to maintain them as diverse as possible. Therefore, the resulting individuals in the final ensemble are capable of cooperating collectively to achieve better generalization of prediction. The empirical experiment suggest that ERNE is an effective ensemble approach for predicting the Ames test mutagenicity of chemicals.

Connecting a Connectome to Behavior: An Ensemble of Neuroanatomical Models of C. elegans Klinotaxis

PubMed Central

Izquierdo, Eduardo J.; Beer, Randall D.

2013-01-01

Increased efforts in the assembly and analysis of connectome data are providing new insights into the principles underlying the connectivity of neural circuits. However, despite these considerable advances in connectomics, neuroanatomical data must be integrated with neurophysiological and behavioral data in order to obtain a complete picture of neural function. Due to its nearly complete wiring diagram and large behavioral repertoire, the nematode worm Caenorhaditis elegans is an ideal organism in which to explore in detail this link between neural connectivity and behavior. In this paper, we develop a neuroanatomically-grounded model of salt klinotaxis, a form of chemotaxis in which changes in orientation are directed towards the source through gradual continual adjustments. We identify a minimal klinotaxis circuit by systematically searching the C. elegans connectome for pathways linking chemosensory neurons to neck motor neurons, and prune the resulting network based on both experimental considerations and several simplifying assumptions. We then use an evolutionary algorithm to find possible values for the unknown electrophsyiological parameters in the network such that the behavioral performance of the entire model is optimized to match that of the animal. Multiple runs of the evolutionary algorithm produce an ensemble of such models. We analyze in some detail the mechanisms by which one of the best evolved circuits operates and characterize the similarities and differences between this mechanism and other solutions in the ensemble. Finally, we propose a series of experiments to determine which of these alternatives the worm may be using. PMID:23408877

Reverse-engineering the Arabidopsis thaliana transcriptional network under changing environmental conditions

PubMed Central

Carrera, Javier; Rodrigo, Guillermo; Jaramillo, Alfonso; Elena, Santiago F

2009-01-01

Background Understanding the molecular mechanisms plants have evolved to adapt their biological activities to a constantly changing environment is an intriguing question and one that requires a systems biology approach. Here we present a network analysis of genome-wide expression data combined with reverse-engineering network modeling to dissect the transcriptional control of Arabidopsis thaliana. The regulatory network is inferred by using an assembly of microarray data containing steady-state RNA expression levels from several growth conditions, developmental stages, biotic and abiotic stresses, and a variety of mutant genotypes. Results We show that the A. thaliana regulatory network has the characteristic properties of hierarchical networks. We successfully applied our quantitative network model to predict the full transcriptome of the plant for a set of microarray experiments not included in the training dataset. We also used our model to analyze the robustness in expression levels conferred by network motifs such as the coherent feed-forward loop. In addition, the meta-analysis presented here has allowed us to identify regulatory and robust genetic structures. Conclusions These data suggest that A. thaliana has evolved high connectivity in terms of transcriptional regulation among cellular functions involved in response and adaptation to changing environments, while gene networks constitutively expressed or less related to stress response are characterized by a lower connectivity. Taken together, these findings suggest conserved regulatory strategies that have been selected during the evolutionary history of this eukaryote. PMID:19754933

Evolutionary-Optimized Photonic Network Structure in White Beetle Wing Scales.

PubMed

Wilts, Bodo D; Sheng, Xiaoyuan; Holler, Mirko; Diaz, Ana; Guizar-Sicairos, Manuel; Raabe, Jörg; Hoppe, Robert; Liu, Shu-Hao; Langford, Richard; Onelli, Olimpia D; Chen, Duyu; Torquato, Salvatore; Steiner, Ullrich; Schroer, Christian G; Vignolini, Silvia; Sepe, Alessandro

2018-05-01

Most studies of structural color in nature concern periodic arrays, which through the interference of light create color. The "color" white however relies on the multiple scattering of light within a randomly structured medium, which randomizes the direction and phase of incident light. Opaque white materials therefore must be much thicker than periodic structures. It is known that flying insects create "white" in extremely thin layers. This raises the question, whether evolution has optimized the wing scale morphology for white reflection at a minimum material use. This hypothesis is difficult to prove, since this requires the detailed knowledge of the scattering morphology combined with a suitable theoretical model. Here, a cryoptychographic X-ray tomography method is employed to obtain a full 3D structural dataset of the network morphology within a white beetle wing scale. By digitally manipulating this 3D representation, this study demonstrates that this morphology indeed provides the highest white retroreflection at the minimum use of material, and hence weight for the organism. Changing any of the network parameters (within the parameter space accessible by biological materials) either increases the weight, increases the thickness, or reduces reflectivity, providing clear evidence for the evolutionary optimization of this morphology. © 2017 The Authors. Published by WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Receptors rather than signals change in expression in four physiological regulatory networks during evolutionary divergence in threespine stickleback.

PubMed

Di Poi, Carole; Bélanger, Dominic; Amyot, Marc; Rogers, Sean; Aubin-Horth, Nadia

2016-07-01

The molecular mechanisms underlying behavioural evolution following colonization of novel environments are largely unknown. Molecules that interact to control equilibrium within an organism form physiological regulatory networks. It is essential to determine whether particular components of physiological regulatory networks evolve or if the network as a whole is affected in populations diverging in behavioural responses, as this may affect the nature, amplitude and number of impacted traits. We studied the regulation of four physiological regulatory networks in freshwater and marine populations of threespine stickleback raised in a common environment, which were previously characterized as showing evolutionary divergence in behaviour and stress reactivity. We measured nineteen components of these networks (ligands and receptors) using mRNA and monoamine levels in the brain, pituitary and interrenal gland, as well as hormone levels. Freshwater fish showed higher expression in the brain of adrenergic (adrb2a), serotonergic (htr2a) and dopaminergic (DRD2) receptors, but lower expression of the htr2b receptor. Freshwater fish also showed higher expression of the mc2r receptor of the glucocorticoid axis in the interrenals. Collectively, our results suggest that the inheritance of the regulation of these networks may be implicated in the evolution of behaviour and stress reactivity in association with population divergence. Our results also suggest that evolutionary change in freshwater threespine stickleback may be more associated with the expression of specific receptors rather than with global changes of all the measured constituents of the physiological regulatory networks. © 2016 John Wiley & Sons Ltd.

Evolutionary Models for Simple Biosystems

NASA Astrophysics Data System (ADS)

Bagnoli, Franco

The concept of evolutionary development of structures constituted a real revolution in biology: it was possible to understand how the very complex structures of life can arise in an out-of-equilibrium system. The investigation of such systems has shown that indeed, systems under a flux of energy or matter can self-organize into complex patterns, think for instance to Rayleigh-Bernard convection, Liesegang rings, patterns formed by granular systems under shear. Following this line, one could characterize life as a state of matter, characterized by the slow, continuous process that we call evolution. In this paper we try to identify the organizational level of life, that spans several orders of magnitude from the elementary constituents to whole ecosystems. Although similar structures can be found in other contexts like ideas (memes) in neural systems and self-replicating elements (computer viruses, worms, etc.) in computer systems, we shall concentrate on biological evolutionary structure, and try to put into evidence the role and the emergence of network structure in such systems.

Bridging the physical scales in evolutionary biology: From protein sequence space to fitness of organisms and populations

PubMed Central

Bershtein, Shimon; Serohijos, Adrian W.R.; Shakhnovich, Eugene I.

2016-01-01

Bridging the gap between the molecular properties of proteins and organismal/population fitness is essential for understanding evolutionary processes. This task requires the integration of the several physical scales of biological organization, each defined by a distinct set of mechanisms and constraints, into a single unifying model. The molecular scale is dominated by the constraints imposed by the physico-chemical properties of proteins and their substrates, which give rise to trade-offs and epistatic (non-additive) effects of mutations. At the systems scale, biological networks modulate protein expression and can either buffer or enhance the fitness effects of mutations. The population scale is influenced by the mutational input, selection regimes, and stochastic changes affecting the size and structure of populations, which eventually determine the evolutionary fate of mutations. Here, we summarize the recent advances in theory, computer simulations, and experiments that advance our understanding of the links between various physical scales in biology. PMID:27810574

Bridging the physical scales in evolutionary biology: from protein sequence space to fitness of organisms and populations.

PubMed

Bershtein, Shimon; Serohijos, Adrian Wr; Shakhnovich, Eugene I

2017-02-01

Bridging the gap between the molecular properties of proteins and organismal/population fitness is essential for understanding evolutionary processes. This task requires the integration of the several physical scales of biological organization, each defined by a distinct set of mechanisms and constraints, into a single unifying model. The molecular scale is dominated by the constraints imposed by the physico-chemical properties of proteins and their substrates, which give rise to trade-offs and epistatic (non-additive) effects of mutations. At the systems scale, biological networks modulate protein expression and can either buffer or enhance the fitness effects of mutations. The population scale is influenced by the mutational input, selection regimes, and stochastic changes affecting the size and structure of populations, which eventually determine the evolutionary fate of mutations. Here, we summarize the recent advances in theory, computer simulations, and experiments that advance our understanding of the links between various physical scales in biology. Copyright © 2016 Elsevier Ltd. All rights reserved.

Modeling Misbehavior in Cooperative Diversity: A Dynamic Game Approach

NASA Astrophysics Data System (ADS)

Dehnie, Sintayehu; Memon, Nasir

2009-12-01

Cooperative diversity protocols are designed with the assumption that terminals always help each other in a socially efficient manner. This assumption may not be valid in commercial wireless networks where terminals may misbehave for selfish or malicious intentions. The presence of misbehaving terminals creates a social-dilemma where terminals exhibit uncertainty about the cooperative behavior of other terminals in the network. Cooperation in social-dilemma is characterized by a suboptimal Nash equilibrium where wireless terminals opt out of cooperation. Hence, without establishing a mechanism to detect and mitigate effects of misbehavior, it is difficult to maintain a socially optimal cooperation. In this paper, we first examine effects of misbehavior assuming static game model and show that cooperation under existing cooperative protocols is characterized by a noncooperative Nash equilibrium. Using evolutionary game dynamics we show that a small number of mutants can successfully invade a population of cooperators, which indicates that misbehavior is an evolutionary stable strategy (ESS). Our main goal is to design a mechanism that would enable wireless terminals to select reliable partners in the presence of uncertainty. To this end, we formulate cooperative diversity as a dynamic game with incomplete information. We show that the proposed dynamic game formulation satisfied the conditions for the existence of perfect Bayesian equilibrium.

Evolutionary optimization of radial basis function classifiers for data mining applications.

PubMed

Buchtala, Oliver; Klimek, Manuel; Sick, Bernhard

2005-10-01

In many data mining applications that address classification problems, feature and model selection are considered as key tasks. That is, appropriate input features of the classifier must be selected from a given (and often large) set of possible features and structure parameters of the classifier must be adapted with respect to these features and a given data set. This paper describes an evolutionary algorithm (EA) that performs feature and model selection simultaneously for radial basis function (RBF) classifiers. In order to reduce the optimization effort, various techniques are integrated that accelerate and improve the EA significantly: hybrid training of RBF networks, lazy evaluation, consideration of soft constraints by means of penalty terms, and temperature-based adaptive control of the EA. The feasibility and the benefits of the approach are demonstrated by means of four data mining problems: intrusion detection in computer networks, biometric signature verification, customer acquisition with direct marketing methods, and optimization of chemical production processes. It is shown that, compared to earlier EA-based RBF optimization techniques, the runtime is reduced by up to 99% while error rates are lowered by up to 86%, depending on the application. The algorithm is independent of specific applications so that many ideas and solutions can be transferred to other classifier paradigms.

Evolving Spiking Neural Networks for Recognition of Aged Voices.

PubMed

Silva, Marco; Vellasco, Marley M B R; Cataldo, Edson

2017-01-01

The aging of the voice, known as presbyphonia, is a natural process that can cause great change in vocal quality of the individual. This is a relevant problem to those people who use their voices professionally, and its early identification can help determine a suitable treatment to avoid its progress or even to eliminate the problem. This work focuses on the development of a new model for the identification of aging voices (independently of their chronological age), using as input attributes parameters extracted from the voice and glottal signals. The proposed model, named Quantum binary-real evolving Spiking Neural Network (QbrSNN), is based on spiking neural networks (SNNs), with an unsupervised training algorithm, and a Quantum-Inspired Evolutionary Algorithm that automatically determines the most relevant attributes and the optimal parameters that configure the SNN. The QbrSNN model was evaluated in a database composed of 120 records, containing samples from three groups of speakers. The results obtained indicate that the proposed model provides better accuracy than other approaches, with fewer input attributes. Copyright © 2017 The Voice Foundation. Published by Elsevier Inc. All rights reserved.

Probing Molecular Mechanisms of the Hsp90 Chaperone: Biophysical Modeling Identifies Key Regulators of Functional Dynamics

PubMed Central

Dixit, Anshuman; Verkhivker, Gennady M.

2012-01-01

Deciphering functional mechanisms of the Hsp90 chaperone machinery is an important objective in cancer biology aiming to facilitate discovery of targeted anti-cancer therapies. Despite significant advances in understanding structure and function of molecular chaperones, organizing molecular principles that control the relationship between conformational diversity and functional mechanisms of the Hsp90 activity lack a sufficient quantitative characterization. We combined molecular dynamics simulations, principal component analysis, the energy landscape model and structure-functional analysis of Hsp90 regulatory interactions to systematically investigate functional dynamics of the molecular chaperone. This approach has identified a network of conserved regions common to the Hsp90 chaperones that could play a universal role in coordinating functional dynamics, principal collective motions and allosteric signaling of Hsp90. We have found that these functional motifs may be utilized by the molecular chaperone machinery to act collectively as central regulators of Hsp90 dynamics and activity, including the inter-domain communications, control of ATP hydrolysis, and protein client binding. These findings have provided support to a long-standing assertion that allosteric regulation and catalysis may have emerged via common evolutionary routes. The interaction networks regulating functional motions of Hsp90 may be determined by the inherent structural architecture of the molecular chaperone. At the same time, the thermodynamics-based “conformational selection” of functional states is likely to be activated based on the nature of the binding partner. This mechanistic model of Hsp90 dynamics and function is consistent with the notion that allosteric networks orchestrating cooperative protein motions can be formed by evolutionary conserved and sparsely connected residue clusters. Hence, allosteric signaling through a small network of distantly connected residue clusters may be a rather general functional requirement encoded across molecular chaperones. The obtained insights may be useful in guiding discovery of allosteric Hsp90 inhibitors targeting protein interfaces with co-chaperones and protein binding clients. PMID:22624053

Transportation and dynamic networks: Models, theory, and applications to supply chains, electric power, and financial networks

NASA Astrophysics Data System (ADS)

Liu, Zugang

Network systems, including transportation and logistic systems, electric power generation and distribution networks as well as financial networks, provide the critical infrastructure for the functioning of our societies and economies. The understanding of the dynamic behavior of such systems is also crucial to national security and prosperity. The identification of new connections between distinct network systems is the inspiration for the research in this dissertation. In particular, I answer two questions raised by Beckmann, McGuire, and Winsten (1956) and Copeland (1952) over half a century ago, which are, respectively, how are electric power flows related to transportation flows and does money flow like water or electricity? In addition, in this dissertation, I achieve the following: (1) I establish the relationships between transportation networks and three other classes of complex network systems: supply chain networks, electric power generation and transmission networks, and financial networks with intermediation. The establishment of such connections provides novel theoretical insights as well as new pricing mechanisms, and efficient computational methods. (2) I develop new modeling frameworks based on evolutionary variational inequality theory that capture the dynamics of such network systems in terms of the time-varying flows and incurred costs, prices, and, where applicable, profits. This dissertation studies the dynamics of such network systems by addressing both internal competition and/or cooperation, and external changes, such as varying costs and demands. (3) I focus, in depth, on electric power supply chains. By exploiting the relationships between transportation networks and electric power supply chains, I develop a large-scale network model that integrates electric power supply chains and fuel supply markets. The model captures both the economic transactions as well as the physical transmission constraints. The model is then applied to the New England electric power supply chain consisting of 6 states, 5 fuel types, 82 power generators, with a total of 573 generating units, and 10 demand markets. The empirical case study demonstrates that the regional electricity prices simulated by the model match very well the actual electricity prices in New England. I also utilize the model to study interactions between electric power supply chains and energy fuel markets.

Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks

NASA Astrophysics Data System (ADS)

Wu, Zikai; Hou, Baoyu; Zhang, Hongjuan; Jin, Feng

2014-04-01

Deterministic network models have been attractive media for discussing dynamical processes' dependence on network structural features. On the other hand, the heterogeneity of weights affect dynamical processes taking place on networks. In this paper, we present a family of weighted expanded Koch networks based on Koch networks. They originate from a r-polygon, and each node of current generation produces m r-polygons including the node and whose weighted edges are scaled by factor w in subsequent evolutionary step. We derive closed-form expressions for average weighted shortest path length (AWSP). In large network, AWSP stays bounded with network order growing (0 < w < 1). Then, we focus on a special random walks and trapping issue on the networks. In more detail, we calculate exactly the average receiving time (ART). ART exhibits a sub-linear dependence on network order (0 < w < 1), which implies that nontrivial weighted expanded Koch networks are more efficient than un-weighted expanded Koch networks in receiving information. Besides, efficiency of receiving information at hub nodes is also dependent on parameters m and r. These findings may pave the way for controlling information transportation on general weighted networks.

Elucidation and short-term forecasting of microcystin concentrations in Lake Suwa (Japan) by means of artificial neural networks and evolutionary algorithms.

PubMed

Chan, Wai Sum; Recknagel, Friedrich; Cao, Hongqing; Park, Ho-Dong

2007-05-01

Non-supervised artificial neural networks (ANN) and hybrid evolutionary algorithms (EA) were applied to analyse and model 12 years of limnological time-series data of the shallow hypertrophic Lake Suwa in Japan. The results have improved understanding of relationships between changing microcystin concentrations, Microcystis species abundances and annual rainfall intensity. The data analysis by non-supervised ANN revealed that total Microcystis abundance and extra-cellular microcystin concentrations in typical dry years are much higher than those in typical wet years. It also showed that high microcystin concentrations in dry years coincided with the dominance of the toxic Microcystis viridis whilst in typical wet years non-toxic Microcystis ichthyoblabe were dominant. Hybrid EA were used to discover rule sets to explain and forecast the occurrence of high microcystin concentrations in relation to water quality and climate conditions. The results facilitated early warning by 3-days-ahead forecasting of microcystin concentrations based on limnological and meteorological input data, achieving an r(2)=0.74 for testing.

A mechanistic stress model of protein evolution accounts for site-specific evolutionary rates and their relationship with packing density and flexibility

PubMed Central

2014-01-01

Background Protein sites evolve at different rates due to functional and biophysical constraints. It is usually considered that the main structural determinant of a site’s rate of evolution is its Relative Solvent Accessibility (RSA). However, a recent comparative study has shown that the main structural determinant is the site’s Local Packing Density (LPD). LPD is related with dynamical flexibility, which has also been shown to correlate with sequence variability. Our purpose is to investigate the mechanism that connects a site’s LPD with its rate of evolution. Results We consider two models: an empirical Flexibility Model and a mechanistic Stress Model. The Flexibility Model postulates a linear increase of site-specific rate of evolution with dynamical flexibility. The Stress Model, introduced here, models mutations as random perturbations of the protein’s potential energy landscape, for which we use simple Elastic Network Models (ENMs). To account for natural selection we assume a single active conformation and use basic statistical physics to derive a linear relationship between site-specific evolutionary rates and the local stress of the mutant’s active conformation. We compare both models on a large and diverse dataset of enzymes. In a protein-by-protein study we found that the Stress Model outperforms the Flexibility Model for most proteins. Pooling all proteins together we show that the Stress Model is strongly supported by the total weight of evidence. Moreover, it accounts for the observed nonlinear dependence of sequence variability on flexibility. Finally, when mutational stress is controlled for, there is very little remaining correlation between sequence variability and dynamical flexibility. Conclusions We developed a mechanistic Stress Model of evolution according to which the rate of evolution of a site is predicted to depend linearly on the local mutational stress of the active conformation. Such local stress is proportional to LPD, so that this model explains the relationship between LPD and evolutionary rate. Moreover, the model also accounts for the nonlinear dependence between evolutionary rate and dynamical flexibility. PMID:24716445

Darwinian evolution in the light of genomics

PubMed Central

Koonin, Eugene V.

2009-01-01

Comparative genomics and systems biology offer unprecedented opportunities for testing central tenets of evolutionary biology formulated by Darwin in the Origin of Species in 1859 and expanded in the Modern Synthesis 100 years later. Evolutionary-genomic studies show that natural selection is only one of the forces that shape genome evolution and is not quantitatively dominant, whereas non-adaptive processes are much more prominent than previously suspected. Major contributions of horizontal gene transfer and diverse selfish genetic elements to genome evolution undermine the Tree of Life concept. An adequate depiction of evolution requires the more complex concept of a network or ‘forest’ of life. There is no consistent tendency of evolution towards increased genomic complexity, and when complexity increases, this appears to be a non-adaptive consequence of evolution under weak purifying selection rather than an adaptation. Several universals of genome evolution were discovered including the invariant distributions of evolutionary rates among orthologous genes from diverse genomes and of paralogous gene family sizes, and the negative correlation between gene expression level and sequence evolution rate. Simple, non-adaptive models of evolution explain some of these universals, suggesting that a new synthesis of evolutionary biology might become feasible in a not so remote future. PMID:19213802

Impact of deterministic and stochastic updates on network reciprocity in the prisoner's dilemma game

NASA Astrophysics Data System (ADS)

Tanimoto, Jun

2014-08-01

In 2 × 2 prisoner's dilemma games, network reciprocity is one mechanism for adding social viscosity, which leads to cooperative equilibrium. This study introduced an intriguing framework for the strategy update rule that allows any combination of a purely deterministic method, imitation max (IM), and a purely probabilistic one, pairwise Fermi (Fermi-PW). A series of simulations covering the whole range from IM to Fermi-PW reveals that, as a general tendency, the larger fractions of stochastic updating reduce network reciprocity, so long as the underlying lattice contains no noise in the degree of distribution. However, a small amount of stochastic flavor added to an otherwise perfectly deterministic update rule was actually found to enhance network reciprocity. This occurs because a subtle stochastic effect in the update rule improves the evolutionary trail in games having more stag-hunt-type dilemmas, although the same stochastic effect degenerates evolutionary trails in games having more chicken-type dilemmas. We explain these effects by dividing evolutionary trails into the enduring and expanding periods defined by Shigaki et al. [Phys. Rev. E 86, 031141 (2012), 10.1103/PhysRevE.86.031141].

Increasingly diverse brain dynamics in the developmental arc: using Pareto-optimization to infer a mechanism

NASA Astrophysics Data System (ADS)

Tang, Evelyn; Giusti, Chad; Baum, Graham; Gu, Shi; Pollock, Eli; Kahn, Ari; Roalf, David; Moore, Tyler; Ruparel, Kosha; Gur, Ruben; Gur, Raquel; Satterthwaite, Theodore; Bassett, Danielle

Motivated by a recent demonstration that the network architecture of white matter supports emerging control of diverse neural dynamics as children mature into adults, we seek to investigate structural mechanisms that support these changes. Beginning from a network representation of diffusion imaging data, we simulate network evolution with a set of simple growth rules built on principles of network control. Notably, the optimal evolutionary trajectory displays a striking correspondence to the progression of child to adult brain, suggesting that network control is a driver of development. More generally, and in comparison to the complete set of available models, we demonstrate that all brain networks from child to adult are structured in a manner highly optimized for the control of diverse neural dynamics. Within this near-optimality, we observe differences in the predicted control mechanisms of the child and adult brains, suggesting that the white matter architecture in children has a greater potential to increasingly support brain state transitions, potentially underlying cognitive switching.

Amino acid positions subject to multiple coevolutionary constraints can be robustly identified by their eigenvector network centrality scores.

PubMed

Parente, Daniel J; Ray, J Christian J; Swint-Kruse, Liskin

2015-12-01

As proteins evolve, amino acid positions key to protein structure or function are subject to mutational constraints. These positions can be detected by analyzing sequence families for amino acid conservation or for coevolution between pairs of positions. Coevolutionary scores are usually rank-ordered and thresholded to reveal the top pairwise scores, but they also can be treated as weighted networks. Here, we used network analyses to bypass a major complication of coevolution studies: For a given sequence alignment, alternative algorithms usually identify different, top pairwise scores. We reconciled results from five commonly-used, mathematically divergent algorithms (ELSC, McBASC, OMES, SCA, and ZNMI), using the LacI/GalR and 1,6-bisphosphate aldolase protein families as models. Calculations used unthresholded coevolution scores from which column-specific properties such as sequence entropy and random noise were subtracted; "central" positions were identified by calculating various network centrality scores. When compared among algorithms, network centrality methods, particularly eigenvector centrality, showed markedly better agreement than comparisons of the top pairwise scores. Positions with large centrality scores occurred at key structural locations and/or were functionally sensitive to mutations. Further, the top central positions often differed from those with top pairwise coevolution scores: instead of a few strong scores, central positions often had multiple, moderate scores. We conclude that eigenvector centrality calculations reveal a robust evolutionary pattern of constraints-detectable by divergent algorithms--that occur at key protein locations. Finally, we discuss the fact that multiple patterns coexist in evolutionary data that, together, give rise to emergent protein functions. © 2015 Wiley Periodicals, Inc.

Evolutionary Construction of Block-Based Neural Networks in Consideration of Failure

NASA Astrophysics Data System (ADS)

Takamori, Masahito; Koakutsu, Seiichi; Hamagami, Tomoki; Hirata, Hironori

In this paper we propose a modified gene coding and an evolutionary construction in consideration of failure in evolutionary construction of Block-Based Neural Networks. In the modified gene coding, we arrange the genes of weights on a chromosome in consideration of the position relation of the genes of weight and structure. By the modified gene coding, the efficiency of search by crossover is increased. Thereby, it is thought that improvement of the convergence rate of construction and shortening of construction time can be performed. In the evolutionary construction in consideration of failure, the structure which is adapted for failure is built in the state where failure occured. Thereby, it is thought that BBNN can be reconstructed in a short time at the time of failure. To evaluate the proposed method, we apply it to pattern classification and autonomous mobile robot control problems. The computational experiments indicate that the proposed method can improve convergence rate of construction and shorten of construction and reconstruction time.

A new evolutionary system for evolving artificial neural networks.

PubMed

Yao, X; Liu, Y

1997-01-01

This paper presents a new evolutionary system, i.e., EPNet, for evolving artificial neural networks (ANNs). The evolutionary algorithm used in EPNet is based on Fogel's evolutionary programming (EP). Unlike most previous studies on evolving ANN's, this paper puts its emphasis on evolving ANN's behaviors. Five mutation operators proposed in EPNet reflect such an emphasis on evolving behaviors. Close behavioral links between parents and their offspring are maintained by various mutations, such as partial training and node splitting. EPNet evolves ANN's architectures and connection weights (including biases) simultaneously in order to reduce the noise in fitness evaluation. The parsimony of evolved ANN's is encouraged by preferring node/connection deletion to addition. EPNet has been tested on a number of benchmark problems in machine learning and ANNs, such as the parity problem, the medical diagnosis problems, the Australian credit card assessment problem, and the Mackey-Glass time series prediction problem. The experimental results show that EPNet can produce very compact ANNs with good generalization ability in comparison with other algorithms.

The origins and evolutionary history of human non-coding RNA regulatory networks.

PubMed

Sherafatian, Masih; Mowla, Seyed Javad

2017-04-01

The evolutionary history and origin of the regulatory function of animal non-coding RNAs are not well understood. Lack of conservation of long non-coding RNAs and small sizes of microRNAs has been major obstacles in their phylogenetic analysis. In this study, we tried to shed more light on the evolution of ncRNA regulatory networks by changing our phylogenetic strategy to focus on the evolutionary pattern of their protein coding targets. We used available target databases of miRNAs and lncRNAs to find their protein coding targets in human. We were able to recognize evolutionary hallmarks of ncRNA targets by phylostratigraphic analysis. We found the conventional 3'-UTR and lesser known 5'-UTR targets of miRNAs to be enriched at three consecutive phylostrata. Firstly, in eukaryata phylostratum corresponding to the emergence of miRNAs, our study revealed that miRNA targets function primarily in cell cycle processes. Moreover, the same overrepresentation of the targets observed in the next two consecutive phylostrata, opisthokonta and eumetazoa, corresponded to the expansion periods of miRNAs in animals evolution. Coding sequence targets of miRNAs showed a delayed rise at opisthokonta phylostratum, compared to the 3' and 5' UTR targets of miRNAs. LncRNA regulatory network was the latest to evolve at eumetazoa.

Bipartite Network Analysis of the Archaeal Virosphere: Evolutionary Connections between Viruses and Capsidless Mobile Elements

PubMed Central

Prangishvili, David

2016-01-01

ABSTRACT Archaea and particularly hyperthermophilic crenarchaea are hosts to many unusual viruses with diverse virion shapes and distinct gene compositions. As is typical of viruses in general, there are no universal genes in the archaeal virosphere. Therefore, to obtain a comprehensive picture of the evolutionary relationships between viruses, network analysis methods are more productive than traditional phylogenetic approaches. Here we present a comprehensive comparative analysis of genomes and proteomes from all currently known taxonomically classified and unclassified, cultivated and uncultivated archaeal viruses. We constructed a bipartite network of archaeal viruses that includes two classes of nodes, the genomes and gene families that connect them. Dissection of this network using formal community detection methods reveals strong modularity, with 10 distinct modules and 3 putative supermodules. However, compared to similar previously analyzed networks of eukaryotic and bacterial viruses, the archaeal virus network is sparsely connected. With the exception of the tailed viruses related to bacteriophages of the order Caudovirales and the families Turriviridae and Sphaerolipoviridae that are linked to a distinct supermodule of eukaryotic and bacterial viruses, there are few connector genes shared by different archaeal virus modules. In contrast, most of these modules include, in addition to viruses, capsidless mobile elements, emphasizing tight evolutionary connections between the two types of entities in archaea. The relative contributions of distinct evolutionary origins, in particular from nonviral elements, and insufficient sampling to the sparsity of the archaeal virus network remain to be determined by further exploration of the archaeal virosphere. IMPORTANCE Viruses infecting archaea are among the most mysterious denizens of the virosphere. Many of these viruses display no genetic or even morphological relationship to viruses of bacteria and eukaryotes, raising questions regarding their origins and position in the global virosphere. Analysis of 5,740 protein sequences from 116 genomes allowed dissection of the archaeal virus network and showed that most groups of archaeal viruses are evolutionarily connected to capsidless mobile genetic elements, including various plasmids and transposons. This finding could reflect actual independent origins of the distinct groups of archaeal viruses from different nonviral elements, providing important insights into the emergence and evolution of the archaeal virome. PMID:27681128

An Analysis on a Negotiation Model Based on Multiagent Systems with Symbiotic Learning and Evolution

NASA Astrophysics Data System (ADS)

Hossain, Md. Tofazzal

This study explores an evolutionary analysis on a negotiation model based on Masbiole (Multiagent Systems with Symbiotic Learning and Evolution) which has been proposed as a new methodology of Multiagent Systems (MAS) based on symbiosis in the ecosystem. In Masbiole, agents evolve in consideration of not only their own benefits and losses, but also the benefits and losses of opponent agents. To aid effective application of Masbiole, we develop a competitive negotiation model where rigorous and advanced intelligent decision-making mechanisms are required for agents to achieve solutions. A Negotiation Protocol is devised aiming at developing a set of rules for agents' behavior during evolution. Simulations use a newly developed evolutionary computing technique, called Genetic Network Programming (GNP) which has the directed graph-type gene structure that can develop and design the required intelligent mechanisms for agents. In a typical scenario, competitive negotiation solutions are reached by concessions that are usually predetermined in the conventional MAS. In this model, however, not only concession is determined automatically by symbiotic evolution (making the system intelligent, automated, and efficient) but the solution also achieves Pareto optimal automatically.

Some Physical Principles Governing Spatial and Temporal Organization in Living Systems

NASA Astrophysics Data System (ADS)

Ali, Md Zulfikar

Spatial and temporal organization in living organisms are crucial for a variety of biological functions and arise from the interplay of large number of interacting molecules. One of the central questions in systems biology is to understand how such an intricate organization emerges from the molecular biochemistry of the cell. In this dissertation we explore two projects. The first project relates to pattern formation in a cell membrane as an example of spatial organization, and the second project relates to the evolution of oscillatory networks as a simple example of temporal organization. For the first project, we introduce a model for pattern formation in a two-component lipid bilayer and study the interplay between membrane composition and membrane geometry, demonstrating the existence of a rich phase diagram. Pattern formation is governed by the interplay between phase separation driven by lipid-lipid interactions and tendency of lipid domains with high intrinsic curvature to deform the membrane away from its preferred position. Depending on membrane parameters, we find the formation of compact lipid micro-clusters or of striped domains. We calculate the stripe width analytically and find good agreement with stripe widths obtained from the simulations. For the second project, we introduce a minimal model for the evolution of functional protein-interaction networks using a sequence-based mutational algorithm and apply it to study the following problems. Using the model, we study robustness and designabilty of a 2-component network that generate oscillations. We completely enumerate the sequence space and the phenotypic space, and discuss the relationship between designabilty, robustness and evolvability. We further apply the model to studies of neutral drift in networks that yield oscillatory dynamics, e.g. starting with a relatively simple network and allowing it to evolve by adding nodes and connections while requiring that oscillatory dynamics be preserved. Our studies demonstrate both the importance of employing a sequence-based evolutionary scheme and the relative rapidity (in evolutionary time) for the redistribution of function over new nodes via neutral drift. In addition we discovered another much slower timescale for network evolution, reflecting hidden order in sequence space that we interpret in terms of sparsely connected domains. Finally, we use the model to study the evolution of an oscillator from a non-oscillatory network under the influence of external periodic forcing as a model for evolution of circadian rhythm in living systems. We use a greedy algorithm based on optimizing biologically motivated fitness functions and find that the algorithm successfully produces oscillators. However, the distribution of free-period of evolved oscillators depends on the choice of fitness functions and the nature of forcing.

The Frenkel Kontorova Model

NASA Astrophysics Data System (ADS)

Floría, L. M.; Baesens, C.; Gómez-Gardeñes, J.

In the preface to his monograph on the structure of Evolutionary Theory [1], the late professor Stephen Jay Gould attributes to the philosopher Immanuel Kant the following aphorism in Science Philosophy: "Percepts without concepts are blind; concepts without percepts are empty". Using with a bit of freedom these Kantian terms, one would say that a scientific model is a framework (or network) of interrelated concepts and percepts where experts build up scientific consistent explanations of a given set of observations. Good models are those which are both, conceptually simple and universal in their perceptions. Let us illustrate with examples the meaning of this statement.

Imitation versus payoff: Duality of the decision-making process demonstrates criticality and consensus formation

NASA Astrophysics Data System (ADS)

Turalska, M.; West, B. J.

2014-11-01

We consider a dual model of decision making, in which an individual forms its opinion based on contrasting mechanisms of imitation and rational calculation. The decision-making model (DMM) implements imitating behavior by means of a network of coupled two-state master equations that undergoes a phase transition at a critical value of a control parameter. The evolutionary spatial game, being a generalization of the prisoner's dilemma game, is used to determine in objective fashion the cooperative or anticooperative strategy adopted by individuals. Interactions between two sources of dynamics increases the domain of initial states attracted to phase transition dynamics beyond that of the DMM network in isolation. Additionally, on average the influence of the DMM on the game increases the final observed fraction of cooperators in the system.

Positive and negative effects of social impact on evolutionary vaccination game in networks

NASA Astrophysics Data System (ADS)

Ichinose, Genki; Kurisaku, Takehiro

2017-02-01

Preventing infectious disease like flu from spreading to large communities is one of the most important issues for humans. One effective strategy is voluntary vaccination, however, there is always the temptation for people refusing to be vaccinated because once herd immunity is achieved, infection risk is greatly reduced. In this paper, we study the effect of social impact on the vaccination behavior resulting in preventing infectious disease in networks. The evolutionary simulation results show that the social impact has both positive and negative effects on the vaccination behavior. Especially, in heterogeneous networks, if the vaccination cost is low the behavior is more promoted than the case without social impact. In contrast, if the cost is high, the behavior is reduced compared to the case without social impact. Moreover, the vaccination behavior is effective in heterogeneous networks more than in homogeneous networks. This implies that the social impact puts people at risk in homogeneous networks. We also evaluate the results from the social cost related to the vaccination policy.

Tree-Based Unrooted Phylogenetic Networks.

PubMed

Francis, A; Huber, K T; Moulton, V

2018-02-01

Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An unrooted phylogenetic network on a non-empty, finite set X of taxa, or network, is a connected, simple graph in which every vertex has degree 1 or 3 and whose leaf set is X. It is called a phylogenetic tree if the underlying graph is a tree. In this paper we consider properties of tree-based networks, that is, networks that can be constructed by adding edges into a phylogenetic tree. We show that although they have some properties in common with their rooted analogues which have recently drawn much attention in the literature, they have some striking differences in terms of both their structural and computational properties. We expect that our results could eventually have applications to, for example, detecting horizontal gene transfer or hybridization which are important factors in the evolution of many organisms.

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

PubMed

Wagner, Andreas

2014-07-07

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. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

Evolution versus "intelligent design": comparing the topology of protein-protein interaction networks to the Internet.

PubMed

Yang, Q; Siganos, G; Faloutsos, M; Lonardi, S

2006-01-01

Recent research efforts have made available genome-wide, high-throughput protein-protein interaction (PPI) maps for several model organisms. This has enabled the systematic analysis of PPI networks, which has become one of the primary challenges for the system biology community. In this study, we attempt to understand better the topological structure of PPI networks by comparing them against man-made communication networks, and more specifically, the Internet. Our comparative study is based on a comprehensive set of graph metrics. Our results exhibit an interesting dichotomy. On the one hand, both networks share several macroscopic properties such as scale-free and small-world properties. On the other hand, the two networks exhibit significant topological differences, such as the cliqueishness of the highest degree nodes. We attribute these differences to the distinct design principles and constraints that both networks are assumed to satisfy. We speculate that the evolutionary constraints that favor the survivability and diversification are behind the building process of PPI networks, whereas the leading force in shaping the Internet topology is a decentralized optimization process geared towards efficient node communication.

Social dilemmas in an online social network: The structure and evolution of cooperation

NASA Astrophysics Data System (ADS)

Fu, Feng; Chen, Xiaojie; Liu, Lianghuan; Wang, Long

2007-11-01

We investigate two paradigms for studying the evolution of cooperation—Prisoner's Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two types of games on it. It is found that cooperation is substantially promoted with small values of game matrix parameters in both games. Whereas the competent cooperators induced by the underlying network of contacts will be dramatically inhibited with increasing values of the game parameters. Further, we explore the role of assortativity in evolution of cooperation by random edge rewiring. We find that increasing amount of assortativity will to a certain extent diminish the cooperation level. We also show that connected large hubs are capable of maintaining cooperation. The evolution of cooperation on empirical networks is influenced by various network effects in a combined manner, compared with that on model networks. Our results can help understand the cooperative behaviors in human groups and society.

Clustered marginalization of minorities during social transitions induced by co-evolution of behaviour and network structure

PubMed Central

Schleussner, Carl-Friedrich; Donges, Jonathan F.; Engemann, Denis A.; Levermann, Anders

2016-01-01

Large-scale transitions in societies are associated with both individual behavioural change and restructuring of the social network. These two factors have often been considered independently, yet recent advances in social network research challenge this view. Here we show that common features of societal marginalization and clustering emerge naturally during transitions in a co-evolutionary adaptive network model. This is achieved by explicitly considering the interplay between individual interaction and a dynamic network structure in behavioural selection. We exemplify this mechanism by simulating how smoking behaviour and the network structure get reconfigured by changing social norms. Our results are consistent with empirical findings: The prevalence of smoking was reduced, remaining smokers were preferentially connected among each other and formed increasingly marginalized clusters. We propose that self-amplifying feedbacks between individual behaviour and dynamic restructuring of the network are main drivers of the transition. This generative mechanism for co-evolution of individual behaviour and social network structure may apply to a wide range of examples beyond smoking. PMID:27510641

Genetic Regulatory Networks in Embryogenesis and Evolution

NASA Technical Reports Server (NTRS)

1998-01-01

The article introduces a series of papers that were originally presented at a workshop titled Genetic Regulatory Network in Embryogenesis and Evaluation. Contents include the following: evolution of cleavage programs in relationship to axial specification and body plan evolution, changes in cell lineage specification elucidate evolutionary relations in spiralia, axial patterning in the leech: developmental mechanisms and evolutionary implications, hox genes in arthropod development and evolution, heterochronic genes in development and evolution, a common theme for LIM homeobox gene function across phylogeny, and mechanisms of specification in ascidian embryos.

Evolutionary systems biology: historical and philosophical perspectives on an emerging synthesis.

PubMed

O'Malley, Maureen A

2012-01-01

Systems biology (SB) is at least a decade old now and maturing rapidly. A more recent field, evolutionary systems biology (ESB), is in the process of further developing system-level approaches through the expansion of their explanatory and potentially predictive scope. This chapter will outline the varieties of ESB existing today by tracing the diverse roots and fusions that make up this integrative project. My approach is philosophical and historical. As well as examining the recent origins of ESB, I will reflect on its central features and the different clusters of research it comprises. In its broadest interpretation, ESB consists of five overlapping approaches: comparative and correlational ESB; network architecture ESB; network property ESB; population genetics ESB; and finally, standard evolutionary questions answered with SB methods. After outlining each approach with examples, I will examine some strong general claims about ESB, particularly that it can be viewed as the next step toward a fuller modern synthesis of evolutionary biology (EB), and that it is also the way forward for evolutionary and systems medicine. I will conclude with a discussion of whether the emerging field of ESB has the capacity to combine an even broader scope of research aims and efforts than it presently does.

A unified framework for the pareto law and Matthew effect using scale-free networks

NASA Astrophysics Data System (ADS)

Hu, M.-B.; Wang, W.-X.; Jiang, R.; Wu, Q.-S.; Wang, B.-H.; Wu, Y.-H.

2006-09-01

We investigate the accumulated wealth distribution by adopting evolutionary games taking place on scale-free networks. The system self-organizes to a critical Pareto distribution (1897) of wealth P(m)˜m-(v+1) with 1.6 < v <2.0 (which is in agreement with that of U.S. or Japan). Particularly, the agent's personal wealth is proportional to its number of contacts (connectivity), and this leads to the phenomenon that the rich gets richer and the poor gets relatively poorer, which is consistent with the Matthew Effect present in society, economy, science and so on. Though our model is simple, it provides a good representation of cooperation and profit accumulation behavior in economy, and it combines the network theory with econophysics.

Hierarchical coordinate systems for understanding complexity and its evolution, with applications to genetic regulatory networks.

PubMed

Egri-Nagy, Attila; Nehaniv, Chrystopher L

2008-01-01

Beyond complexity measures, sometimes it is worthwhile in addition to investigate how complexity changes structurally, especially in artificial systems where we have complete knowledge about the evolutionary process. Hierarchical decomposition is a useful way of assessing structural complexity changes of organisms modeled as automata, and we show how recently developed computational tools can be used for this purpose, by computing holonomy decompositions and holonomy complexity. To gain insight into the evolution of complexity, we investigate the smoothness of the landscape structure of complexity under minimal transitions. As a proof of concept, we illustrate how the hierarchical complexity analysis reveals symmetries and irreversible structure in biological networks by applying the methods to the lac operon mechanism in the genetic regulatory network of Escherichia coli.

Networks in a Large-Scale Phylogenetic Analysis: Reconstructing Evolutionary History of Asparagales (Lilianae) Based on Four Plastid Genes

PubMed Central

Chase, Mark W.; Kim, Joo-Hwan

2013-01-01

Phylogenetic analysis aims to produce a bifurcating tree, which disregards conflicting signals and displays only those that are present in a large proportion of the data. However, any character (or tree) conflict in a dataset allows the exploration of support for various evolutionary hypotheses. Although data-display network approaches exist, biologists cannot easily and routinely use them to compute rooted phylogenetic networks on real datasets containing hundreds of taxa. Here, we constructed an original neighbour-net for a large dataset of Asparagales to highlight the aspects of the resulting network that will be important for interpreting phylogeny. The analyses were largely conducted with new data collected for the same loci as in previous studies, but from different species accessions and greater sampling in many cases than in published analyses. The network tree summarised the majority data pattern in the characters of plastid sequences before tree building, which largely confirmed the currently recognised phylogenetic relationships. Most conflicting signals are at the base of each group along the Asparagales backbone, which helps us to establish the expectancy and advance our understanding of some difficult taxa relationships and their phylogeny. The network method should play a greater role in phylogenetic analyses than it has in the past. To advance the understanding of evolutionary history of the largest order of monocots Asparagales, absolute diversification times were estimated for family-level clades using relaxed molecular clock analyses. PMID:23544071

Why don’t you use Evolutionary Algorithms in Big Data?

NASA Astrophysics Data System (ADS)

Stanovov, Vladimir; Brester, Christina; Kolehmainen, Mikko; Semenkina, Olga

2017-02-01

In this paper we raise the question of using evolutionary algorithms in the area of Big Data processing. We show that evolutionary algorithms provide evident advantages due to their high scalability and flexibility, their ability to solve global optimization problems and optimize several criteria at the same time for feature selection, instance selection and other data reduction problems. In particular, we consider the usage of evolutionary algorithms with all kinds of machine learning tools, such as neural networks and fuzzy systems. All our examples prove that Evolutionary Machine Learning is becoming more and more important in data analysis and we expect to see the further development of this field especially in respect to Big Data.

Evolutionary dynamics of a smoothed war of attrition game.

PubMed

Iyer, Swami; Killingback, Timothy

2016-05-07

In evolutionary game theory the War of Attrition game is intended to model animal contests which are decided by non-aggressive behavior, such as the length of time that a participant will persist in the contest. The classical War of Attrition game assumes that no errors are made in the implementation of an animal׳s strategy. However, it is inevitable in reality that such errors must sometimes occur. Here we introduce an extension of the classical War of Attrition game which includes the effect of errors in the implementation of an individual׳s strategy. This extension of the classical game has the important feature that the payoff is continuous, and as a consequence admits evolutionary behavior that is fundamentally different from that possible in the original game. We study the evolutionary dynamics of this new game in well-mixed populations both analytically using adaptive dynamics and through individual-based simulations, and show that there are a variety of possible outcomes, including simple monomorphic or dimorphic configurations which are evolutionarily stable and cannot occur in the classical War of Attrition game. In addition, we study the evolutionary dynamics of this extended game in a variety of spatially and socially structured populations, as represented by different complex network topologies, and show that similar outcomes can also occur in these situations. Copyright © 2016 Elsevier Ltd. All rights reserved.

Tracking the Evolution of Infrastructure Systems and Mass Responses Using Publically Available Data

PubMed Central

Guan, Xiangyang; Chen, Cynthia; Work, Dan

2016-01-01

Networks can evolve even on a short-term basis. This phenomenon is well understood by network scientists, but receive little attention in empirical literature involving real-world networks. On one hand, this is due to the deceitfully fixed topology of some networks such as many physical infrastructures, whose evolution is often deemed unlikely to occur in short term; on the other hand, the lack of data prohibits scientists from studying subjects such as social networks that seem likely to evolve on a short-term basis. We show that both networks—the infrastructure network and social network—are able to demonstrate evolutionary dynamics at the system level even in the short-term, characterized by shifting between different phases as predicted in network science. We develop a methodology of tracking the evolutionary dynamics of the two networks by incorporating flows and the microstructure of networks such as motifs. This approach is applied to the human interaction network and two transportation networks (subway and taxi) in the context of Hurricane Sandy, using publically available Twitter data and transportation data. Our result shows that significant changes in the system-level structure of networks can be detected on a continuous basis. This result provides a promising channel for real-time tracking in the future. PMID:27907061

Rapid molecular evolution across amniotes of the IIS/TOR network

PubMed Central

McGaugh, Suzanne E.; Bronikowski, Anne M.; Kuo, Chih-Horng; Reding, Dawn M.; Addis, Elizabeth A.; Flagel, Lex E.; Janzen, Fredric J.

2015-01-01

The insulin/insulin-like signaling and target of rapamycin (IIS/TOR) network regulates lifespan and reproduction, as well as metabolic diseases, cancer, and aging. Despite its vital role in health, comparative analyses of IIS/TOR have been limited to invertebrates and mammals. We conducted an extensive evolutionary analysis of the IIS/TOR network across 66 amniotes with 18 newly generated transcriptomes from nonavian reptiles and additional available genomes/transcriptomes. We uncovered rapid and extensive molecular evolution between reptiles (including birds) and mammals: (i) the IIS/TOR network, including the critical nodes insulin receptor substrate (IRS) and phosphatidylinositol 3-kinase (PI3K), exhibit divergent evolutionary rates between reptiles and mammals; (ii) compared with a proxy for the rest of the genome, genes of the IIS/TOR extracellular network exhibit exceptionally fast evolutionary rates; and (iii) signatures of positive selection and coevolution of the extracellular network suggest reptile- and mammal-specific interactions between members of the network. In reptiles, positively selected sites cluster on the binding surfaces of insulin-like growth factor 1 (IGF1), IGF1 receptor (IGF1R), and insulin receptor (INSR); whereas in mammals, positively selected sites clustered on the IGF2 binding surface, suggesting that these hormone-receptor binding affinities are targets of positive selection. Further, contrary to reports that IGF2R binds IGF2 only in marsupial and placental mammals, we found positively selected sites clustered on the hormone binding surface of reptile IGF2R that suggest that IGF2R binds to IGF hormones in diverse taxa and may have evolved in reptiles. These data suggest that key IIS/TOR paralogs have sub- or neofunctionalized between mammals and reptiles and that this network may underlie fundamental life history and physiological differences between these amniote sister clades. PMID:25991861

Rapid molecular evolution across amniotes of the IIS/TOR network.

PubMed

McGaugh, Suzanne E; Bronikowski, Anne M; Kuo, Chih-Horng; Reding, Dawn M; Addis, Elizabeth A; Flagel, Lex E; Janzen, Fredric J; Schwartz, Tonia S

2015-06-02

The insulin/insulin-like signaling and target of rapamycin (IIS/TOR) network regulates lifespan and reproduction, as well as metabolic diseases, cancer, and aging. Despite its vital role in health, comparative analyses of IIS/TOR have been limited to invertebrates and mammals. We conducted an extensive evolutionary analysis of the IIS/TOR network across 66 amniotes with 18 newly generated transcriptomes from nonavian reptiles and additional available genomes/transcriptomes. We uncovered rapid and extensive molecular evolution between reptiles (including birds) and mammals: (i) the IIS/TOR network, including the critical nodes insulin receptor substrate (IRS) and phosphatidylinositol 3-kinase (PI3K), exhibit divergent evolutionary rates between reptiles and mammals; (ii) compared with a proxy for the rest of the genome, genes of the IIS/TOR extracellular network exhibit exceptionally fast evolutionary rates; and (iii) signatures of positive selection and coevolution of the extracellular network suggest reptile- and mammal-specific interactions between members of the network. In reptiles, positively selected sites cluster on the binding surfaces of insulin-like growth factor 1 (IGF1), IGF1 receptor (IGF1R), and insulin receptor (INSR); whereas in mammals, positively selected sites clustered on the IGF2 binding surface, suggesting that these hormone-receptor binding affinities are targets of positive selection. Further, contrary to reports that IGF2R binds IGF2 only in marsupial and placental mammals, we found positively selected sites clustered on the hormone binding surface of reptile IGF2R that suggest that IGF2R binds to IGF hormones in diverse taxa and may have evolved in reptiles. These data suggest that key IIS/TOR paralogs have sub- or neofunctionalized between mammals and reptiles and that this network may underlie fundamental life history and physiological differences between these amniote sister clades.

How mutation alters the evolutionary dynamics of cooperation on networks

NASA Astrophysics Data System (ADS)

Ichinose, Genki; Satotani, Yoshiki; Sayama, Hiroki

2018-05-01

Cooperation is ubiquitous at every level of living organisms. It is known that spatial (network) structure is a viable mechanism for cooperation to evolve. A recently proposed numerical metric, average gradient of selection (AGoS), a useful tool for interpreting and visualizing evolutionary dynamics on networks, allows simulation results to be visualized on a one-dimensional phase space. However, stochastic mutation of strategies was not considered in the analysis of AGoS. Here we extend AGoS so that it can analyze the evolution of cooperation where mutation may alter strategies of individuals on networks. We show that our extended AGoS correctly visualizes the final states of cooperation with mutation in the individual-based simulations. Our analyses revealed that mutation always has a negative effect on the evolution of cooperation regardless of the payoff functions, fraction of cooperators, and network structures. Moreover, we found that scale-free networks are the most vulnerable to mutation and thus the dynamics of cooperation are altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.

Enhancing Command Communications and Innovation with SAINT:Semantics, Adaptation, and Influence in Networked Teams

DTIC Science & Technology

2009-02-01

can be quickly reused to face new analytic tasks. Other humanities projects like Monk and Nema have also recently adopted Meandre. The evolutionary...keynote], Congresso Mexicano dc Com- putation Evolutiva (CONCEV), Aguas Calientes, Mexico, May, 2005. Evolutionary Tools for Human-Innovation and

Introduction to bioinformatics.

PubMed

Can, Tolga

2014-01-01

Bioinformatics is an interdisciplinary field mainly involving molecular biology and genetics, computer science, mathematics, and statistics. Data intensive, large-scale biological problems are addressed from a computational point of view. The most common problems are modeling biological processes at the molecular level and making inferences from collected data. A bioinformatics solution usually involves the following steps: Collect statistics from biological data. Build a computational model. Solve a computational modeling problem. Test and evaluate a computational algorithm. This chapter gives a brief introduction to bioinformatics by first providing an introduction to biological terminology and then discussing some classical bioinformatics problems organized by the types of data sources. Sequence analysis is the analysis of DNA and protein sequences for clues regarding function and includes subproblems such as identification of homologs, multiple sequence alignment, searching sequence patterns, and evolutionary analyses. Protein structures are three-dimensional data and the associated problems are structure prediction (secondary and tertiary), analysis of protein structures for clues regarding function, and structural alignment. Gene expression data is usually represented as matrices and analysis of microarray data mostly involves statistics analysis, classification, and clustering approaches. Biological networks such as gene regulatory networks, metabolic pathways, and protein-protein interaction networks are usually modeled as graphs and graph theoretic approaches are used to solve associated problems such as construction and analysis of large-scale networks.

Intelligent reservoir operation system based on evolving artificial neural networks

NASA Astrophysics Data System (ADS)

Chaves, Paulo; Chang, Fi-John

2008-06-01

We propose a novel intelligent reservoir operation system based on an evolving artificial neural network (ANN). Evolving means the parameters of the ANN model are identified by the GA evolutionary optimization technique. Accordingly, the ANN model should represent the operational strategies of reservoir operation. The main advantages of the Evolving ANN Intelligent System (ENNIS) are as follows: (i) only a small number of parameters to be optimized even for long optimization horizons, (ii) easy to handle multiple decision variables, and (iii) the straightforward combination of the operation model with other prediction models. The developed intelligent system was applied to the operation of the Shihmen Reservoir in North Taiwan, to investigate its applicability and practicability. The proposed method is first built to a simple formulation for the operation of the Shihmen Reservoir, with single objective and single decision. Its results were compared to those obtained by dynamic programming. The constructed network proved to be a good operational strategy. The method was then built and applied to the reservoir with multiple (five) decision variables. The results demonstrated that the developed evolving neural networks improved the operation performance of the reservoir when compared to its current operational strategy. The system was capable of successfully simultaneously handling various decision variables and provided reasonable and suitable decisions.

An algebra-based method for inferring gene regulatory networks.

PubMed

Vera-Licona, Paola; Jarrah, Abdul; Garcia-Puente, Luis David; McGee, John; Laubenbacher, Reinhard

2014-03-26

The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the dynamic patterns present in the network. Boolean polynomial dynamical systems provide a powerful modeling framework for the reverse engineering of gene regulatory networks, that enables a rich mathematical structure on the model search space. A C++ implementation of the method, distributed under LPGL license, is available, together with the source code, at http://www.paola-vera-licona.net/Software/EARevEng/REACT.html.

The human phosphotyrosine signaling network: Evolution and hotspots of hijacking in cancer

PubMed Central

Li, Lei; Tibiche, Chabane; Fu, Cong; Kaneko, Tomonori; Moran, Michael F.; Schiller, Martin R.; Li, Shawn Shun-Cheng; Wang, Edwin

2012-01-01

Phosphotyrosine (pTyr) signaling, which plays a central role in cell–cell and cell–environment interactions, has been considered to be an evolutionary innovation in multicellular metazoans. However, neither the emergence nor the evolution of the human pTyr signaling system is currently understood. Tyrosine kinase (TK) circuits, each of which consists of a TK writer, a kinase substrate, and a related reader, such as Src homology (SH) 2 domains and pTyr-binding (PTB) domains, comprise the core machinery of the pTyr signaling network. In this study, we analyzed the evolutionary trajectories of 583 literature-derived and 50,000 computationally predicted human TK circuits in 19 representative eukaryotic species and assigned their evolutionary origins. We found that human TK circuits for intracellular pTyr signaling originated largely from primitive organisms, whereas the inter- or extracellular signaling circuits experienced significant expansion in the bilaterian lineage through the “back-wiring” of newly evolved kinases to primitive substrates and SH2/PTB domains. Conversely, the TK circuits that are involved in tissue-specific signaling evolved mainly in vertebrates by the back-wiring of vertebrate substrates to primitive kinases and SH2/PTB domains. Importantly, we found that cancer signaling preferentially employs the pTyr sites, which are linked to more TK circuits. Our work provides insights into the evolutionary paths of the human pTyr signaling circuits and suggests the use of a network approach for cancer intervention through the targeting of key pTyr sites and their associated signaling hubs in the network. PMID:22194470

Quantifying ecological impacts of mass extinctions with network analysis of fossil communities

PubMed Central

Muscente, A. D.; Prabhu, Anirudh; Zhong, Hao; Eleish, Ahmed; Meyer, Michael B.; Fox, Peter; Hazen, Robert M.; Knoll, Andrew H.

2018-01-01

Mass extinctions documented by the fossil record provide critical benchmarks for assessing changes through time in biodiversity and ecology. Efforts to compare biotic crises of the past and present, however, encounter difficulty because taxonomic and ecological changes are decoupled, and although various metrics exist for describing taxonomic turnover, no methods have yet been proposed to quantify the ecological impacts of extinction events. To address this issue, we apply a network-based approach to exploring the evolution of marine animal communities over the Phanerozoic Eon. Network analysis of fossil co-occurrence data enables us to identify nonrandom associations of interrelated paleocommunities. These associations, or evolutionary paleocommunities, dominated total diversity during successive intervals of relative community stasis. Community turnover occurred largely during mass extinctions and radiations, when ecological reorganization resulted in the decline of one association and the rise of another. Altogether, we identify five evolutionary paleocommunities at the generic and familial levels in addition to three ordinal associations that correspond to Sepkoski’s Cambrian, Paleozoic, and Modern evolutionary faunas. In this context, we quantify magnitudes of ecological change by measuring shifts in the representation of evolutionary paleocommunities over geologic time. Our work shows that the Great Ordovician Biodiversification Event had the largest effect on ecology, followed in descending order by the Permian–Triassic, Cretaceous–Paleogene, Devonian, and Triassic–Jurassic mass extinctions. Despite its taxonomic severity, the Ordovician extinction did not strongly affect co-occurrences of taxa, affirming its limited ecological impact. Network paleoecology offers promising approaches to exploring ecological consequences of extinctions and radiations. PMID:29686079

Quantifying ecological impacts of mass extinctions with network analysis of fossil communities.

PubMed

Muscente, A D; Prabhu, Anirudh; Zhong, Hao; Eleish, Ahmed; Meyer, Michael B; Fox, Peter; Hazen, Robert M; Knoll, Andrew H

2018-05-15

Mass extinctions documented by the fossil record provide critical benchmarks for assessing changes through time in biodiversity and ecology. Efforts to compare biotic crises of the past and present, however, encounter difficulty because taxonomic and ecological changes are decoupled, and although various metrics exist for describing taxonomic turnover, no methods have yet been proposed to quantify the ecological impacts of extinction events. To address this issue, we apply a network-based approach to exploring the evolution of marine animal communities over the Phanerozoic Eon. Network analysis of fossil co-occurrence data enables us to identify nonrandom associations of interrelated paleocommunities. These associations, or evolutionary paleocommunities, dominated total diversity during successive intervals of relative community stasis. Community turnover occurred largely during mass extinctions and radiations, when ecological reorganization resulted in the decline of one association and the rise of another. Altogether, we identify five evolutionary paleocommunities at the generic and familial levels in addition to three ordinal associations that correspond to Sepkoski's Cambrian, Paleozoic, and Modern evolutionary faunas. In this context, we quantify magnitudes of ecological change by measuring shifts in the representation of evolutionary paleocommunities over geologic time. Our work shows that the Great Ordovician Biodiversification Event had the largest effect on ecology, followed in descending order by the Permian-Triassic, Cretaceous-Paleogene, Devonian, and Triassic-Jurassic mass extinctions. Despite its taxonomic severity, the Ordovician extinction did not strongly affect co-occurrences of taxa, affirming its limited ecological impact. Network paleoecology offers promising approaches to exploring ecological consequences of extinctions and radiations. Copyright © 2018 the Author(s). Published by PNAS.

Evolution, learning, and cognition

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Y.C.

1988-01-01

The book comprises more than fifteen articles in the areas of neural networks and connectionist systems, classifier systems, adaptive network systems, genetic algorithm, cellular automata, artificial immune systems, evolutionary genetics, cognitive science, optical computing, combinatorial optimization, and cybernetics.

Wireless Local Area Networks: The Next Evolutionary Step.

ERIC Educational Resources Information Center

Wodarz, Nan

2001-01-01

The Institute of Electrical and Electronics Engineers recently approved a high-speed wireless standard that enables devices from different manufacturers to communicate through a common backbone, making wireless local area networks more feasible in schools. Schools can now use wireless access points and network cards to provide flexible…

Detection of Foreign Matter in Transfusion Solution Based on Gaussian Background Modeling and an Optimized BP Neural Network

PubMed Central

Zhou, Fuqiang; Su, Zhen; Chai, Xinghua; Chen, Lipeng

2014-01-01

This paper proposes a new method to detect and identify foreign matter mixed in a plastic bottle filled with transfusion solution. A spin-stop mechanism and mixed illumination style are applied to obtain high contrast images between moving foreign matter and a static transfusion background. The Gaussian mixture model is used to model the complex background of the transfusion image and to extract moving objects. A set of features of moving objects are extracted and selected by the ReliefF algorithm, and optimal feature vectors are fed into the back propagation (BP) neural network to distinguish between foreign matter and bubbles. The mind evolutionary algorithm (MEA) is applied to optimize the connection weights and thresholds of the BP neural network to obtain a higher classification accuracy and faster convergence rate. Experimental results show that the proposed method can effectively detect visible foreign matter in 250-mL transfusion bottles. The misdetection rate and false alarm rate are low, and the detection accuracy and detection speed are satisfactory. PMID:25347581

Least-cost transportation networks predict spatial interaction of invasion vectors.

PubMed

Drake, D Andrew R; Mandrak, Nicholas E

2010-12-01

Human-mediated dispersal among aquatic ecosystems often results in biotic transfer between drainage basins. Such activities may circumvent biogeographic factors, with considerable ecological, evolutionary, and economic implications. However, the efficacy of predictions concerning community changes following inter-basin movements are limited, often because the dispersal mechanism is poorly understood (e.g., quantified only partially). To date, spatial-interaction models that predict the movement of humans as vectors of biotic transfer have not incorporated patterns of human movement through transportation networks. As a necessary first step to determine the role of anglers as invasion vectors across a land-lake ecosystem, we investigate their movement potential within Ontario, Canada. To determine possible model improvements resulting from inclusion of network travel, spatial-interaction models were constructed using standard Euclidean (e.g., straight-line) distance measures and also with distances derived from least-cost routing of human transportation networks. Model comparisons determined that least-cost routing both provided the most parsimonious model and also excelled at forecasting spatial interactions, with a proportion of 0.477 total movement deviance explained. The distribution of movements was characterized by many relatively short to medium travel distances (median = 292.6 km) with fewer lengthier distances (75th percentile = 484.6 km, 95th percentile = 775.2 km); however, even the shortest movements were sufficient to overcome drainage-basin boundaries. Ranking of variables in order of their contribution within the most parsimonious model determined that distance traveled, origin outflow, lake attractiveness, and sportfish richness significantly influence movement patterns. Model improvements associated with least-cost routing of human transportation networks imply that patterns of human-mediated invasion are fundamentally linked to the spatial configuration and relative impedance of human transportation networks, placing increased importance on understanding their contribution to the invasion process.

Maximal aggregation of polynomial dynamical systems

PubMed Central

Cardelli, Luca; Tschaikowski, Max

2017-01-01

Ordinary differential equations (ODEs) with polynomial derivatives are a fundamental tool for understanding the dynamics of systems across many branches of science, but our ability to gain mechanistic insight and effectively conduct numerical evaluations is critically hindered when dealing with large models. Here we propose an aggregation technique that rests on two notions of equivalence relating ODE variables whenever they have the same solution (backward criterion) or if a self-consistent system can be written for describing the evolution of sums of variables in the same equivalence class (forward criterion). A key feature of our proposal is to encode a polynomial ODE system into a finitary structure akin to a formal chemical reaction network. This enables the development of a discrete algorithm to efficiently compute the largest equivalence, building on approaches rooted in computer science to minimize basic models of computation through iterative partition refinements. The physical interpretability of the aggregation is shown on polynomial ODE systems for biochemical reaction networks, gene regulatory networks, and evolutionary game theory. PMID:28878023

Evolution of Boolean networks under selection for a robust response to external inputs yields an extensive neutral space

NASA Astrophysics Data System (ADS)

Szejka, Agnes; Drossel, Barbara

2010-02-01

We study the evolution of Boolean networks as model systems for gene regulation. Inspired by biological networks, we select simultaneously for robust attractors and for the ability to respond to external inputs by changing the attractor. Mutations change the connections between the nodes and the update functions. In order to investigate the influence of the type of update functions, we perform our simulations with canalizing as well as with threshold functions. We compare the properties of the fitness landscapes that result for different versions of the selection criterion and the update functions. We find that for all studied cases the fitness landscape has a plateau with maximum fitness resulting in the fact that structurally very different networks are able to fulfill the same task and are connected by neutral paths in network (“genotype”) space. We find furthermore a connection between the attractor length and the mutational robustness, and an extremely long memory of the initial evolutionary stage.

Analysis and application of opinion model with multiple topic interactions.

PubMed

Xiong, Fei; Liu, Yun; Wang, Liang; Wang, Ximeng

2017-08-01

To reveal heterogeneous behaviors of opinion evolution in different scenarios, we propose an opinion model with topic interactions. Individual opinions and topic features are represented by a multidimensional vector. We measure an agent's action towards a specific topic by the product of opinion and topic feature. When pairs of agents interact for a topic, their actions are introduced to opinion updates with bounded confidence. Simulation results show that a transition from a disordered state to a consensus state occurs at a critical point of the tolerance threshold, which depends on the opinion dimension. The critical point increases as the dimension of opinions increases. Multiple topics promote opinion interactions and lead to the formation of macroscopic opinion clusters. In addition, more topics accelerate the evolutionary process and weaken the effect of network topology. We use two sets of large-scale real data to evaluate the model, and the results prove its effectiveness in characterizing a real evolutionary process. Our model achieves high performance in individual action prediction and even outperforms state-of-the-art methods. Meanwhile, our model has much smaller computational complexity. This paper provides a demonstration for possible practical applications of theoretical opinion dynamics.

Evolutionary Dynamics on Protein Bi-stability Landscapes can Potentially Resolve Adaptive Conflicts

PubMed Central

Sikosek, Tobias; Bornberg-Bauer, Erich; Chan, Hue Sun

2012-01-01

Experimental studies have shown that some proteins exist in two alternative native-state conformations. It has been proposed that such bi-stable proteins can potentially function as evolutionary bridges at the interface between two neutral networks of protein sequences that fold uniquely into the two different native conformations. Under adaptive conflict scenarios, bi-stable proteins may be of particular advantage if they simultaneously provide two beneficial biological functions. However, computational models that simulate protein structure evolution do not yet recognize the importance of bi-stability. Here we use a biophysical model to analyze sequence space to identify bi-stable or multi-stable proteins with two or more equally stable native-state structures. The inclusion of such proteins enhances phenotype connectivity between neutral networks in sequence space. Consideration of the sequence space neighborhood of bridge proteins revealed that bi-stability decreases gradually with each mutation that takes the sequence further away from an exactly bi-stable protein. With relaxed selection pressures, we found that bi-stable proteins in our model are highly successful under simulated adaptive conflict. Inspired by these model predictions, we developed a method to identify real proteins in the PDB with bridge-like properties, and have verified a clear bi-stability gradient for a series of mutants studied by Alexander et al. (Proc Nat Acad Sci USA 2009, 106:21149–21154) that connect two sequences that fold uniquely into two different native structures via a bridge-like intermediate mutant sequence. Based on these findings, new testable predictions for future studies on protein bi-stability and evolution are discussed. PMID:23028272

RBF neural network based PI pitch controller for a class of 5-MW wind turbines using particle swarm optimization algorithm.

PubMed

Poultangari, Iman; Shahnazi, Reza; Sheikhan, Mansour

2012-09-01

In order to control the pitch angle of blades in wind turbines, commonly the proportional and integral (PI) controller due to its simplicity and industrial usability is employed. The neural networks and evolutionary algorithms are tools that provide a suitable ground to determine the optimal PI gains. In this paper, a radial basis function (RBF) neural network based PI controller is proposed for collective pitch control (CPC) of a 5-MW wind turbine. In order to provide an optimal dataset to train the RBF neural network, particle swarm optimization (PSO) evolutionary algorithm is used. The proposed method does not need the complexities, nonlinearities and uncertainties of the system under control. The simulation results show that the proposed controller has satisfactory performance. Copyright © 2012 ISA. Published by Elsevier Ltd. All rights reserved.

Impact of Social Punishment on Cooperative Behavior in Complex Networks

NASA Astrophysics Data System (ADS)

Wang, Zhen; Xia, Cheng-Yi; Meloni, Sandro; Zhou, Chang-Song; Moreno, Yamir

2013-10-01

Social punishment is a mechanism by which cooperative individuals spend part of their resources to penalize defectors. In this paper, we study the evolution of cooperation in 2-person evolutionary games on networks when a mechanism for social punishment is introduced. Specifically, we introduce a new kind of role, punisher, which is aimed at reducing the earnings of defectors by applying to them a social fee. Results from numerical simulations show that different equilibria allowing the three strategies to coexist are possible as well as that social punishment further enhance the robustness of cooperation. Our results are confirmed for different network topologies and two evolutionary games. In addition, we analyze the microscopic mechanisms that give rise to the observed macroscopic behaviors in both homogeneous and heterogeneous networks. Our conclusions might provide additional insights for understanding the roots of cooperation in social systems.

Neural networks for continuous online learning and control.

PubMed

Choy, Min Chee; Srinivasan, Dipti; Cheu, Ruey Long

2006-11-01

This paper proposes a new hybrid neural network (NN) model that employs a multistage online learning process to solve the distributed control problem with an infinite horizon. Various techniques such as reinforcement learning and evolutionary algorithm are used to design the multistage online learning process. For this paper, the infinite horizon distributed control problem is implemented in the form of real-time distributed traffic signal control for intersections in a large-scale traffic network. The hybrid neural network model is used to design each of the local traffic signal controllers at the respective intersections. As the state of the traffic network changes due to random fluctuation of traffic volumes, the NN-based local controllers will need to adapt to the changing dynamics in order to provide effective traffic signal control and to prevent the traffic network from becoming overcongested. Such a problem is especially challenging if the local controllers are used for an infinite horizon problem where online learning has to take place continuously once the controllers are implemented into the traffic network. A comprehensive simulation model of a section of the Central Business District (CBD) of Singapore has been developed using PARAMICS microscopic simulation program. As the complexity of the simulation increases, results show that the hybrid NN model provides significant improvement in traffic conditions when evaluated against an existing traffic signal control algorithm as well as a new, continuously updated simultaneous perturbation stochastic approximation-based neural network (SPSA-NN). Using the hybrid NN model, the total mean delay of each vehicle has been reduced by 78% and the total mean stoppage time of each vehicle has been reduced by 84% compared to the existing traffic signal control algorithm. This shows the efficacy of the hybrid NN model in solving large-scale traffic signal control problem in a distributed manner. Also, it indicates the possibility of using the hybrid NN model for other applications that are similar in nature as the infinite horizon distributed control problem.

Enhanced production of medicinal polysaccharide by submerged fermentation of Lingzhi or Reishi medicinal mushroom Ganoderma lucidium (W.Curt.:Fr.) P. Karst. Using statistical and evolutionary optimization methods.

PubMed

Baskar, Gurunathan; Sathya, Shree Rajesh K

2011-01-01

Statistical and evolutionary optimization of media composition was employed for the production of medicinal exopolysaccharide (EPS) by Lingzhi or Reishi medicinal mushroom Ganoderma lucidium MTCC 1039 using soya bean meal flour as low-cost substrate. Soya bean meal flour, ammonium chloride, glucose, and pH were identified as the most important variables for EPS yield using the two-level Plackett-Burman design and further optimized using the central composite design (CCD) and the artificial neural network (ANN)-linked genetic algorithm (GA). The high value of coefficient of determination of ANN (R² = 0.982) indicates that the ANN model was more accurate than the second-order polynomial model of CCD (R² = 0.91) for representing the effect of media composition on EPS yield. The predicted optimum media composition using ANN-linked GA was soybean meal flour 2.98%, glucose 3.26%, ammonium chloride 0.25%, and initial pH 7.5 for the maximum predicted EPS yield of 1005.55 mg/L. The experimental EPS yield obtained using the predicted optimum media composition was 1012.36 mg/L, which validates the high degree of accuracy of evolutionary optimization for enhanced production of EPS by submerged fermentation of G. lucidium.

Analyzing the evolutionary mechanisms of the Air Transportation System-of-Systems using network theory and machine learning algorithms

NASA Astrophysics Data System (ADS)

Kotegawa, Tatsuya

Complexity in the Air Transportation System (ATS) arises from the intermingling of many independent physical resources, operational paradigms, and stakeholder interests, as well as the dynamic variation of these interactions over time. Currently, trade-offs and cost benefit analyses of new ATS concepts are carried out on system-wide evaluation simulations driven by air traffic forecasts that assume fixed airline routes. However, this does not well reflect reality as airlines regularly add and remove routes. A airline service route network evolution model that projects route addition and removal was created and combined with state-of-the-art air traffic forecast methods to better reflect the dynamic properties of the ATS in system-wide simulations. Guided by a system-of-systems framework, network theory metrics and machine learning algorithms were applied to develop the route network evolution models based on patterns extracted from historical data. Constructing the route addition section of the model posed the greatest challenge due to the large pool of new link candidates compared to the actual number of routes historically added to the network. Of the models explored, algorithms based on logistic regression, random forests, and support vector machines showed best route addition and removal forecast accuracies at approximately 20% and 40%, respectively, when validated with historical data. The combination of network evolution models and a system-wide evaluation tool quantified the impact of airline route network evolution on air traffic delay. The expected delay minutes when considering network evolution increased approximately 5% for a forecasted schedule on 3/19/2020. Performance trade-off studies between several airline route network topologies from the perspectives of passenger travel efficiency, fuel burn, and robustness were also conducted to provide bounds that could serve as targets for ATS transformation efforts. The series of analysis revealed that high robustness is achievable only in exchange of lower passenger travel and fuel burn efficiency. However, increase in the network density can mitigate this trade-off.

Predicting rates of interspecific interaction from phylogenetic trees.

PubMed

Nuismer, Scott L; Harmon, Luke J

2015-01-01

Integrating phylogenetic information can potentially improve our ability to explain species' traits, patterns of community assembly, the network structure of communities, and ecosystem function. In this study, we use mathematical models to explore the ecological and evolutionary factors that modulate the explanatory power of phylogenetic information for communities of species that interact within a single trophic level. We find that phylogenetic relationships among species can influence trait evolution and rates of interaction among species, but only under particular models of species interaction. For example, when interactions within communities are mediated by a mechanism of phenotype matching, phylogenetic trees make specific predictions about trait evolution and rates of interaction. In contrast, if interactions within a community depend on a mechanism of phenotype differences, phylogenetic information has little, if any, predictive power for trait evolution and interaction rate. Together, these results make clear and testable predictions for when and how evolutionary history is expected to influence contemporary rates of species interaction. © 2014 John Wiley & Sons Ltd/CNRS.

On the evolution of dispersal via heterogeneity in spatial connectivity

PubMed Central

Henriques-Silva, Renato; Boivin, Frédéric; Calcagno, Vincent; Urban, Mark C.; Peres-Neto, Pedro R.

2015-01-01

Dispersal has long been recognized as a mechanism that shapes many observed ecological and evolutionary processes. Thus, understanding the factors that promote its evolution remains a major goal in evolutionary ecology. Landscape connectivity may mediate the trade-off between the forces in favour of dispersal propensity (e.g. kin-competition, local extinction probability) and those against it (e.g. energetic or survival costs of dispersal). It remains, however, an open question how differing degrees of landscape connectivity may select for different dispersal strategies. We implemented an individual-based model to study the evolution of dispersal on landscapes that differed in the variance of connectivity across patches ranging from networks with all patches equally connected to highly heterogeneous networks. The parthenogenetic individuals dispersed based on a flexible logistic function of local abundance. Our results suggest, all else being equal, that landscapes differing in their connectivity patterns will select for different dispersal strategies and that these strategies confer a long-term fitness advantage to individuals at the regional scale. The strength of the selection will, however, vary across network types, being stronger on heterogeneous landscapes compared with the ones where all patches have equal connectivity. Our findings highlight how landscape connectivity can determine the evolution of dispersal strategies, which in turn affects how we think about important ecological dynamics such as metapopulation persistence and range expansion. PMID:25673685

Ecological networks to unravel the routes to horizontal transposon transfers.

PubMed

Venner, Samuel; Miele, Vincent; Terzian, Christophe; Biémont, Christian; Daubin, Vincent; Feschotte, Cédric; Pontier, Dominique

2017-02-01

Transposable elements (TEs) represent the single largest component of numerous eukaryotic genomes, and their activity and dispersal constitute an important force fostering evolutionary innovation. The horizontal transfer of TEs (HTT) between eukaryotic species is a common and widespread phenomenon that has had a profound impact on TE dynamics and, consequently, on the evolutionary trajectory of many species' lineages. However, the mechanisms promoting HTT remain largely unknown. In this article, we argue that network theory combined with functional ecology provides a robust conceptual framework and tools to delineate how complex interactions between diverse organisms may act in synergy to promote HTTs.

Game Theory Meets Wireless Sensor Networks Security Requirements and Threats Mitigation: A Survey.

PubMed

Abdalzaher, Mohamed S; Seddik, Karim; Elsabrouty, Maha; Muta, Osamu; Furukawa, Hiroshi; Abdel-Rahman, Adel

2016-06-29

We present a study of using game theory for protecting wireless sensor networks (WSNs) from selfish behavior or malicious nodes. Due to scalability, low complexity and disseminated nature of WSNs, malicious attacks can be modeled effectively using game theory. In this study, we survey the different game-theoretic defense strategies for WSNs. We present a taxonomy of the game theory approaches based on the nature of the attack, whether it is caused by an external attacker or it is the result of an internal node acting selfishly or maliciously. We also present a general trust model using game theory for decision making. We, finally, identify the significant role of evolutionary games for WSNs security against intelligent attacks; then, we list several prospect applications of game theory to enhance the data trustworthiness and node cooperation in different WSNs.

Assortative mating and mutation diffusion in spatial evolutionary systems

NASA Astrophysics Data System (ADS)

Paley, C. J.; Taraskin, S. N.; Elliott, S. R.

2010-04-01

The influence of spatial structure on the equilibrium properties of a sexual population model defined on networks is studied numerically. Using a small-world-like topology of the networks as an investigative tool, the contributions to the fitness of assortative mating and of global mutant spread properties are considered. Simple measures of nearest-neighbor correlations and speed of spread of mutants through the system have been used to confirm that both of these dynamics are important contributory factors to the fitness. It is found that assortative mating increases the fitness of populations. Quick global spread of favorable mutations is shown to be a key factor increasing the equilibrium fitness of populations.

Decentralized diagnostics based on a distributed micro-genetic algorithm for transducer networks monitoring large experimental systems.

PubMed

Arpaia, P; Cimmino, P; Girone, M; La Commara, G; Maisto, D; Manna, C; Pezzetti, M

2014-09-01

Evolutionary approach to centralized multiple-faults diagnostics is extended to distributed transducer networks monitoring large experimental systems. Given a set of anomalies detected by the transducers, each instance of the multiple-fault problem is formulated as several parallel communicating sub-tasks running on different transducers, and thus solved one-by-one on spatially separated parallel processes. A micro-genetic algorithm merges evaluation time efficiency, arising from a small-size population distributed on parallel-synchronized processors, with the effectiveness of centralized evolutionary techniques due to optimal mix of exploitation and exploration. In this way, holistic view and effectiveness advantages of evolutionary global diagnostics are combined with reliability and efficiency benefits of distributed parallel architectures. The proposed approach was validated both (i) by simulation at CERN, on a case study of a cold box for enhancing the cryogeny diagnostics of the Large Hadron Collider, and (ii) by experiments, under the framework of the industrial research project MONDIEVOB (Building Remote Monitoring and Evolutionary Diagnostics), co-funded by EU and the company Del Bo srl, Napoli, Italy.

Evolutionary history of human disease genes reveals phenotypic connections and comorbidity among genetic diseases

NASA Astrophysics Data System (ADS)

Park, Solip; Yang, Jae-Seong; Kim, Jinho; Shin, Young-Eun; Hwang, Jihye; Park, Juyong; Jang, Sung Key; Kim, Sanguk

2012-10-01

The extent to which evolutionary changes have impacted the phenotypic relationships among human diseases remains unclear. In this work, we report that phenotypically similar diseases are connected by the evolutionary constraints on human disease genes. Human disease groups can be classified into slowly or rapidly evolving classes, where the diseases in the slowly evolving class are enriched with morphological phenotypes and those in the rapidly evolving class are enriched with physiological phenotypes. Our findings establish a clear evolutionary connection between disease classes and disease phenotypes for the first time. Furthermore, the high comorbidity found between diseases connected by similar evolutionary constraints enables us to improve the predictability of the relative risk of human diseases. We find the evolutionary constraints on disease genes are a new layer of molecular connection in the network-based exploration of human diseases.

Evolutionary history of human disease genes reveals phenotypic connections and comorbidity among genetic diseases.

PubMed

Park, Solip; Yang, Jae-Seong; Kim, Jinho; Shin, Young-Eun; Hwang, Jihye; Park, Juyong; Jang, Sung Key; Kim, Sanguk

2012-01-01

The extent to which evolutionary changes have impacted the phenotypic relationships among human diseases remains unclear. In this work, we report that phenotypically similar diseases are connected by the evolutionary constraints on human disease genes. Human disease groups can be classified into slowly or rapidly evolving classes, where the diseases in the slowly evolving class are enriched with morphological phenotypes and those in the rapidly evolving class are enriched with physiological phenotypes. Our findings establish a clear evolutionary connection between disease classes and disease phenotypes for the first time. Furthermore, the high comorbidity found between diseases connected by similar evolutionary constraints enables us to improve the predictability of the relative risk of human diseases. We find the evolutionary constraints on disease genes are a new layer of molecular connection in the network-based exploration of human diseases.

Network analysis of the COSMOS galaxy field

NASA Astrophysics Data System (ADS)

de Regt, R.; Apunevych, S.; von Ferber, C.; Holovatch, Yu; Novosyadlyj, B.

2018-07-01

The galaxy data provided by COSMOS survey for 1°×1° field of sky are analysed by methods of complex networks. Three galaxy samples (slices) with redshifts ranging within intervals 0.88÷0.91, 0.91÷0.94, and 0.94÷0.97 are studied as two-dimensional projections for the spatial distributions of galaxies. We construct networks and calculate network measures for each sample, in order to analyse the network similarity of different samples, distinguish various topological environments, and find associations between galaxy properties (colour index and stellar mass) and their topological environments. Results indicate a high level of similarity between geometry and topology for different galaxy samples and no clear evidence of evolutionary trends in network measures. The distribution of local clustering coefficient C manifests three modes which allow for discrimination between stand-alone singlets and dumbbells (0 ≤ C ≤ 0.1), intermediately packed (0.1 < C < 0.9) and clique (0.9 ≤ C ≤ 1) like galaxies. Analysing astrophysical properties of galaxies (colour index and stellar masses), we show that distributions are similar in all slices, however weak evolutionary trends can also be seen across redshift slices. To specify different topological environments, we have extracted selections of galaxies from each sample according to different modes of C distribution. We have found statistically significant associations between evolutionary parameters of galaxies and selections of C: the distribution of stellar mass for galaxies with interim C differs from the corresponding distributions for stand-alone and clique galaxies, and this difference holds for all redshift slices. The colour index realizes somewhat different behaviour.

Network analysis of the COSMOS galaxy field

NASA Astrophysics Data System (ADS)

de Regt, R.; Apunevych, S.; Ferber, C. von; Holovatch, Yu; Novosyadlyj, B.

2018-03-01

The galaxy data provided by COSMOS survey for 1° × 1° field of sky are analysed by methods of complex networks. Three galaxy samples (slices) with redshifts ranging within intervals 0.88÷0.91, 0.91÷0.94 and 0.94÷0.97 are studied as two-dimensional projections for the spatial distributions of galaxies. We construct networks and calculate network measures for each sample, in order to analyse the network similarity of different samples, distinguish various topological environments, and find associations between galaxy properties (colour index and stellar mass) and their topological environments. Results indicate a high level of similarity between geometry and topology for different galaxy samples and no clear evidence of evolutionary trends in network measures. The distribution of local clustering coefficient C manifests three modes which allow for discrimination between stand-alone singlets and dumbbells (0 ≤ C ≤ 0.1), intermediately packed (0.1 < C < 0.9) and clique (0.9 ≤ C ≤ 1) like galaxies. Analysing astrophysical properties of galaxies (colour index and stellar masses), we show that distributions are similar in all slices, however weak evolutionary trends can also be seen across redshift slices. To specify different topological environments we have extracted selections of galaxies from each sample according to different modes of C distribution. We have found statistically significant associations between evolutionary parameters of galaxies and selections of C: the distribution of stellar mass for galaxies with interim C differ from the corresponding distributions for stand-alone and clique galaxies, and this difference holds for all redshift slices. The colour index realises somewhat different behaviour.

Evolutionary in Technology, Revolutionary in Impact

ERIC Educational Resources Information Center

Grush, Mary

2007-01-01

Ken Klingenstein has led national networking initiatives for the past 25 years. He served as director of computing and network services at the University of Colorado at Boulder from 1985-1999, and today, Klingenstein is director of middleware and security for Internet2. Truth is, this networking innovator has participated in the development of the…

Strain-weakening rheology of marine sponges and its evolutionary implication

NASA Astrophysics Data System (ADS)

Kraus, Emily; Janmey, Paul; Sweeney, Alison; van Oosten, Anne

Animal cells respond to mechanical stimuli as sensitively as they do to chemical stimuli. Further, cell proliferation is dependent on the viscoelasticity of the polymeric extracellular matrix (ECM) in which they are embedded. Biophysicists are therefore motivated to understand the biomechanics of the ECM itself. To date, this work has focused on the more familiar Bilateria, animals, including humans, with bilateral symmetry. The ECM of this group of animals is now understood to exhibit non-linear rheology that is typically strain- and compression-stiffening, and shear moduli that are frequency-dependent. These complex properties have been attributed to the semi-flexible nature of the underlying polymers. In contrast, we show that marine sponges are markedly strain-weakening under physiologically relevant conditions. Since sponges are a much earlier evolutionary branch than Bilateria, we interrogate the evolutionary potential and biochemical underpinnings of this novel complex rheology in filamentous networks, and cells ability to respond. Further, their life history strategy is uniquely dependent on flow and correlated shear stress, making them a model organism to study self-assembly algorithms organized around flow.

Hidden Markov models and other machine learning approaches in computational molecular biology

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baldi, P.

1995-12-31

This tutorial was one of eight tutorials selected to be presented at the Third International Conference on Intelligent Systems for Molecular Biology which was held in the United Kingdom from July 16 to 19, 1995. Computational tools are increasingly needed to process the massive amounts of data, to organize and classify sequences, to detect weak similarities, to separate coding from non-coding regions, and reconstruct the underlying evolutionary history. The fundamental problem in machine learning is the same as in scientific reasoning in general, as well as statistical modeling: to come up with a good model for the data. In thismore » tutorial four classes of models are reviewed. They are: Hidden Markov models; artificial Neural Networks; Belief Networks; and Stochastic Grammars. When dealing with DNA and protein primary sequences, Hidden Markov models are one of the most flexible and powerful alignments and data base searches. In this tutorial, attention is focused on the theory of Hidden Markov Models, and how to apply them to problems in molecular biology.« less

Bipartite Network Analysis of the Archaeal Virosphere: Evolutionary Connections between Viruses and Capsidless Mobile Elements.

PubMed

Iranzo, Jaime; Koonin, Eugene V; Prangishvili, David; Krupovic, Mart

2016-12-15

Archaea and particularly hyperthermophilic crenarchaea are hosts to many unusual viruses with diverse virion shapes and distinct gene compositions. As is typical of viruses in general, there are no universal genes in the archaeal virosphere. Therefore, to obtain a comprehensive picture of the evolutionary relationships between viruses, network analysis methods are more productive than traditional phylogenetic approaches. Here we present a comprehensive comparative analysis of genomes and proteomes from all currently known taxonomically classified and unclassified, cultivated and uncultivated archaeal viruses. We constructed a bipartite network of archaeal viruses that includes two classes of nodes, the genomes and gene families that connect them. Dissection of this network using formal community detection methods reveals strong modularity, with 10 distinct modules and 3 putative supermodules. However, compared to similar previously analyzed networks of eukaryotic and bacterial viruses, the archaeal virus network is sparsely connected. With the exception of the tailed viruses related to bacteriophages of the order Caudovirales and the families Turriviridae and Sphaerolipoviridae that are linked to a distinct supermodule of eukaryotic and bacterial viruses, there are few connector genes shared by different archaeal virus modules. In contrast, most of these modules include, in addition to viruses, capsidless mobile elements, emphasizing tight evolutionary connections between the two types of entities in archaea. The relative contributions of distinct evolutionary origins, in particular from nonviral elements, and insufficient sampling to the sparsity of the archaeal virus network remain to be determined by further exploration of the archaeal virosphere. Viruses infecting archaea are among the most mysterious denizens of the virosphere. Many of these viruses display no genetic or even morphological relationship to viruses of bacteria and eukaryotes, raising questions regarding their origins and position in the global virosphere. Analysis of 5,740 protein sequences from 116 genomes allowed dissection of the archaeal virus network and showed that most groups of archaeal viruses are evolutionarily connected to capsidless mobile genetic elements, including various plasmids and transposons. This finding could reflect actual independent origins of the distinct groups of archaeal viruses from different nonviral elements, providing important insights into the emergence and evolution of the archaeal virome. Copyright © 2016, American Society for Microbiology. All Rights Reserved.

Investigation of rat exploratory behavior via evolving artificial neural networks.

PubMed

Costa, Ariadne de Andrade; Tinós, Renato

2016-09-01

Neuroevolution comprises the use of evolutionary computation to define the architecture and/or to train artificial neural networks (ANNs). This strategy has been employed to investigate the behavior of rats in the elevated plus-maze, which is a widely used tool for studying anxiety in mice and rats. Here we propose a neuroevolutionary model, in which both the weights and the architecture of artificial neural networks (our virtual rats) are evolved by a genetic algorithm. This model is an improvement of a previous model that involves the evolution of just the weights of the ANN by the genetic algorithm. In order to compare both models, we analyzed traditional measures of anxiety behavior, like the time spent and the number of entries in both open and closed arms of the maze. When compared to real rat data, our findings suggest that the results from the model introduced here are statistically better than those from other models in the literature. In this way, the neuroevolution of architecture is clearly important for the development of the virtual rats. Moreover, this technique allowed the comprehension of the importance of different sensory units and different number of hidden neurons (performing as memory) in the ANNs (virtual rats). Copyright © 2016 Elsevier B.V. All rights reserved.

The improved business valuation model for RFID company based on the community mining method.

PubMed

Li, Shugang; Yu, Zhaoxu

2017-01-01

Nowadays, the appetite for the investment and mergers and acquisitions (M&A) activity in RFID companies is growing rapidly. Although the huge number of papers have addressed the topic of business valuation models based on statistical methods or neural network methods, only a few are dedicated to constructing a general framework for business valuation that improves the performance with network graph (NG) and the corresponding community mining (CM) method. In this study, an NG based business valuation model is proposed, where real options approach (ROA) integrating CM method is designed to predict the company's net profit as well as estimate the company value. Three improvements are made in the proposed valuation model: Firstly, our model figures out the credibility of the node belonging to each community and clusters the network according to the evolutionary Bayesian method. Secondly, the improved bacterial foraging optimization algorithm (IBFOA) is adopted to calculate the optimized Bayesian posterior probability function. Finally, in IBFOA, bi-objective method is used to assess the accuracy of prediction, and these two objectives are combined into one objective function using a new Pareto boundary method. The proposed method returns lower forecasting error than 10 well-known forecasting models on 3 different time interval valuing tasks for the real-life simulation of RFID companies.

The improved business valuation model for RFID company based on the community mining method

PubMed Central

Li, Shugang; Yu, Zhaoxu

2017-01-01

Nowadays, the appetite for the investment and mergers and acquisitions (M&A) activity in RFID companies is growing rapidly. Although the huge number of papers have addressed the topic of business valuation models based on statistical methods or neural network methods, only a few are dedicated to constructing a general framework for business valuation that improves the performance with network graph (NG) and the corresponding community mining (CM) method. In this study, an NG based business valuation model is proposed, where real options approach (ROA) integrating CM method is designed to predict the company’s net profit as well as estimate the company value. Three improvements are made in the proposed valuation model: Firstly, our model figures out the credibility of the node belonging to each community and clusters the network according to the evolutionary Bayesian method. Secondly, the improved bacterial foraging optimization algorithm (IBFOA) is adopted to calculate the optimized Bayesian posterior probability function. Finally, in IBFOA, bi-objective method is used to assess the accuracy of prediction, and these two objectives are combined into one objective function using a new Pareto boundary method. The proposed method returns lower forecasting error than 10 well-known forecasting models on 3 different time interval valuing tasks for the real-life simulation of RFID companies. PMID:28459815

Integration of Structural Dynamics and Molecular Evolution via Protein Interaction Networks: A New Era in Genomic Medicine

PubMed Central

Kumar, Avishek; Butler, Brandon M.; Kumar, Sudhir; Ozkan, S. Banu

2016-01-01

Summary Sequencing technologies are revealing many new non-synonymous single nucleotide variants (nsSNVs) in each personal exome. To assess their functional impacts, comparative genomics is frequently employed to predict if they are benign or not. However, evolutionary analysis alone is insufficient, because it misdiagnoses many disease-associated nsSNVs, such as those at positions involved in protein interfaces, and because evolutionary predictions do not provide mechanistic insights into functional change or loss. Structural analyses can aid in overcoming both of these problems by incorporating conformational dynamics and allostery in nSNV diagnosis. Finally, protein-protein interaction networks using systems-level methodologies shed light onto disease etiology and pathogenesis. Bridging these network approaches with structurally resolved protein interactions and dynamics will advance genomic medicine. PMID:26684487

Evolutionary image simplification for lung nodule classification with convolutional neural networks.

PubMed

Lückehe, Daniel; von Voigt, Gabriele

2018-05-29

Understanding decisions of deep learning techniques is important. Especially in the medical field, the reasons for a decision in a classification task are as crucial as the pure classification results. In this article, we propose a new approach to compute relevant parts of a medical image. Knowing the relevant parts makes it easier to understand decisions. In our approach, a convolutional neural network is employed to learn structures of images of lung nodules. Then, an evolutionary algorithm is applied to compute a simplified version of an unknown image based on the learned structures by the convolutional neural network. In the simplified version, irrelevant parts are removed from the original image. In the results, we show simplified images which allow the observer to focus on the relevant parts. In these images, more than 50% of the pixels are simplified. The simplified pixels do not change the meaning of the images based on the learned structures by the convolutional neural network. An experimental analysis shows the potential of the approach. Besides the examples of simplified images, we analyze the run time development. Simplified images make it easier to focus on relevant parts and to find reasons for a decision. The combination of an evolutionary algorithm employing a learned convolutional neural network is well suited for the simplification task. From a research perspective, it is interesting which areas of the images are simplified and which parts are taken as relevant.

Tradeoff between robustness and elaboration in carotenoid networks produces cycles of avian color diversification.

PubMed

Badyaev, Alexander V; Morrison, Erin S; Belloni, Virginia; Sanderson, Michael J

2015-08-20

Resolution of the link between micro- and macroevolution calls for comparing both processes on the same deterministic landscape, such as genomic, metabolic or fitness networks. We apply this perspective to the evolution of carotenoid pigmentation that produces spectacular diversity in avian colors and show that basic structural properties of the underlying carotenoid metabolic network are reflected in global patterns of elaboration and diversification in color displays. Birds color themselves by consuming and metabolizing several dietary carotenoids from the environment. Such fundamental dependency on the most upstream external compounds should intrinsically constrain sustained evolutionary elongation of multi-step metabolic pathways needed for color elaboration unless the metabolic network gains robustness - the ability to synthesize the same carotenoid from an additional dietary starting point. We found that gains and losses of metabolic robustness were associated with evolutionary cycles of elaboration and stasis in expressed carotenoids in birds. Lack of metabolic robustness constrained lineage's metabolic explorations to the immediate biochemical vicinity of their ecologically distinct dietary carotenoids, whereas gains of robustness repeatedly resulted in sustained elongation of metabolic pathways on evolutionary time scales and corresponding color elaboration. The structural link between length and robustness in metabolic pathways may explain periodic convergence of phylogenetically distant and ecologically distinct species in expressed carotenoid pigmentation; account for stasis in carotenoid colors in some ecological lineages; and show how the connectivity of the underlying metabolic network provides a mechanistic link between microevolutionary elaboration and macroevolutionary diversification.

Sparse cliques trump scale-free networks in coordination and competition

PubMed Central

Gianetto, David A.; Heydari, Babak

2016-01-01

Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game. PMID:26899456

Sparse cliques trump scale-free networks in coordination and competition

NASA Astrophysics Data System (ADS)

Gianetto, David A.; Heydari, Babak

2016-02-01

Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game.

The vertebrate Hox gene regulatory network for hindbrain segmentation: Evolution and diversification: Coupling of a Hox gene regulatory network to hindbrain segmentation is an ancient trait originating at the base of vertebrates.

PubMed

Parker, Hugo J; Bronner, Marianne E; Krumlauf, Robb

2016-06-01

Hindbrain development is orchestrated by a vertebrate gene regulatory network that generates segmental patterning along the anterior-posterior axis via Hox genes. Here, we review analyses of vertebrate and invertebrate chordate models that inform upon the evolutionary origin and diversification of this network. Evidence from the sea lamprey reveals that the hindbrain regulatory network generates rhombomeric compartments with segmental Hox expression and an underlying Hox code. We infer that this basal feature was present in ancestral vertebrates and, as an evolutionarily constrained developmental state, is fundamentally important for patterning of the vertebrate hindbrain across diverse lineages. Despite the common ground plan, vertebrates exhibit neuroanatomical diversity in lineage-specific patterns, with different vertebrates revealing variations of Hox expression in the hindbrain that could underlie this diversification. Invertebrate chordates lack hindbrain segmentation but exhibit some conserved aspects of this network, with retinoic acid signaling playing a role in establishing nested domains of Hox expression. © 2016 WILEY Periodicals, Inc.

Evolutionarily Repurposed Networks Reveal the Well-Known Antifungal Drug Thiabendazole to Be a Novel Vascular Disrupting Agent

PubMed Central

Cha, Hye Ji; Byrom, Michelle; Mead, Paul E.; Ellington, Andrew D.; Wallingford, John B.; Marcotte, Edward M.

2012-01-01

Studies in diverse organisms have revealed a surprising depth to the evolutionary conservation of genetic modules. For example, a systematic analysis of such conserved modules has recently shown that genes in yeast that maintain cell walls have been repurposed in vertebrates to regulate vein and artery growth. We reasoned that by analyzing this particular module, we might identify small molecules targeting the yeast pathway that also act as angiogenesis inhibitors suitable for chemotherapy. This insight led to the finding that thiabendazole, an orally available antifungal drug in clinical use for 40 years, also potently inhibits angiogenesis in animal models and in human cells. Moreover, in vivo time-lapse imaging revealed that thiabendazole reversibly disassembles newly established blood vessels, marking it as vascular disrupting agent (VDA) and thus as a potential complementary therapeutic for use in combination with current anti-angiogenic therapies. Importantly, we also show that thiabendazole slows tumor growth and decreases vascular density in preclinical fibrosarcoma xenografts. Thus, an exploration of the evolutionary repurposing of gene networks has led directly to the identification of a potential new therapeutic application for an inexpensive drug that is already approved for clinical use in humans. PMID:22927795

Species mtDNA genetic diversity explained by infrapopulation size in a host-symbiont system.

PubMed

Doña, Jorge; Moreno-García, Marina; Criscione, Charles D; Serrano, David; Jovani, Roger

2015-12-01

Understanding what shapes variation in genetic diversity among species remains a major challenge in evolutionary ecology, and it has been seldom studied in parasites and other host-symbiont systems. Here, we studied mtDNA variation in a host-symbiont non-model system: 418 individual feather mites from 17 feather mite species living on 17 different passerine bird species. We explored how a surrogate of census size, the median infrapopulation size (i.e., the median number of individual parasites per infected host individual), explains mtDNA genetic diversity. Feather mite species genetic diversity was positively correlated with mean infrapopulation size, explaining 34% of the variation. As expected from the biology of feather mites, we found bottleneck signatures for most of the species studied but, in particular, three species presented extremely low mtDNA diversity values given their infrapopulation size. Their star-like haplotype networks (in contrast with more reticulated networks for the other species) suggested that their low genetic diversity was the consequence of severe bottlenecks or selective sweeps. Our study shows for the first time that mtDNA diversity can be explained by infrapopulation sizes, and suggests that departures from this relationship could be informative of underlying ecological and evolutionary processes.

Evolutionary approaches to cultural and linguistic diversity.

PubMed

Steele, James; Jordan, Peter; Cochrane, Ethan

2010-12-12

Evolutionary approaches to cultural change are increasingly influential, and many scientists believe that a 'grand synthesis' is now in sight. The papers in this Theme Issue, which derives from a symposium held by the AHRC Centre for the Evolution of Cultural Diversity (University College London) in December 2008, focus on how the phylogenetic tree-building and network-based techniques used to estimate descent relationships in biology can be adapted to reconstruct cultural histories, where some degree of inter-societal diffusion will almost inevitably be superimposed on any deeper signal of a historical branching process. The disciplines represented include the three most purely 'cultural' fields from the four-field model of anthropology (cultural anthropology, archaeology and linguistic anthropology). In this short introduction, some context is provided from the history of anthropology, and key issues raised by the papers are highlighted.

Evolutionary approaches to cultural and linguistic diversity

PubMed Central

Steele, James; Jordan, Peter; Cochrane, Ethan

2010-01-01

Evolutionary approaches to cultural change are increasingly influential, and many scientists believe that a ‘grand synthesis’ is now in sight. The papers in this Theme Issue, which derives from a symposium held by the AHRC Centre for the Evolution of Cultural Diversity (University College London) in December 2008, focus on how the phylogenetic tree-building and network-based techniques used to estimate descent relationships in biology can be adapted to reconstruct cultural histories, where some degree of inter-societal diffusion will almost inevitably be superimposed on any deeper signal of a historical branching process. The disciplines represented include the three most purely ‘cultural’ fields from the four-field model of anthropology (cultural anthropology, archaeology and linguistic anthropology). In this short introduction, some context is provided from the history of anthropology, and key issues raised by the papers are highlighted. PMID:21041203

CROSS-DISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY: Evolutionary Self-Questioning Games with Local Contribution

NASA Astrophysics Data System (ADS)

Liu, Yong-Kui; Li, Zhi; Chen, Xiao-Jie; Wang, Long

2009-08-01

We investigate the evolutionary Prisoner's Dilemma and the Snowdrift Game on small-world networks in a realistic social context where individuals consider their local contributions to their group and update their strategies by self-questioning. An individual with introspection can determine whether its current strategy is superior by playing a virtual round of the game and its local contribution is defined as the sum of all the payoffs its neighbors collect against it. In our model, the performance of an individual is determined by both its payoff and local contribution through a linear combination. We demonstrate that the present mechanism can produce very robust cooperative behavior in both games. Furthermore, we provide theoretical analysis based on mean-field approximation, and find that the analytical predictions are qualitatively consistent with the simulation results.

Gene regulatory and signaling networks exhibit distinct topological distributions of motifs

NASA Astrophysics Data System (ADS)

Ferreira, Gustavo Rodrigues; Nakaya, Helder Imoto; Costa, Luciano da Fontoura

2018-04-01

The biological processes of cellular decision making and differentiation involve a plethora of signaling pathways and gene regulatory circuits. These networks in turn exhibit a multitude of motifs playing crucial parts in regulating network activity. Here we compare the topological placement of motifs in gene regulatory and signaling networks and observe that it suggests different evolutionary strategies in motif distribution for distinct cellular subnetworks.

An exploration of alternative visualisations of the basic helix-loop-helix protein interaction network

PubMed Central

Holden, Brian J; Pinney, John W; Lovell, Simon C; Amoutzias, Grigoris D; Robertson, David L

2007-01-01

Background Alternative representations of biochemical networks emphasise different aspects of the data and contribute to the understanding of complex biological systems. In this study we present a variety of automated methods for visualisation of a protein-protein interaction network, using the basic helix-loop-helix (bHLH) family of transcription factors as an example. Results Network representations that arrange nodes (proteins) according to either continuous or discrete information are investigated, revealing the existence of protein sub-families and the retention of interactions following gene duplication events. Methods of network visualisation in conjunction with a phylogenetic tree are presented, highlighting the evolutionary relationships between proteins, and clarifying the context of network hubs and interaction clusters. Finally, an optimisation technique is used to create a three-dimensional layout of the phylogenetic tree upon which the protein-protein interactions may be projected. Conclusion We show that by incorporating secondary genomic, functional or phylogenetic information into network visualisation, it is possible to move beyond simple layout algorithms based on network topology towards more biologically meaningful representations. These new visualisations can give structure to complex networks and will greatly help in interpreting their evolutionary origins and functional implications. Three open source software packages (InterView, TVi and OptiMage) implementing our methods are available. PMID:17683601

Evolutionary history of the recruitment of conserved developmental genes in association to the formation and diversification of a novel trait.

PubMed

Shirai, Leila T; Saenko, Suzanne V; Keller, Roberto A; Jerónimo, Maria A; Brakefield, Paul M; Descimon, Henri; Wahlberg, Niklas; Beldade, Patrícia

2012-02-15

The origin and modification of novel traits are important aspects of biological diversification. Studies combining concepts and approaches of developmental genetics and evolutionary biology have uncovered many examples of the recruitment, or co-option, of genes conserved across lineages for the formation of novel, lineage-restricted traits. However, little is known about the evolutionary history of the recruitment of those genes, and of the relationship between them -for example, whether the co-option involves whole or parts of existing networks, or whether it occurs by redeployment of individual genes with de novo rewiring. We use a model novel trait, color pattern elements on butterfly wings called eyespots, to explore these questions. Eyespots have greatly diversified under natural and sexual selection, and their formation involves genetic circuitries shared across insects. We investigated the evolutionary history of the recruitment and co-recruitment of four conserved transcription regulators to the larval wing disc region where circular pattern elements develop. The co-localization of Antennapedia, Notch, Distal-less, and Spalt with presumptive (eye)spot organizers was examined in 13 butterfly species, providing the largest comparative dataset available for the system. We found variation between families, between subfamilies, and between tribes. Phylogenetic reconstructions by parsimony and maximum likelihood methods revealed an unambiguous evolutionary history only for Antennapedia, with a resolved single origin of eyespot-associated expression, and many homoplastic events for Notch, Distal-less, and Spalt. The flexibility in the (co-)recruitment of the targeted genes includes cases where different gene combinations are associated with morphologically similar eyespots, as well as cases where identical protein combinations are associated with very different phenotypes. The evolutionary history of gene (co-)recruitment is consistent with both divergence from a recruited putative ancestral network, and with independent co-option of individual genes. The diversity in the combinations of genes expressed in association with eyespot formation does not parallel diversity in characteristics of the adult phenotype. We discuss these results in the context of inferring homology. Our study underscores the importance of widening the representation of phylogenetic, morphological, and genetic diversity in order to establish general principles about the mechanisms behind the evolution of novel traits.

Cognitive Architecture with Evolutionary Dynamics Solves Insight Problem.

PubMed

Fedor, Anna; Zachar, István; Szilágyi, András; Öllinger, Michael; de Vladar, Harold P; Szathmáry, Eörs

2017-01-01

In this paper, we show that a neurally implemented a cognitive architecture with evolutionary dynamics can solve the four-tree problem. Our model, called Darwinian Neurodynamics, assumes that the unconscious mechanism of problem solving during insight tasks is a Darwinian process. It is based on the evolution of patterns that represent candidate solutions to a problem, and are stored and reproduced by a population of attractor networks. In our first experiment, we used human data as a benchmark and showed that the model behaves comparably to humans: it shows an improvement in performance if it is pretrained and primed appropriately, just like human participants in Kershaw et al. (2013)'s experiment. In the second experiment, we further investigated the effects of pretraining and priming in a two-by-two design and found a beginner's luck type of effect: solution rate was highest in the condition that was primed, but not pretrained with patterns relevant for the task. In the third experiment, we showed that deficits in computational capacity and learning abilities decreased the performance of the model, as expected. We conclude that Darwinian Neurodynamics is a promising model of human problem solving that deserves further investigation.

Cognitive Architecture with Evolutionary Dynamics Solves Insight Problem

PubMed Central

Fedor, Anna; Zachar, István; Szilágyi, András; Öllinger, Michael; de Vladar, Harold P.; Szathmáry, Eörs

2017-01-01

In this paper, we show that a neurally implemented a cognitive architecture with evolutionary dynamics can solve the four-tree problem. Our model, called Darwinian Neurodynamics, assumes that the unconscious mechanism of problem solving during insight tasks is a Darwinian process. It is based on the evolution of patterns that represent candidate solutions to a problem, and are stored and reproduced by a population of attractor networks. In our first experiment, we used human data as a benchmark and showed that the model behaves comparably to humans: it shows an improvement in performance if it is pretrained and primed appropriately, just like human participants in Kershaw et al. (2013)'s experiment. In the second experiment, we further investigated the effects of pretraining and priming in a two-by-two design and found a beginner's luck type of effect: solution rate was highest in the condition that was primed, but not pretrained with patterns relevant for the task. In the third experiment, we showed that deficits in computational capacity and learning abilities decreased the performance of the model, as expected. We conclude that Darwinian Neurodynamics is a promising model of human problem solving that deserves further investigation. PMID:28405191

Scale-dependent genetic structure of the Idaho giant salamander (Dicamptodon aterrimus) in stream networks.

PubMed

Mullen, Lindy B; Arthur Woods, H; Schwartz, Michael K; Sepulveda, Adam J; Lowe, Winsor H

2010-03-01

The network architecture of streams and rivers constrains evolutionary, demographic and ecological processes of freshwater organisms. This consistent architecture also makes stream networks useful for testing general models of population genetic structure and the scaling of gene flow. We examined genetic structure and gene flow in the facultatively paedomorphic Idaho giant salamander, Dicamptodon aterrimus, in stream networks of Idaho and Montana, USA. We used microsatellite data to test population structure models by (i) examining hierarchical partitioning of genetic variation in stream networks; and (ii) testing for genetic isolation by distance along stream corridors vs. overland pathways. Replicated sampling of streams within catchments within three river basins revealed that hierarchical scale had strong effects on genetic structure and gene flow. amova identified significant structure at all hierarchical scales (among streams, among catchments, among basins), but divergence among catchments had the greatest structural influence. Isolation by distance was detected within catchments, and in-stream distance was a strong predictor of genetic divergence. Patterns of genetic divergence suggest that differentiation among streams within catchments was driven by limited migration, consistent with a stream hierarchy model of population structure. However, there was no evidence of migration among catchments within basins, or among basins, indicating that gene flow only counters the effects of genetic drift at smaller scales (within rather than among catchments). These results show the strong influence of stream networks on population structure and genetic divergence of a salamander, with contrasting effects at different hierarchical scales.

The social brain: scale-invariant layering of Erdős-Rényi networks in small-scale human societies.

PubMed

Harré, Michael S; Prokopenko, Mikhail

2016-05-01

The cognitive ability to form social links that can bind individuals together into large cooperative groups for safety and resource sharing was a key development in human evolutionary and social history. The 'social brain hypothesis' argues that the size of these social groups is based on a neurologically constrained capacity for maintaining long-term stable relationships. No model to date has been able to combine a specific socio-cognitive mechanism with the discrete scale invariance observed in ethnographic studies. We show that these properties result in nested layers of self-organizing Erdős-Rényi networks formed by each individual's ability to maintain only a small number of social links. Each set of links plays a specific role in the formation of different social groups. The scale invariance in our model is distinct from previous 'scale-free networks' studied using much larger social groups; here, the scale invariance is in the relationship between group sizes, rather than in the link degree distribution. We also compare our model with a dominance-based hierarchy and conclude that humans were probably egalitarian in hunter-gatherer-like societies, maintaining an average maximum of four or five social links connecting all members in a largest social network of around 132 people. © 2016 The Author(s).

The many faces of graph dynamics

NASA Astrophysics Data System (ADS)

Pignolet, Yvonne Anne; Roy, Matthieu; Schmid, Stefan; Tredan, Gilles

2017-06-01

The topological structure of complex networks has fascinated researchers for several decades, resulting in the discovery of many universal properties and reoccurring characteristics of different kinds of networks. However, much less is known today about the network dynamics: indeed, complex networks in reality are not static, but rather dynamically evolve over time. Our paper is motivated by the empirical observation that network evolution patterns seem far from random, but exhibit structure. Moreover, the specific patterns appear to depend on the network type, contradicting the existence of a ‘one fits it all’ model. However, we still lack observables to quantify these intuitions, as well as metrics to compare graph evolutions. Such observables and metrics are needed for extrapolating or predicting evolutions, as well as for interpolating graph evolutions. To explore the many faces of graph dynamics and to quantify temporal changes, this paper suggests to build upon the concept of centrality, a measure of node importance in a network. In particular, we introduce the notion of centrality distance, a natural similarity measure for two graphs which depends on a given centrality, characterizing the graph type. Intuitively, centrality distances reflect the extent to which (non-anonymous) node roles are different or, in case of dynamic graphs, have changed over time, between two graphs. We evaluate the centrality distance approach for five evolutionary models and seven real-world social and physical networks. Our results empirically show the usefulness of centrality distances for characterizing graph dynamics compared to a null-model of random evolution, and highlight the differences between the considered scenarios. Interestingly, our approach allows us to compare the dynamics of very different networks, in terms of scale and evolution speed.

Sensitivity Analysis of Genetic Algorithm Parameters for Optimal Groundwater Monitoring Network Design

NASA Astrophysics Data System (ADS)

Abdeh-Kolahchi, A.; Satish, M.; Datta, B.

2004-05-01

A state art groundwater monitoring network design is introduced. The method combines groundwater flow and transport results with optimization Genetic Algorithm (GA) to identify optimal monitoring well locations. Optimization theory uses different techniques to find a set of parameter values that minimize or maximize objective functions. The suggested groundwater optimal monitoring network design is based on the objective of maximizing the probability of tracking a transient contamination plume by determining sequential monitoring locations. The MODFLOW and MT3DMS models included as separate modules within the Groundwater Modeling System (GMS) are used to develop three dimensional groundwater flow and contamination transport simulation. The groundwater flow and contamination simulation results are introduced as input to the optimization model, using Genetic Algorithm (GA) to identify the groundwater optimal monitoring network design, based on several candidate monitoring locations. The groundwater monitoring network design model is used Genetic Algorithms with binary variables representing potential monitoring location. As the number of decision variables and constraints increase, the non-linearity of the objective function also increases which make difficulty to obtain optimal solutions. The genetic algorithm is an evolutionary global optimization technique, which is capable of finding the optimal solution for many complex problems. In this study, the GA approach capable of finding the global optimal solution to a groundwater monitoring network design problem involving 18.4X 1018 feasible solutions will be discussed. However, to ensure the efficiency of the solution process and global optimality of the solution obtained using GA, it is necessary that appropriate GA parameter values be specified. The sensitivity analysis of genetic algorithms parameters such as random number, crossover probability, mutation probability, and elitism are discussed for solution of monitoring network design.

Back to the future: Rational maps for exploring acetylcholine receptor space and time.

PubMed

Tessier, Christian J G; Emlaw, Johnathon R; Cao, Zhuo Qian; Pérez-Areales, F Javier; Salameh, Jean-Paul J; Prinston, Jethro E; McNulty, Melissa S; daCosta, Corrie J B

2017-11-01

Global functions of nicotinic acetylcholine receptors, such as subunit cooperativity and compatibility, likely emerge from a network of amino acid residues distributed across the entire pentameric complex. Identification of such networks has stymied traditional approaches to acetylcholine receptor structure and function, likely due to the cryptic interdependency of their underlying amino acid residues. An emerging evolutionary biochemistry approach, which traces the evolutionary history of acetylcholine receptor subunits, allows for rational mapping of acetylcholine receptor sequence space, and offers new hope for uncovering the amino acid origins of these enigmatic properties. Copyright © 2017 Elsevier B.V. All rights reserved.

Simultaneous learning of instantaneous and time-delayed genetic interactions using novel information theoretic scoring technique

PubMed Central

2012-01-01

Background Understanding gene interactions is a fundamental question in systems biology. Currently, modeling of gene regulations using the Bayesian Network (BN) formalism assumes that genes interact either instantaneously or with a certain amount of time delay. However in reality, biological regulations, both instantaneous and time-delayed, occur simultaneously. A framework that can detect and model both these two types of interactions simultaneously would represent gene regulatory networks more accurately. Results In this paper, we introduce a framework based on the Bayesian Network (BN) formalism that can represent both instantaneous and time-delayed interactions between genes simultaneously. A novel scoring metric having firm mathematical underpinnings is also proposed that, unlike other recent methods, can score both interactions concurrently and takes into account the reality that multiple regulators can regulate a gene jointly, rather than in an isolated pair-wise manner. Further, a gene regulatory network (GRN) inference method employing an evolutionary search that makes use of the framework and the scoring metric is also presented. Conclusion By taking into consideration the biological fact that both instantaneous and time-delayed regulations can occur among genes, our approach models gene interactions with greater accuracy. The proposed framework is efficient and can be used to infer gene networks having multiple orders of instantaneous and time-delayed regulations simultaneously. Experiments are carried out using three different synthetic networks (with three different mechanisms for generating synthetic data) as well as real life networks of Saccharomyces cerevisiae, E. coli and cyanobacteria gene expression data. The results show the effectiveness of our approach. PMID:22691450

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

PubMed Central

Tonelli, Paul; Mouret, Jean-Baptiste

2013-01-01

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. PMID:24236099

Getting a better picture of microbial evolution en route to a network of genomes.

PubMed

Dagan, Tal; Martin, William

2009-08-12

Most current thinking about evolution is couched in the concept of trees. The notion of a tree with recursively bifurcating branches representing recurrent divergence events is a plausible metaphor to describe the evolution of multicellular organisms like vertebrates or land plants. But if we try to force the tree metaphor onto the whole of the evolutionary process, things go badly awry, because the more closely we inspect microbial genomes through the looking glass of gene and genome sequence comparisons, the smaller the amount of the data that fits the concept of a bifurcating tree becomes. That is mainly because among microbes, endosymbiosis and lateral gene transfer are important, two mechanisms of natural variation that differ from the kind of natural variation that Darwin had in mind. For such reasons, when it comes to discussing the relationships among all living things, that is, including the microbes and all of their genes rather than just one or a select few, many biologists are now beginning to talk about networks rather than trees in the context of evolutionary relationships among microbial chromosomes. But talk is not enough. If we were to actually construct networks instead of trees to describe the evolutionary process, what would they look like? Here we consider endosymbiosis and an example of a network of genomes involving 181 sequenced prokaryotes and how that squares off with some ideas about early cell evolution.

Analysis of the impact of crude oil price fluctuations on China's stock market in different periods-Based on time series network model

NASA Astrophysics Data System (ADS)

An, Yang; Sun, Mei; Gao, Cuixia; Han, Dun; Li, Xiuming

2018-02-01

This paper studies the influence of Brent oil price fluctuations on the stock prices of China's two distinct blocks, namely, the petrochemical block and the electric equipment and new energy block, applying the Shannon entropy of information theory. The co-movement trend of crude oil price and stock prices is divided into different fluctuation patterns with the coarse-graining method. Then, the bivariate time series network model is established for the two blocks stock in five different periods. By joint analysis of the network-oriented metrics, the key modes and underlying evolutionary mechanisms were identified. The results show that the both networks have different fluctuation characteristics in different periods. Their co-movement patterns are clustered in some key modes and conversion intermediaries. The study not only reveals the lag effect of crude oil price fluctuations on the stock in Chinese industry blocks but also verifies the necessity of research on special periods, and suggests that the government should use different energy policies to stabilize market volatility in different periods. A new way is provided to study the unidirectional influence between multiple variables or complex time series.

Phylogenetic Network Analysis Revealed the Occurrence of Horizontal Gene Transfer of 16S rRNA in the Genus Enterobacter

PubMed Central

Sato, Mitsuharu; Miyazaki, Kentaro

2017-01-01

Horizontal gene transfer (HGT) is a ubiquitous genetic event in bacterial evolution, but it seldom occurs for genes involved in highly complex supramolecules (or biosystems), which consist of many gene products. The ribosome is one such supramolecule, but several bacteria harbor dissimilar and/or chimeric 16S rRNAs in their genomes, suggesting the occurrence of HGT of this gene. However, we know little about whether the genes actually experience HGT and, if so, the frequency of such a transfer. This is primarily because the methods currently employed for phylogenetic analysis (e.g., neighbor-joining, maximum likelihood, and maximum parsimony) of 16S rRNA genes assume point mutation-driven tree-shape evolution as an evolutionary model, which is intrinsically inappropriate to decipher the evolutionary history for genes driven by recombination. To address this issue, we applied a phylogenetic network analysis, which has been used previously for detection of genetic recombination in homologous alleles, to the 16S rRNA gene. We focused on the genus Enterobacter, whose phylogenetic relationships inferred by multi-locus sequence alignment analysis and 16S rRNA sequences are incompatible. All 10 complete genomic sequences were retrieved from the NCBI database, in which 71 16S rRNA genes were included. Neighbor-joining analysis demonstrated that the genes residing in the same genomes clustered, indicating the occurrence of intragenomic recombination. However, as suggested by the low bootstrap values, evolutionary relationships between the clusters were uncertain. We then applied phylogenetic network analysis to representative sequences from each cluster. We found three ancestral 16S rRNA groups; the others were likely created through recursive recombination between the ancestors and chimeric descendants. Despite the large sequence changes caused by the recombination events, the RNA secondary structures were conserved. Successive intergenomic and intragenomic recombination thus shaped the evolution of 16S rRNA genes in the genus Enterobacter. PMID:29180992

Effective seeding strategy in evolutionary prisoner's dilemma games on online social networks

NASA Astrophysics Data System (ADS)

Xu, Bo; Shi, Huibin; Wang, Jianwei; Huang, Yun

2015-04-01

This paper explores effective seeding strategies in prisoner's dilemma game (PDG) on online social networks, i.e. the optimal strategy to obtain global cooperation with minimum cost. Three distinct seeding strategies are compared by performing computer simulations on real online social network datasets. Our finding suggests that degree centrality seeding outperforms other strategies regardless of the initial payoff setting or network size. Celebrities of online social networks play key roles in preserving cooperation.

An algebra-based method for inferring gene regulatory networks

PubMed Central

2014-01-01

Background The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. Results This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the dynamic patterns present in the network. Conclusions Boolean polynomial dynamical systems provide a powerful modeling framework for the reverse engineering of gene regulatory networks, that enables a rich mathematical structure on the model search space. A C++ implementation of the method, distributed under LPGL license, is available, together with the source code, at http://www.paola-vera-licona.net/Software/EARevEng/REACT.html. PMID:24669835

Game Theory Meets Wireless Sensor Networks Security Requirements and Threats Mitigation: A Survey

PubMed Central

Abdalzaher, Mohamed S.; Seddik, Karim; Elsabrouty, Maha; Muta, Osamu; Furukawa, Hiroshi; Abdel-Rahman, Adel

2016-01-01

We present a study of using game theory for protecting wireless sensor networks (WSNs) from selfish behavior or malicious nodes. Due to scalability, low complexity and disseminated nature of WSNs, malicious attacks can be modeled effectively using game theory. In this study, we survey the different game-theoretic defense strategies for WSNs. We present a taxonomy of the game theory approaches based on the nature of the attack, whether it is caused by an external attacker or it is the result of an internal node acting selfishly or maliciously. We also present a general trust model using game theory for decision making. We, finally, identify the significant role of evolutionary games for WSNs security against intelligent attacks; then, we list several prospect applications of game theory to enhance the data trustworthiness and node cooperation in different WSNs. PMID:27367700

Robustness and flexibility in nematode vulva development.

PubMed

Félix, Marie-Anne; Barkoulas, Michalis

2012-04-01

The Caenorhabditis elegans vulva has served as a paradigm for how conserved developmental pathways, such as EGF-Ras-MAPK, Notch and Wnt signaling, participate in networks driving animal organogenesis. Here, we discuss an emerging direction in the field, which places vulva research in a quantitative and microevolutionary framework. The final vulval cell fate pattern is known to be robust to change, but only recently has the variation of vulval traits been measured under stochastic, environmental or genetic variation. Whereas the resulting cell fate pattern is invariant among rhabditid nematodes, recent studies indicate that the developmental system has accumulated cryptic variation, even among wild C. elegans isolates. Quantitative differences in the signaling network have emerged through experiments and modeling as the driving force behind cryptic variation in Caenorhabditis species. On a wider evolutionary scale, the establishment of new model species has informed about the presence of qualitative variation in vulval signaling pathways. Copyright © 2012 Elsevier Ltd. All rights reserved.

Origin and diversification of the basic helix-loop-helix gene family in metazoans: insights from comparative genomics

PubMed Central

Simionato, Elena; Ledent, Valérie; Richards, Gemma; Thomas-Chollier, Morgane; Kerner, Pierre; Coornaert, David; Degnan, Bernard M; Vervoort, Michel

2007-01-01

Background Molecular and genetic analyses conducted in model organisms such as Drosophila and vertebrates, have provided a wealth of information about how networks of transcription factors control the proper development of these species. Much less is known, however, about the evolutionary origin of these elaborated networks and their large-scale evolution. Here we report the first evolutionary analysis of a whole superfamily of transcription factors, the basic helix-loop-helix (bHLH) proteins, at the scale of the whole metazoan kingdom. Results We identified in silico the putative full complement of bHLH genes in the sequenced genomes of 12 different species representative of the main metazoan lineages, including three non-bilaterian metazoans, the cnidarians Nematostella vectensis and Hydra magnipapillata and the demosponge Amphimedon queenslandica. We have performed extensive phylogenetic analyses of the 695 identified bHLHs, which has allowed us to allocate most of these bHLHs to defined evolutionary conserved groups of orthology. Conclusion Three main features in the history of the bHLH gene superfamily can be inferred from these analyses: (i) an initial diversification of the bHLHs has occurred in the pre-Cambrian, prior to metazoan cladogenesis; (ii) a second expansion of the bHLH superfamily occurred early in metazoan evolution before bilaterians and cnidarians diverged; and (iii) the bHLH complement during the evolution of the bilaterians has been remarkably stable. We suggest that these features may be extended to other developmental gene families and reflect a general trend in the evolution of the developmental gene repertoires of metazoans. PMID:17335570

Evolutionary Developmental Biology (Evo-Devo) Research in Latin America.

PubMed

Marcellini, Sylvain; González, Favio; Sarrazin, Andres F; Pabón-Mora, Natalia; Benítez, Mariana; Piñeyro-Nelson, Alma; Rezende, Gustavo L; Maldonado, Ernesto; Schneider, Patricia Neiva; Grizante, Mariana B; Da Fonseca, Rodrigo Nunes; Vergara-Silva, Francisco; Suaza-Gaviria, Vanessa; Zumajo-Cardona, Cecilia; Zattara, Eduardo E; Casasa, Sofia; Suárez-Baron, Harold; Brown, Federico D

2017-01-01

Famous for its blind cavefish and Darwin's finches, Latin America is home to some of the richest biodiversity hotspots of our planet. The Latin American fauna and flora inspired and captivated naturalists from the nineteenth and twentieth centuries, including such notable pioneers such as Fritz Müller, Florentino Ameghino, and Léon Croizat who made a significant contribution to the study of embryology and evolutionary thinking. But, what are the historical and present contributions of the Latin American scientific community to Evo-Devo? Here, we provide the first comprehensive overview of the Evo-Devo laboratories based in Latin America and describe current lines of research based on endemic species, focusing on body plans and patterning, systematics, physiology, computational modeling approaches, ecology, and domestication. Literature searches reveal that Evo-Devo in Latin America is still in its early days; while showing encouraging indicators of productivity, it has not stabilized yet, because it relies on few and sparsely distributed laboratories. Coping with the rapid changes in national scientific policies and contributing to solve social and health issues specific to each region are among the main challenges faced by Latin American researchers. The 2015 inaugural meeting of the Pan-American Society for Evolutionary Developmental Biology played a pivotal role in bringing together Latin American researchers eager to initiate and consolidate regional and worldwide collaborative networks. Such networks will undoubtedly advance research on the extremely high genetic and phenotypic biodiversity of Latin America, bound to be an almost infinite source of amazement and fascinating findings for the Evo-Devo community. © 2016 Wiley Periodicals, Inc.

Ongoing resolution of duplicate gene functions shapes the diversification of a metabolic network

PubMed Central

Kuang, Meihua Christina; Hutchins, Paul D; Russell, Jason D; Coon, Joshua J; Hittinger, Chris Todd

2016-01-01

The evolutionary mechanisms leading to duplicate gene retention are well understood, but the long-term impacts of paralog differentiation on the regulation of metabolism remain underappreciated. Here we experimentally dissect the functions of two pairs of ancient paralogs of the GALactose sugar utilization network in two yeast species. We show that the Saccharomyces uvarum network is more active, even as over-induction is prevented by a second co-repressor that the model yeast Saccharomyces cerevisiae lacks. Surprisingly, removal of this repression system leads to a strong growth arrest, likely due to overly rapid galactose catabolism and metabolic overload. Alternative sugars, such as fructose, circumvent metabolic control systems and exacerbate this phenotype. We further show that S. cerevisiae experiences homologous metabolic constraints that are subtler due to how the paralogs have diversified. These results show how the functional differentiation of paralogs continues to shape regulatory network architectures and metabolic strategies long after initial preservation. DOI: http://dx.doi.org/10.7554/eLife.19027.001 PMID:27690225

Understanding regulatory networks requires more than computing a multitude of graph statistics. Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O.C. Martin et al.

NASA Astrophysics Data System (ADS)

Tkačik, Gašper

2016-07-01

The article by O. Martin and colleagues provides a much needed systematic review of a body of work that relates the topological structure of genetic regulatory networks to evolutionary selection for function. This connection is very important. Using the current wealth of genomic data, statistical features of regulatory networks (e.g., degree distributions, motif composition, etc.) can be quantified rather easily; it is, however, often unclear how to interpret the results. On a graph theoretic level the statistical significance of the results can be evaluated by comparing observed graphs to ;randomized; ones (bravely ignoring the issue of how precisely to randomize!) and comparing the frequency of appearance of a particular network structure relative to a randomized null expectation. While this is a convenient operational test for statistical significance, its biological meaning is questionable. In contrast, an in-silico genotype-to-phenotype model makes explicit the assumptions about the network function, and thus clearly defines the expected network structures that can be compared to the case of no selection for function and, ultimately, to data.

Pattern Formation on Networks: from Localised Activity to Turing Patterns

PubMed Central

McCullen, Nick; Wagenknecht, Thomas

2016-01-01

Networks of interactions between competing species are used to model many complex systems, such as in genetics, evolutionary biology or sociology and knowledge of the patterns of activity they can exhibit is important for understanding their behaviour. The emergence of patterns on complex networks with reaction-diffusion dynamics is studied here, where node dynamics interact via diffusion via the network edges. Through the application of a generalisation of dynamical systems analysis this work reveals a fundamental connection between small-scale modes of activity on networks and localised pattern formation seen throughout science, such as solitons, breathers and localised buckling. The connection between solutions with a single and small numbers of activated nodes and the fully developed system-scale patterns are investigated computationally using numerical continuation methods. These techniques are also used to help reveal a much larger portion of of the full number of solutions that exist in the system at different parameter values. The importance of network structure is also highlighted, with a key role being played by nodes with a certain so-called optimal degree, on which the interaction between the reaction kinetics and the network structure organise the behaviour of the system. PMID:27273339

The evolution of communities in the international oil trade network

NASA Astrophysics Data System (ADS)

Zhong, Weiqiong; An, Haizhong; Gao, Xiangyun; Sun, Xiaoqi

2014-11-01

International oil trade is a subset of global trade and there exist oil trade communities. These communities evolve over time and provide clues of international oil trade patterns. A better understanding of the international oil trade patterns is necessary for governments in policy making. To study the evolution of trade communities in the international oil trade network, we set up unweighted and weighted oil trade network models based on complex network theory using data from 2002 to 2011. We detected the communities in the oil trade networks and analyzed their evolutionary properties and stabilities over time. We found that the unweighted and weighted international oil trade networks show many different features in terms of community number, community scale, distribution of countries, quality of partitions, and stability of communities. Two turning points occurred in the evolution of community stability in the international oil trade network. One is the year 2004-2005 which correlates with changes in demand and supply in the world oil market after the Iraq War, and the other is the year 2008-2009 which is connected to the 2008 financial crisis. Different causations of instability show different features and this should be considered by policy makers.

Cooperation among cancer cells as public goods games on Voronoi networks.

PubMed

Archetti, Marco

2016-05-07

Cancer cells produce growth factors that diffuse and sustain tumour proliferation, a form of cooperation that can be studied using mathematical models of public goods in the framework of evolutionary game theory. Cell populations, however, form heterogeneous networks that cannot be described by regular lattices or scale-free networks, the types of graphs generally used in the study of cooperation. To describe the dynamics of growth factor production in populations of cancer cells, I study public goods games on Voronoi networks, using a range of non-linear benefits that account for the known properties of growth factors, and different types of diffusion gradients. The results are surprisingly similar to those obtained on regular graphs and different from results on scale-free networks, revealing that network heterogeneity per se does not promote cooperation when public goods diffuse beyond one-step neighbours. The exact shape of the diffusion gradient is not crucial, however, whereas the type of non-linear benefit is an essential determinant of the dynamics. Public goods games on Voronoi networks can shed light on intra-tumour heterogeneity, the evolution of resistance to therapies that target growth factors, and new types of cell therapy. Copyright © 2016 Elsevier Ltd. All rights reserved.

Integration of structural dynamics and molecular evolution via protein interaction networks: a new era in genomic medicine.

PubMed

Kumar, Avishek; Butler, Brandon M; Kumar, Sudhir; Ozkan, S Banu

2015-12-01

Sequencing technologies are revealing many new non-synonymous single nucleotide variants (nsSNVs) in each personal exome. To assess their functional impacts, comparative genomics is frequently employed to predict if they are benign or not. However, evolutionary analysis alone is insufficient, because it misdiagnoses many disease-associated nsSNVs, such as those at positions involved in protein interfaces, and because evolutionary predictions do not provide mechanistic insights into functional change or loss. Structural analyses can aid in overcoming both of these problems by incorporating conformational dynamics and allostery in nSNV diagnosis. Finally, protein-protein interaction networks using systems-level methodologies shed light onto disease etiology and pathogenesis. Bridging these network approaches with structurally resolved protein interactions and dynamics will advance genomic medicine. Copyright © 2015 Elsevier Ltd. All rights reserved.

Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

NASA Technical Reports Server (NTRS)

Rai, Man Mohan

2006-01-01

Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more flexible than other methods in dealing with design in the context of both steady and unsteady flows, partial and complete data sets, combined experimental and numerical data, inclusion of various constraints and rules of thumb, and other issues that characterize the aerodynamic design process. Neural networks provide a natural framework within which a succession of numerical solutions of increasing fidelity, incorporating more realistic flow physics, can be represented and utilized for optimization. Neural networks also offer an excellent framework for multiple-objective and multi-disciplinary design optimization. Simulation tools from various disciplines can be integrated within this framework and rapid trade-off studies involving one or many disciplines can be performed. The prospect of combining neural network based optimization methods and evolutionary algorithms to obtain a hybrid method with the best properties of both methods will be included in this presentation. Achieving solution diversity and accurate convergence to the exact Pareto front in multiple objective optimization usually requires a significant computational effort with evolutionary algorithms. In this lecture we will also explore the possibility of using neural networks to obtain estimates of the Pareto optimal front using non-dominated solutions generated by DE as training data. Neural network estimators have the potential advantage of reducing the number of function evaluations required to obtain solution accuracy and diversity, thus reducing cost to design.

Decomposition-Based Multiobjective Evolutionary Algorithm for Community Detection in Dynamic Social Networks

PubMed Central

Ma, Jingjing; Liu, Jie; Ma, Wenping; Gong, Maoguo; Jiao, Licheng

2014-01-01

Community structure is one of the most important properties in social networks. In dynamic networks, there are two conflicting criteria that need to be considered. One is the snapshot quality, which evaluates the quality of the community partitions at the current time step. The other is the temporal cost, which evaluates the difference between communities at different time steps. In this paper, we propose a decomposition-based multiobjective community detection algorithm to simultaneously optimize these two objectives to reveal community structure and its evolution in dynamic networks. It employs the framework of multiobjective evolutionary algorithm based on decomposition to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively. A local search strategy dealing with the problem-specific knowledge is incorporated to improve the effectiveness of the new algorithm. Experiments on computer-generated and real-world networks demonstrate that the proposed algorithm can not only find community structure and capture community evolution more accurately, but also be steadier than the two compared algorithms. PMID:24723806

Decomposition-based multiobjective evolutionary algorithm for community detection in dynamic social networks.

PubMed

Ma, Jingjing; Liu, Jie; Ma, Wenping; Gong, Maoguo; Jiao, Licheng

2014-01-01

Community structure is one of the most important properties in social networks. In dynamic networks, there are two conflicting criteria that need to be considered. One is the snapshot quality, which evaluates the quality of the community partitions at the current time step. The other is the temporal cost, which evaluates the difference between communities at different time steps. In this paper, we propose a decomposition-based multiobjective community detection algorithm to simultaneously optimize these two objectives to reveal community structure and its evolution in dynamic networks. It employs the framework of multiobjective evolutionary algorithm based on decomposition to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively. A local search strategy dealing with the problem-specific knowledge is incorporated to improve the effectiveness of the new algorithm. Experiments on computer-generated and real-world networks demonstrate that the proposed algorithm can not only find community structure and capture community evolution more accurately, but also be steadier than the two compared algorithms.

A controllable sensor management algorithm capable of learning

NASA Astrophysics Data System (ADS)

Osadciw, Lisa A.; Veeramacheneni, Kalyan K.

2005-03-01

Sensor management technology progress is challenged by the geographic space it spans, the heterogeneity of the sensors, and the real-time timeframes within which plans controlling the assets are executed. This paper presents a new sensor management paradigm and demonstrates its application in a sensor management algorithm designed for a biometric access control system. This approach consists of an artificial intelligence (AI) algorithm focused on uncertainty measures, which makes the high level decisions to reduce uncertainties and interfaces with the user, integrated cohesively with a bottom up evolutionary algorithm, which optimizes the sensor network"s operation as determined by the AI algorithm. The sensor management algorithm presented is composed of a Bayesian network, the AI algorithm component, and a swarm optimization algorithm, the evolutionary algorithm. Thus, the algorithm can change its own performance goals in real-time and will modify its own decisions based on observed measures within the sensor network. The definition of the measures as well as the Bayesian network determine the robustness of the algorithm and its utility in reacting dynamically to changes in the global system.

The Effects of Sacred Value Networks Within an Evolutionary, Adversarial Game

NASA Astrophysics Data System (ADS)

McCalla, Scott G.; Short, Martin B.; Brantingham, P. Jeffrey

2013-05-01

The effects of personal relationships and shared ideologies on levels of crime and the formation of criminal coalitions are studied within the context of an adversarial, evolutionary game first introduced in Short et al. (Phys. Rev. E 82:066114, 2010). Here, we interpret these relationships as connections on a graph of N players. These connections are then used in a variety of ways to define each player's "sacred value network"—groups of individuals that are subject to special consideration or treatment by that player. We explore the effects on the dynamics of the system that these networks introduce, through various forms of protection from both victimization and punishment. Under local protection, these networks introduce a new fixed point within the game dynamics, which we find through a continuum approximation of the discrete game. Under more complicated, extended protection, we numerically observe the emergence of criminal coalitions, or "gangs". We also find that a high-crime steady state is much more frequent in the context of extended protection networks, in both the case of Erdős-Rényi and small world random graphs.

Do motifs reflect evolved function?--No convergent evolution of genetic regulatory network subgraph topologies.

PubMed

Knabe, Johannes F; Nehaniv, Chrystopher L; Schilstra, Maria J

2008-01-01

Methods that analyse the topological structure of networks have recently become quite popular. Whether motifs (subgraph patterns that occur more often than in randomized networks) have specific functions as elementary computational circuits has been cause for debate. As the question is difficult to resolve with currently available biological data, we approach the issue using networks that abstractly model natural genetic regulatory networks (GRNs) which are evolved to show dynamical behaviors. Specifically one group of networks was evolved to be capable of exhibiting two different behaviors ("differentiation") in contrast to a group with a single target behavior. In both groups we find motif distribution differences within the groups to be larger than differences between them, indicating that evolutionary niches (target functions) do not necessarily mold network structure uniquely. These results show that variability operators can have a stronger influence on network topologies than selection pressures, especially when many topologies can create similar dynamics. Moreover, analysis of motif functional relevance by lesioning did not suggest that motifs were of greater importance to the functioning of the network than arbitrary subgraph patterns. Only when drastically restricting network size, so that one motif corresponds to a whole functionally evolved network, was preference for particular connection patterns found. This suggests that in non-restricted, bigger networks, entanglement with the rest of the network hinders topological subgraph analysis.

Strategies and Rubrics for Teaching Complex Systems Theory to Novices (Invited)

NASA Astrophysics Data System (ADS)

Fichter, L. S.

2010-12-01

Bifurcation. Self-similarity. Fractal. Sensitive dependent. Agents. Self-organized criticality. Avalanche behavior. Power laws. Strange attractors. Emergence. The language of complexity is fundamentally different from the language of equilibrium. If students do not know these phenomena, and what they tell us about the pulse of dynamic systems, complex systems will be opaque. A complex system is a group of agents. (individual interacting units, like birds in a flock, sand grains in a ripple, or individual friction units along a fault zone), existing far from equilibrium, interacting through positive and negative feedbacks, following simple rules, forming interdependent, dynamic, evolutionary networks. Complex systems produce behaviors that cannot be predicted deductively from knowledge of the behaviors of the individual components themselves; they must be experienced. What complexity theory demonstrates is that, by following simple rules, all the agents end up coordinating their behavior—self organizing—so that what emerges is not chaos, but meaningful patterns. How can we introduce Freshman, non-science, general education students to complex systems theories, in 3 to 5 classes; in a way they really get it, and can use the principles to understand real systems? Complex systems theories are not a series of unconnected or disconnected equations or models; they are developed as narratives that makes sense of how all the pieces and properties are interrelated. The principles of complex systems must be taught as deliberately and systematically as the equilibrium principles normally taught; as, say, the systematic training from pre-algebra and geometry to algebra. We have developed a sequence of logically connected narratives (strategies and rubrics) that introduce complex systems principles using models that can be simulated in a computer, in class, in real time. The learning progression has a series of 12 models (e.g. logistic system, bifurcation diagrams, genetic algorithms, etc.) leading to 19 learning outcomes that encompass most of the universality properties that characterize complex systems. They are developed in a specific order to achieve specific ends of understanding. We use these models in various depths and formats in courses ranging from gened courses, to evolutionary systems and environmental systems, to upper level geology courses. Depending on the goals of a course, the learning outcomes can be applied to understanding many other complex systems; e.g. oscillating chemical reactions (reaction-diffusion and activator-inhibitor systems), autocatalytic networks, hysteresis (bistable) systems, networks, and the rise/collapse of complex societies. We use these and other complex systems concepts in various classes to talk about the origin of life, ecosystem organization, game theory, extinction events, and environmental system behaviors. The applications are almost endless. The complete learning progression with models, computer programs, experiments, and learning outcomes is available at: www.jmu.edu/geology/ComplexEvolutionarySystems/

Can Multilayer Networks Advance Animal Behavior Research?

PubMed

Silk, Matthew J; Finn, Kelly R; Porter, Mason A; Pinter-Wollman, Noa

2018-06-01

Interactions among individual animals - and between these individuals and their environment - yield complex, multifaceted systems. The development of multilayer network analysis offers a promising new approach for studying animal social behavior and its relation to eco-evolutionary dynamics. Copyright © 2018 Elsevier Ltd. All rights reserved.

Modeling and controlling the two-phase dynamics of the p53 network: a Boolean network approach

NASA Astrophysics Data System (ADS)

Lin, Guo-Qiang; Ao, Bin; Chen, Jia-Wei; Wang, Wen-Xu; Di, Zeng-Ru

2014-12-01

Although much empirical evidence has demonstrated that p53 plays a key role in tumor suppression, the dynamics and function of the regulatory network centered on p53 have not yet been fully understood. Here, we develop a Boolean network model to reproduce the two-phase dynamics of the p53 network in response to DNA damage. In particular, we map the fates of cells into two types of Boolean attractors, and we find that the apoptosis attractor does not exist for minor DNA damage, reflecting that the cell is reparable. As the amount of DNA damage increases, the basin of the repair attractor shrinks, accompanied by the rising of the apoptosis attractor and the expansion of its basin, indicating that the cell becomes more irreparable with more DNA damage. For severe DNA damage, the repair attractor vanishes, and the apoptosis attractor dominates the state space, accounting for the exclusive fate of death. Based on the Boolean network model, we explore the significance of links, in terms of the sensitivity of the two-phase dynamics, to perturbing the weights of links and removing them. We find that the links are either critical or ordinary, rather than redundant. This implies that the p53 network is irreducible, but tolerant of small mutations at some ordinary links, and this can be interpreted with evolutionary theory. We further devised practical control schemes for steering the system into the apoptosis attractor in the presence of DNA damage by pinning the state of a single node or perturbing the weight of a single link. Our approach offers insights into understanding and controlling the p53 network, which is of paramount importance for medical treatment and genetic engineering.

Convergent targeting of a common host protein-network by pathogen effectors from three kingdoms of life

PubMed Central

Weßling, Ralf; Epple, Petra; Altmann, Stefan; He, Yijian; Yang, Li; Henz, Stefan R.; McDonald, Nathan; Wiley, Kristin; Bader, Kai Christian; Gläßer, Christine; Mukhtar, M. Shahid; Haigis, Sabine; Ghamsari, Lila; Stephens, Amber E.; Ecker, Joseph R.; Vidal, Marc; Jones, Jonathan D. G.; Mayer, Klaus F. X.; van Themaat, Emiel Ver Loren; Weigel, Detlef; Schulze-Lefert, Paul; Dangl, Jeffery L.; Panstruga, Ralph; Braun, Pascal

2014-01-01

SUMMARY While conceptual principles governing plant immunity are becoming clear, its systems-level organization and the evolutionary dynamic of the host-pathogen interface are still obscure. We generated a systematic protein-protein interaction network of virulence effectors from the ascomycete pathogen Golovinomyces orontii and Arabidopsis thaliana host proteins. We combined this dataset with corresponding data for the eubacterial pathogen Pseudomonas syringae and the oomycete pathogen Hyaloperonospora arabidopsidis. The resulting network identifies host proteins onto which intraspecies and interspecies pathogen effectors converge. Phenotyping of 124 Arabidopsis effector-interactor mutants revealed a correlation between intra- and interspecies convergence and several altered immune response phenotypes. The effectors and most heavily targeted host protein co-localized in sub-nuclear foci. Products of adaptively selected Arabidopsis genes are enriched for interactions with effector targets. Our data suggest the existence of a molecular host-pathogen interface that is conserved across Arabidopsis accessions, while evolutionary adaptation occurs in the immediate network neighborhood of effector targets. PMID:25211078

Basic emotions and adaptation. A computational and evolutionary model.

PubMed

Pacella, Daniela; Ponticorvo, Michela; Gigliotta, Onofrio; Miglino, Orazio

2017-01-01

The core principles of the evolutionary theories of emotions declare that affective states represent crucial drives for action selection in the environment and regulated the behavior and adaptation of natural agents in ancestrally recurrent situations. While many different studies used autonomous artificial agents to simulate emotional responses and the way these patterns can affect decision-making, few are the approaches that tried to analyze the evolutionary emergence of affective behaviors directly from the specific adaptive problems posed by the ancestral environment. A model of the evolution of affective behaviors is presented using simulated artificial agents equipped with neural networks and physically inspired on the architecture of the iCub humanoid robot. We use genetic algorithms to train populations of virtual robots across generations, and investigate the spontaneous emergence of basic emotional behaviors in different experimental conditions. In particular, we focus on studying the emotion of fear, therefore the environment explored by the artificial agents can contain stimuli that are safe or dangerous to pick. The simulated task is based on classical conditioning and the agents are asked to learn a strategy to recognize whether the environment is safe or represents a threat to their lives and select the correct action to perform in absence of any visual cues. The simulated agents have special input units in their neural structure whose activation keep track of their actual "sensations" based on the outcome of past behavior. We train five different neural network architectures and then test the best ranked individuals comparing their performances and analyzing the unit activations in each individual's life cycle. We show that the agents, regardless of the presence of recurrent connections, spontaneously evolved the ability to cope with potentially dangerous environment by collecting information about the environment and then switching their behavior to a genetically selected pattern in order to maximize the possible reward. We also prove the determinant presence of an internal time perception unit for the robots to achieve the highest performance and survivability across all conditions.

A new stellar spectrum interpolation algorithm and its application to Yunnan-III evolutionary population synthesis models

NASA Astrophysics Data System (ADS)

Cheng, Liantao; Zhang, Fenghui; Kang, Xiaoyu; Wang, Lang

2018-05-01

In evolutionary population synthesis (EPS) models, we need to convert stellar evolutionary parameters into spectra via interpolation in a stellar spectral library. For theoretical stellar spectral libraries, the spectrum grid is homogeneous on the effective-temperature and gravity plane for a given metallicity. It is relatively easy to derive stellar spectra. For empirical stellar spectral libraries, stellar parameters are irregularly distributed and the interpolation algorithm is relatively complicated. In those EPS models that use empirical stellar spectral libraries, different algorithms are used and the codes are often not released. Moreover, these algorithms are often complicated. In this work, based on a radial basis function (RBF) network, we present a new spectrum interpolation algorithm and its code. Compared with the other interpolation algorithms that are used in EPS models, it can be easily understood and is highly efficient in terms of computation. The code is written in MATLAB scripts and can be used on any computer system. Using it, we can obtain the interpolated spectra from a library or a combination of libraries. We apply this algorithm to several stellar spectral libraries (such as MILES, ELODIE-3.1 and STELIB-3.2) and give the integrated spectral energy distributions (ISEDs) of stellar populations (with ages from 1 Myr to 14 Gyr) by combining them with Yunnan-III isochrones. Our results show that the differences caused by the adoption of different EPS model components are less than 0.2 dex. All data about the stellar population ISEDs in this work and the RBF spectrum interpolation code can be obtained by request from the first author or downloaded from http://www1.ynao.ac.cn/˜zhangfh.

The maintenance of cooperation in multiplex networks with limited and partible resources of agents

NASA Astrophysics Data System (ADS)

Li, Zhaofeng; Shen, Bi; Jiang, Yichuan

2017-02-01

In this paper, we try to explain the maintenance of cooperation in multiplex networks with limited and partible resources of agents: defection brings larger short-term benefit and cooperative agents may become defective because of the unaffordable costs of cooperative behaviors that are performed in multiple layers simultaneously. Recent studies have identified the positive effects of multiple layers on evolutionary cooperation but generally overlook the maximum costs of agents in these synchronous games. By utilizing network effects and designing evolutionary mechanisms, cooperative behaviors become prevailing in public goods games, and agents can allocate personal resources across multiple layers. First, we generalize degree diversity into multiplex networks to improve the prospect for cooperation. Second, to prevent agents allocating all the resources into one layer, a greedy-first mechanism is proposed, in which agents prefer to add additional investments in the higher-payoff layer. It is found that greedy-first agents can perform cooperative behaviors in multiplex networks when one layer is scale-free network and degree differences between conjoint nodes increase. Our work may help to explain the emergence of cooperation in the absence of individual reputation and punishment mechanisms.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ruvinsky, Anatoly M., E-mail: anatoly.ruvinsky@astrazeneca.com; Center for Bioinformatics, The University of Kansas, Lawrence, Kansas 66047; Vakser, Ilya A.

Ferritin-like molecules show a remarkable combination of the evolutionary conserved activity of iron uptake and release that engage different pores in the conserved ferritin shell. It was hypothesized that pore selection and iron traffic depend on dynamic allostery with no conformational changes in the backbone. In this study, we detect the allosteric networks in Pseudomonas aeruginosa bacterioferritin (BfrB), bacterial ferritin (FtnA), and bullfrog M and L ferritins (Ftns) by a network-weaving algorithm (NWA) that passes threads of an allosteric network through highly correlated residues using hierarchical clustering. The residue-residue correlations are calculated in the packing-on elastic network model that introducesmore » atom packing into the common packing-off model. Applying NWA revealed that each of the molecules has an extended allosteric network mostly buried inside the ferritin shell. The structure of the networks is consistent with experimental observations of iron transport: The allosteric networks in BfrB and FtnA connect the ferroxidase center with the 4-fold pores and B-pores, leaving the 3-fold pores unengaged. In contrast, the allosteric network directly links the 3-fold pores with the 4-fold pores in M and L Ftns. The majority of the network residues are either on the inner surface or buried inside the subunit fold or at the subunit interfaces. We hypothesize that the ferritin structures evolved in a way to limit the influence of functionally unrelated events in the cytoplasm on the allosteric network to maintain stability of the translocation mechanisms. We showed that the residue-residue correlations and the resultant long-range cooperativity depend on the ferritin shell packing, which, in turn, depends on protein sequence composition. Switching from the packing-on to the packing-off model reduces correlations by 35%–38% so that no allosteric network can be found. The influence of the side-chain packing on the allosteric networks explains the diversity in mechanisms of iron traffic suggested by experimental approaches.« less

Online Learning of Genetic Network Programming and its Application to Prisoner’s Dilemma Game

NASA Astrophysics Data System (ADS)

Mabu, Shingo; Hirasawa, Kotaro; Hu, Jinglu; Murata, Junichi

A new evolutionary model with the network structure named Genetic Network Programming (GNP) has been proposed recently. GNP, that is, an expansion of GA and GP, represents solutions as a network structure and evolves it by using “offline learning (selection, mutation, crossover)”. GNP can memorize the past action sequences in the network flow, so it can deal with Partially Observable Markov Decision Process (POMDP) well. In this paper, in order to improve the ability of GNP, Q learning (an off-policy TD control algorithm) that is one of the famous online methods is introduced for online learning of GNP. Q learning is suitable for GNP because (1) in reinforcement learning, the rewards an agent will get in the future can be estimated, (2) TD control doesn’t need much memory and can learn quickly, and (3) off-policy is suitable in order to search for an optimal solution independently of the policy. Finally, in the simulations, online learning of GNP is applied to a player for “Prisoner’s dilemma game” and its ability for online adaptation is confirmed.

Strategic tradeoffs in competitor dynamics on adaptive networks.

PubMed

Hébert-Dufresne, Laurent; Allard, Antoine; Noël, Pierre-André; Young, Jean-Gabriel; Libby, Eric

2017-08-08

Recent empirical work highlights the heterogeneity of social competitions such as political campaigns: proponents of some ideologies seek debate and conversation, others create echo chambers. While symmetric and static network structure is typically used as a substrate to study such competitor dynamics, network structure can instead be interpreted as a signature of the competitor strategies, yielding competition dynamics on adaptive networks. Here we demonstrate that tradeoffs between aggressiveness and defensiveness (i.e., targeting adversaries vs. targeting like-minded individuals) creates paradoxical behaviour such as non-transitive dynamics. And while there is an optimal strategy in a two competitor system, three competitor systems have no such solution; the introduction of extreme strategies can easily affect the outcome of a competition, even if the extreme strategies have no chance of winning. Not only are these results reminiscent of classic paradoxical results from evolutionary game theory, but the structure of social networks created by our model can be mapped to particular forms of payoff matrices. Consequently, social structure can act as a measurable metric for social games which in turn allows us to provide a game theoretical perspective on online political debates.

Honey bee-inspired algorithms for SNP haplotype reconstruction problem

NASA Astrophysics Data System (ADS)

PourkamaliAnaraki, Maryam; Sadeghi, Mehdi

2016-03-01

Reconstructing haplotypes from SNP fragments is an important problem in computational biology. There have been a lot of interests in this field because haplotypes have been shown to contain promising data for disease association research. It is proved that haplotype reconstruction in Minimum Error Correction model is an NP-hard problem. Therefore, several methods such as clustering techniques, evolutionary algorithms, neural networks and swarm intelligence approaches have been proposed in order to solve this problem in appropriate time. In this paper, we have focused on various evolutionary clustering techniques and try to find an efficient technique for solving haplotype reconstruction problem. It can be referred from our experiments that the clustering methods relying on the behaviour of honey bee colony in nature, specifically bees algorithm and artificial bee colony methods, are expected to result in more efficient solutions. An application program of the methods is available at the following link. http://www.bioinf.cs.ipm.ir/software/haprs/

Insect Immunity to Entomopathogenic Fungi.

PubMed

Lu, H-L; St Leger, R J

2016-01-01

The study of infection and immunity in insects has achieved considerable prominence with the appreciation that their host defense mechanisms share many fundamental characteristics with the innate immune system of vertebrates. Studies on the highly tractable model organism Drosophila in particular have led to a detailed understanding of conserved innate immunity networks, such as Toll. However, most of these studies have used opportunistic human pathogens and may not have revealed specialized immune strategies that have arisen through evolutionary arms races with natural insect pathogens. Fungi are the commonest natural insect pathogens, and in this review, we focus on studies using Metarhizium and Beauveria spp. that have addressed immune system function and pathogen virulence via behavioral avoidance, the use of physical barriers, and the activation of local and systemic immune responses. In particular, we highlight studies on the evolutionary genetics of insect immunity and discuss insect-pathogen coevolution. Copyright © 2016 Elsevier Inc. All rights reserved.

An Artificial Immune System-Inspired Multiobjective Evolutionary Algorithm with Application to the Detection of Distributed Computer Network Intrusions

DTIC Science & Technology

2007-03-01

Intelligence AIS Artificial Immune System ANN Artificial Neural Networks API Application Programming Interface BFS Breadth-First Search BIS Biological...problem domain is too large for only one algorithm’s application . It ranges from network - based sniffer systems, responsible for Enterprise-wide coverage...options to network administrators in choosing detectors to employ in future ID applications . Objectives Our hypothesis validity is based on a set

The Evolutionary Basis of Risky Adolescent Behavior: Implications for Science, Policy, and Practice

ERIC Educational Resources Information Center

Ellis, Bruce J.; Del Giudice, Marco; Dishion, Thomas J.; Figueredo, Aurelio Jose; Gray, Peter; Griskevicius, Vladas; Hawley, Patricia H.; Jacobs, W. Jake; James, Jenee; Volk, Anthony A.; Wilson, David Sloan

2012-01-01

This article proposes an evolutionary model of risky behavior in adolescence and contrasts it with the prevailing developmental psychopathology model. The evolutionary model contends that understanding the evolutionary functions of adolescence is critical to explaining why adolescents engage in risky behavior and that successful intervention…

Modeling Temporal Variation in Social Network: An Evolutionary Web Graph Approach

NASA Astrophysics Data System (ADS)

Mitra, Susanta; Bagchi, Aditya

A social network is a social structure between actors (individuals, organization or other social entities) and indicates the ways in which they are connected through various social relationships like friendships, kinships, professional, academic etc. Usually, a social network represents a social community, like a club and its members or a city and its citizens etc. or a research group communicating over Internet. In seventies Leinhardt [1] first proposed the idea of representing a social community by a digraph. Later, this idea became popular among other research workers like, network designers, web-service application developers and e-learning modelers. It gave rise to a rapid proliferation of research work in the area of social network analysis. Some of the notable structural properties of a social network are connectedness between actors, reachability between a source and a target actor, reciprocity or pair-wise connection between actors with bi-directional links, centrality of actors or the important actors having high degree or more connections and finally the division of actors into sub-structures or cliques or strongly-connected components. The cycles present in a social network may even be nested [2, 3]. The formal definition of these structural properties will be provided in Sect. 8.2.1. The division of actors into cliques or sub-groups can be a very important factor for understanding a social structure, particularly the degree of cohesiveness in a community. The number, size, and connections among the sub-groups in a network are useful in understanding how the network, as a whole, is likely to behave.

Maximisation Principles in Foodwebs and Daisyworlds

NASA Astrophysics Data System (ADS)

Ackland, G. J.; Gallagher, I. D.

2005-12-01

Using computer simulation we investigate whether the steady-state time averaged state of a self-organising system with many internal degrees of freedom can be described by optimising a single quantity. Our open systems follow evolutionary dynamics hence the conservation laws and energy-based state probabilities which underpin Hamiltonian dynamics do not apply. We find that these dynamics observe a novel optimality principle, that the system self-organises to a state which maximises the sustainable amount of replicating objects. We have studied a number of mathematical models of evolving replicating systems: daisyworlds[1], logistic map and generalized Lotka Volterra foodwebs[2]. Each is characterised by being (1) "open" - resources flow into and out of the system. (2) "self-regulating" - the inflow/outflow of resources is not fixed externally. (3) "evolving" - the increase in population at the next timestep depends on the population at the current timestep. These properties violate the assumptions made in deriving optimality principles such as free energy minimisation, maximum/mimimum entropy production etc., so it is unsurprising that they are not observed. The absence of a Hamiltonian for ecosystems is particularly problematic for coupled models of life and the environment - moreover there is ambiguity in defining an entropy for an ecosystem. By considering large and small species within the 2D daisyworld model we show that the appropriate measure comes from the interaction with the rest of the system, not the information theoretic entropy of the daisy field. We introduce evolution within the classic Lotka-Volterra model for interaction between species in an ecosystem. Generalisation to many species is straightforward, but the resulting network is usually unstable. By restricting the number of links between species it is possible to form a stable network by evolution - allowing some species to go extinct. This method can be used to generate arbitrarily large network, from which a treelike structure of trophic levels emerges, but typically the number of connection is much smaller than in real ecosystems. Here, we show that applying evolution to the strength of the links, rather than simply their existence, stabilises the entire network and generates a power-law distribution of link strengths. The network dynamics are chaotic, but as a whole tend towards maximising the use of resources. If the dynamics are linearised to remove the chaos, the scale-free link strengths also disappear. [1] Maximisation Principles and Daisyworld G.J. Ackland J.Theo.Bio. 227, 121, (2004) [2] Stabilization of large generalized Lotka-Volterra foodwebs by evolutionary feedback G.J. Ackland and I.D. Gallagher Phys Rev Lett 93 158701 2004

The evolution of prompt reaction to adverse ties.

PubMed

Van Segbroeck, Sven; Santos, Francisco C; Nowé, Ann; Pacheco, Jorge M; Lenaerts, Tom

2008-10-17

In recent years it has been found that the combination of evolutionary game theory with population structures modelled in terms of dynamical graphs, in which individuals are allowed to sever unwanted social ties while keeping the good ones, provides a viable solution to the conundrum of cooperation. It is well known that in reality individuals respond differently to disadvantageous interactions. Yet, the evolutionary mechanism determining the individuals' willingness to sever unfavourable ties remains unclear. We introduce a novel way of thinking about the joint evolution of cooperation and social contacts. The struggle for survival between cooperators and defectors leads to an arms race for swiftness in adjusting social ties, based purely on a self-regarding, individual judgement. Since defectors are never able to establish social ties under mutual agreement, they break adverse ties more rapidly than cooperators, who tend to evolve stable and long-term relations. Ironically, defectors' constant search for partners to exploit leads to heterogeneous networks that improve the survivability of cooperators, compared to the traditional homogenous population assumption. When communities face the prisoner's dilemma, swift reaction to adverse ties evolves when competition is fierce between cooperators and defectors, providing an evolutionary basis for the necessity of individuals to adjust their social ties. Our results show how our innate resilience to change relates to mutual agreement between cooperators and how "loyalty" or persistent social ties bring along an evolutionary disadvantage, both from an individual and group perspective.

Cooperation in memory-based prisoner's dilemma game on interdependent networks

NASA Astrophysics Data System (ADS)

Luo, Chao; Zhang, Xiaolin; Liu, Hong; Shao, Rui

2016-05-01

Memory or so-called experience normally plays the important role to guide the human behaviors in real world, that is essential for rational decisions made by individuals. Hence, when the evolutionary behaviors of players with bounded rationality are investigated, it is reasonable to make an assumption that players in system are with limited memory. Besides, in order to unravel the intricate variability of complex systems in real world and make a highly integrative understanding of their dynamics, in recent years, interdependent networks as a comprehensive network structure have obtained more attention in this community. In this article, the evolution of cooperation in memory-based prisoner's dilemma game (PDG) on interdependent networks composed by two coupled square lattices is studied. Herein, all or part of players are endowed with finite memory ability, and we focus on the mutual influence of memory effect and interdependent network reciprocity on cooperation of spatial PDG. We show that the density of cooperation can be significantly promoted within an optimal region of memory length and interdependent strength. Furthermore, distinguished by whether having memory ability/external links or not, each kind of players on networks would have distinct evolutionary behaviors. Our work could be helpful to understand the emergence and maintenance of cooperation under the evolution of memory-based players on interdependent networks.

The Probability of a Gene Tree Topology within a Phylogenetic Network with Applications to Hybridization Detection

PubMed Central

Yu, Yun; Degnan, James H.; Nakhleh, Luay

2012-01-01

Gene tree topologies have proven a powerful data source for various tasks, including species tree inference and species delimitation. Consequently, methods for computing probabilities of gene trees within species trees have been developed and widely used in probabilistic inference frameworks. All these methods assume an underlying multispecies coalescent model. However, when reticulate evolutionary events such as hybridization occur, these methods are inadequate, as they do not account for such events. Methods that account for both hybridization and deep coalescence in computing the probability of a gene tree topology currently exist for very limited cases. However, no such methods exist for general cases, owing primarily to the fact that it is currently unknown how to compute the probability of a gene tree topology within the branches of a phylogenetic network. Here we present a novel method for computing the probability of gene tree topologies on phylogenetic networks and demonstrate its application to the inference of hybridization in the presence of incomplete lineage sorting. We reanalyze a Saccharomyces species data set for which multiple analyses had converged on a species tree candidate. Using our method, though, we show that an evolutionary hypothesis involving hybridization in this group has better support than one of strict divergence. A similar reanalysis on a group of three Drosophila species shows that the data is consistent with hybridization. Further, using extensive simulation studies, we demonstrate the power of gene tree topologies at obtaining accurate estimates of branch lengths and hybridization probabilities of a given phylogenetic network. Finally, we discuss identifiability issues with detecting hybridization, particularly in cases that involve extinction or incomplete sampling of taxa. PMID:22536161

Unity and disunity in evolutionary sciences: process-based analogies open common research avenues for biology and linguistics.

PubMed

List, Johann-Mattis; Pathmanathan, Jananan Sylvestre; Lopez, Philippe; Bapteste, Eric

2016-08-20

For a long time biologists and linguists have been noticing surprising similarities between the evolution of life forms and languages. Most of the proposed analogies have been rejected. Some, however, have persisted, and some even turned out to be fruitful, inspiring the transfer of methods and models between biology and linguistics up to today. Most proposed analogies were based on a comparison of the research objects rather than the processes that shaped their evolution. Focusing on process-based analogies, however, has the advantage of minimizing the risk of overstating similarities, while at the same time reflecting the common strategy to use processes to explain the evolution of complexity in both fields. We compared important evolutionary processes in biology and linguistics and identified processes specific to only one of the two disciplines as well as processes which seem to be analogous, potentially reflecting core evolutionary processes. These new process-based analogies support novel methodological transfer, expanding the application range of biological methods to the field of historical linguistics. We illustrate this by showing (i) how methods dealing with incomplete lineage sorting offer an introgression-free framework to analyze highly mosaic word distributions across languages; (ii) how sequence similarity networks can be used to identify composite and borrowed words across different languages; (iii) how research on partial homology can inspire new methods and models in both fields; and (iv) how constructive neutral evolution provides an original framework for analyzing convergent evolution in languages resulting from common descent (Sapir's drift). Apart from new analogies between evolutionary processes, we also identified processes which are specific to either biology or linguistics. This shows that general evolution cannot be studied from within one discipline alone. In order to get a full picture of evolution, biologists and linguists need to complement their studies, trying to identify cross-disciplinary and discipline-specific evolutionary processes. The fact that we found many process-based analogies favoring transfer from biology to linguistics further shows that certain biological methods and models have a broader scope than previously recognized. This opens fruitful paths for collaboration between the two disciplines. This article was reviewed by W. Ford Doolittle and Eugene V. Koonin.

Base Station Placement Algorithm for Large-Scale LTE Heterogeneous Networks.

PubMed

Lee, Seungseob; Lee, SuKyoung; Kim, Kyungsoo; Kim, Yoon Hyuk

2015-01-01

Data traffic demands in cellular networks today are increasing at an exponential rate, giving rise to the development of heterogeneous networks (HetNets), in which small cells complement traditional macro cells by extending coverage to indoor areas. However, the deployment of small cells as parts of HetNets creates a key challenge for operators' careful network planning. In particular, massive and unplanned deployment of base stations can cause high interference, resulting in highly degrading network performance. Although different mathematical modeling and optimization methods have been used to approach various problems related to this issue, most traditional network planning models are ill-equipped to deal with HetNet-specific characteristics due to their focus on classical cellular network designs. Furthermore, increased wireless data demands have driven mobile operators to roll out large-scale networks of small long term evolution (LTE) cells. Therefore, in this paper, we aim to derive an optimum network planning algorithm for large-scale LTE HetNets. Recently, attempts have been made to apply evolutionary algorithms (EAs) to the field of radio network planning, since they are characterized as global optimization methods. Yet, EA performance often deteriorates rapidly with the growth of search space dimensionality. To overcome this limitation when designing optimum network deployments for large-scale LTE HetNets, we attempt to decompose the problem and tackle its subcomponents individually. Particularly noting that some HetNet cells have strong correlations due to inter-cell interference, we propose a correlation grouping approach in which cells are grouped together according to their mutual interference. Both the simulation and analytical results indicate that the proposed solution outperforms the random-grouping based EA as well as an EA that detects interacting variables by monitoring the changes in the objective function algorithm in terms of system throughput performance.

Deciding to Cooperate in Northern Ghana: Trust as an Evolutionary Constraint Across Cultural Diversity.

PubMed

Acedo-Carmona, Cristina; Gomila, Antoni

2015-11-27

The upper-east and northern regions of Ghana offers a unique opportunity to study the influence of evolutionary social dynamics in making cooperation possible, despite cultural differences. These regions are occupied by several distinct ethnic groups, in interaction, such as the Kussasi, Mamprusi, Bimoba, Konkomba, and Fulani. We will report our fieldwork related to how cooperation takes places there, both within each group and among people from the different groups. Methods included personal networks of cooperation (ego networks), interviews and analysis of group contexts. The most important result is that, while each ethnic group may differ in terms of family and clan structure, a similar pattern can be found in all of them, of cooperation structured around small groups of trust-based close relationships. The study suggests that habitual decisions about cooperation are not strategic or self-interested, but instead are based on unconscious processes sustained by the emotional bonds of trust. These kind of emotional bonds are claimed to be relevant from an evolutionary point of view.

Neural-network-enhanced evolutionary algorithm applied to supported metal nanoparticles

NASA Astrophysics Data System (ADS)

Kolsbjerg, E. L.; Peterson, A. A.; Hammer, B.

2018-05-01

We show that approximate structural relaxation with a neural network enables orders of magnitude faster global optimization with an evolutionary algorithm in a density functional theory framework. The increased speed facilitates reliable identification of global minimum energy structures, as exemplified by our finding of a hollow Pt13 nanoparticle on an MgO support. We highlight the importance of knowing the correct structure when studying the catalytic reactivity of the different particle shapes. The computational speedup further enables screening of hundreds of different pathways in the search for optimum kinetic transitions between low-energy conformers and hence pushes the limits of the insight into thermal ensembles that can be obtained from theory.

Evolution and development of brain networks: from Caenorhabditis elegans to Homo sapiens.

PubMed

Kaiser, Marcus; Varier, Sreedevi

2011-01-01

Neural networks show a progressive increase in complexity during the time course of evolution. From diffuse nerve nets in Cnidaria to modular, hierarchical systems in macaque and humans, there is a gradual shift from simple processes involving a limited amount of tasks and modalities to complex functional and behavioral processing integrating different kinds of information from highly specialized tissue. However, studies in a range of species suggest that fundamental similarities, in spatial and topological features as well as in developmental mechanisms for network formation, are retained across evolution. 'Small-world' topology and highly connected regions (hubs) are prevalent across the evolutionary scale, ensuring efficient processing and resilience to internal (e.g. lesions) and external (e.g. environment) changes. Furthermore, in most species, even the establishment of hubs, long-range connections linking distant components, and a modular organization, relies on similar mechanisms. In conclusion, evolutionary divergence leads to greater complexity while following essential developmental constraints.

Collaboration Networks in the Brazilian Scientific Output in Evolutionary Biology: 2000-2012.

PubMed

Santin, Dirce M; Vanz, Samile A S; Stumpf, Ida R C

2016-03-01

This article analyzes the existing collaboration networks in the Brazilian scientific output in Evolutionary Biology, considering articles published during the period from 2000 to 2012 in journals indexed by Web of Science. The methodology integrates bibliometric techniques and Social Network Analysis resources to describe the growth of Brazilian scientific output and understand the levels, dynamics and structure of collaboration between authors, institutions and countries. The results unveil an enhancement and consolidation of collaborative relationships over time and suggest the existence of key institutions and authors, whose influence on research is expressed by the variety and intensity of the relationships established in the co-authorship of articles. International collaboration, present in more than half of the publications, is highly significant and unusual in Brazilian science. The situation indicates the internationalization of scientific output and the ability of the field to take part in the science produced by the international scientific community.

Investigating host-pathogen behavior and their interaction using genome-scale metabolic network models.

PubMed

Sadhukhan, Priyanka P; Raghunathan, Anu

2014-01-01

Genome Scale Metabolic Modeling methods represent one way to compute whole cell function starting from the genome sequence of an organism and contribute towards understanding and predicting the genotype-phenotype relationship. About 80 models spanning all the kingdoms of life from archaea to eukaryotes have been built till date and used to interrogate cell phenotype under varying conditions. These models have been used to not only understand the flux distribution in evolutionary conserved pathways like glycolysis and the Krebs cycle but also in applications ranging from value added product formation in Escherichia coli to predicting inborn errors of Homo sapiens metabolism. This chapter describes a protocol that delineates the process of genome scale metabolic modeling for analysing host-pathogen behavior and interaction using flux balance analysis (FBA). The steps discussed in the process include (1) reconstruction of a metabolic network from the genome sequence, (2) its representation in a precise mathematical framework, (3) its translation to a model, and (4) the analysis using linear algebra and optimization. The methods for biological interpretations of computed cell phenotypes in the context of individual host and pathogen models and their integration are also discussed.

Emergence of communities and diversity in social networks

PubMed Central

Han, Xiao; Cao, Shinan; Shen, Zhesi; Zhang, Boyu; Wang, Wen-Xu; Cressman, Ross

2017-01-01

Communities are common in complex networks and play a significant role in the functioning of social, biological, economic, and technological systems. Despite widespread interest in detecting community structures in complex networks and exploring the effect of communities on collective dynamics, a deep understanding of the emergence and prevalence of communities in social networks is still lacking. Addressing this fundamental problem is of paramount importance in understanding, predicting, and controlling a variety of collective behaviors in society. An elusive question is how communities with common internal properties arise in social networks with great individual diversity. Here, we answer this question using the ultimatum game, which has been a paradigm for characterizing altruism and fairness. We experimentally show that stable local communities with different internal agreements emerge spontaneously and induce social diversity into networks, which is in sharp contrast to populations with random interactions. Diverse communities and social norms come from the interaction between responders with inherent heterogeneous demands and rational proposers via local connections, where the former eventually become the community leaders. This result indicates that networks are significant in the emergence and stabilization of communities and social diversity. Our experimental results also provide valuable information about strategies for developing network models and theories of evolutionary games and social dynamics. PMID:28235785

Emergence of communities and diversity in social networks.

PubMed

Han, Xiao; Cao, Shinan; Shen, Zhesi; Zhang, Boyu; Wang, Wen-Xu; Cressman, Ross; Stanley, H Eugene

2017-03-14

Communities are common in complex networks and play a significant role in the functioning of social, biological, economic, and technological systems. Despite widespread interest in detecting community structures in complex networks and exploring the effect of communities on collective dynamics, a deep understanding of the emergence and prevalence of communities in social networks is still lacking. Addressing this fundamental problem is of paramount importance in understanding, predicting, and controlling a variety of collective behaviors in society. An elusive question is how communities with common internal properties arise in social networks with great individual diversity. Here, we answer this question using the ultimatum game, which has been a paradigm for characterizing altruism and fairness. We experimentally show that stable local communities with different internal agreements emerge spontaneously and induce social diversity into networks, which is in sharp contrast to populations with random interactions. Diverse communities and social norms come from the interaction between responders with inherent heterogeneous demands and rational proposers via local connections, where the former eventually become the community leaders. This result indicates that networks are significant in the emergence and stabilization of communities and social diversity. Our experimental results also provide valuable information about strategies for developing network models and theories of evolutionary games and social dynamics.

Gene regulatory network architecture in different developmental contexts influences the genetic basis of morphological evolution.

PubMed

Kittelmann, Sebastian; Buffry, Alexandra D; Franke, Franziska A; Almudi, Isabel; Yoth, Marianne; Sabaris, Gonzalo; Couso, Juan Pablo; Nunes, Maria D S; Frankel, Nicolás; Gómez-Skarmeta, José Luis; Pueyo-Marques, Jose; Arif, Saad; McGregor, Alistair P

2018-05-01

Convergent phenotypic evolution is often caused by recurrent changes at particular nodes in the underlying gene regulatory networks (GRNs). The genes at such evolutionary 'hotspots' are thought to maximally affect the phenotype with minimal pleiotropic consequences. This has led to the suggestion that if a GRN is understood in sufficient detail, the path of evolution may be predictable. The repeated evolutionary loss of larval trichomes among Drosophila species is caused by the loss of shavenbaby (svb) expression. svb is also required for development of leg trichomes, but the evolutionary gain of trichomes in the 'naked valley' on T2 femurs in Drosophila melanogaster is caused by reduced microRNA-92a (miR-92a) expression rather than changes in svb. We compared the expression and function of components between the larval and leg trichome GRNs to investigate why the genetic basis of trichome pattern evolution differs in these developmental contexts. We found key differences between the two networks in both the genes employed, and in the regulation and function of common genes. These differences in the GRNs reveal why mutations in svb are unlikely to contribute to leg trichome evolution and how instead miR-92a represents the key evolutionary switch in this context. Our work shows that variability in GRNs across different developmental contexts, as well as whether a morphological feature is lost versus gained, influence the nodes at which a GRN evolves to cause morphological change. Therefore, our findings have important implications for understanding the pathways and predictability of evolution.

A case study of evolutionary computation of biochemical adaptation

NASA Astrophysics Data System (ADS)

François, Paul; Siggia, Eric D.

2008-06-01

Simulations of evolution have a long history, but their relation to biology is questioned because of the perceived contingency of evolution. Here we provide an example of a biological process, adaptation, where simulations are argued to approach closer to biology. Adaptation is a common feature of sensory systems, and a plausible component of other biochemical networks because it rescales upstream signals to facilitate downstream processing. We create random gene networks numerically, by linking genes with interactions that model transcription, phosphorylation and protein-protein association. We define a fitness function for adaptation in terms of two functional metrics, and show that any reasonable combination of them will yield the same adaptive networks after repeated rounds of mutation and selection. Convergence to these networks is driven by positive selection and thus fast. There is always a path in parameter space of continuously improving fitness that leads to perfect adaptation, implying that the actual mutation rates we use in the simulation do not bias the results. Our results imply a kinetic view of evolution, i.e., it favors gene networks that can be learned quickly from the random examples supplied by mutation. This formulation allows for deductive predictions of the networks realized in nature.

Flower color as a model system for studies of plant evo-devo.

PubMed

Sobel, James M; Streisfeld, Matthew A

2013-01-01

Even though pigmentation traits have had substantial impacts on the field of animal evolutionary developmental biology, they have played only relatively minor roles in plant evo-devo. This is surprising given the often direct connection between flower color and fitness variation mediated through the effects of pollinators. At the same time, ecological and evolutionary genetic studies have utilized the molecular resources available for the anthocyanin pathway to generate several examples of the molecular basis of putatively adaptive transitions in flower color. Despite this opportunity to synthesize experimental approaches in ecology, evolution, and developmental biology, the investigation of many fundamental questions in evo-devo using this powerful model is only at its earliest stages. For example, a long-standing question is whether predictable genetic changes accompany the repeated evolution of a trait. Due to the conserved nature of the biochemical and regulatory control of anthocyanin biosynthesis, it has become possible to determine whether, and under what circumstances, different types of mutations responsible for flower color variation are preferentially targeted by natural selection. In addition, because plants use anthocyanin and related compounds in vegetative tissue for other important physiological functions, the identification of naturally occurring transitions from unpigmented to pigmented flowers provides the opportunity to examine the mechanisms by which regulatory networks are co-opted into new developmental domains. Here, we review what is known about the ecological and molecular basis of anthocyanic flower color transitions in natural systems, focusing on the evolutionary and developmental features involved. In doing so, we provide suggestions for future work on this trait and suggest that there is still much to be learned from the evolutionary development of flower color transitions in nature.

Evolutionary Scheduler for the Deep Space Network

NASA Technical Reports Server (NTRS)

Guillaume, Alexandre; Lee, Seungwon; Wang, Yeou-Fang; Zheng, Hua; Chau, Savio; Tung, Yu-Wen; Terrile, Richard J.; Hovden, Robert

2010-01-01

A computer program assists human schedulers in satisfying, to the maximum extent possible, competing demands from multiple spacecraft missions for utilization of the transmitting/receiving Earth stations of NASA s Deep Space Network. The program embodies a concept of optimal scheduling to attain multiple objectives in the presence of multiple constraints.

Improving the Adaptability of Simulated Evolutionary Swarm Robots in Dynamically Changing Environments

PubMed Central

Yao, Yao; Marchal, Kathleen; Van de Peer, Yves

2014-01-01

One of the important challenges in the field of evolutionary robotics is the development of systems that can adapt to a changing environment. However, the ability to adapt to unknown and fluctuating environments is not straightforward. Here, we explore the adaptive potential of simulated swarm robots that contain a genomic encoding of a bio-inspired gene regulatory network (GRN). An artificial genome is combined with a flexible agent-based system, representing the activated part of the regulatory network that transduces environmental cues into phenotypic behaviour. Using an artificial life simulation framework that mimics a dynamically changing environment, we show that separating the static from the conditionally active part of the network contributes to a better adaptive behaviour. Furthermore, in contrast with most hitherto developed ANN-based systems that need to re-optimize their complete controller network from scratch each time they are subjected to novel conditions, our system uses its genome to store GRNs whose performance was optimized under a particular environmental condition for a sufficiently long time. When subjected to a new environment, the previous condition-specific GRN might become inactivated, but remains present. This ability to store ‘good behaviour’ and to disconnect it from the novel rewiring that is essential under a new condition allows faster re-adaptation if any of the previously observed environmental conditions is reencountered. As we show here, applying these evolutionary-based principles leads to accelerated and improved adaptive evolution in a non-stable environment. PMID:24599485

The Evolutionary Origins of Hierarchy

PubMed Central

Huizinga, Joost; Clune, Jeff

2016-01-01

Hierarchical organization—the recursive composition of sub-modules—is ubiquitous in biological networks, including neural, metabolic, ecological, and genetic regulatory networks, and in human-made systems, such as large organizations and the Internet. To date, most research on hierarchy in networks has been limited to quantifying this property. However, an open, important question in evolutionary biology is why hierarchical organization evolves in the first place. It has recently been shown that modularity evolves because of the presence of a cost for network connections. Here we investigate whether such connection costs also tend to cause a hierarchical organization of such modules. In computational simulations, we find that networks without a connection cost do not evolve to be hierarchical, even when the task has a hierarchical structure. However, with a connection cost, networks evolve to be both modular and hierarchical, and these networks exhibit higher overall performance and evolvability (i.e. faster adaptation to new environments). Additional analyses confirm that hierarchy independently improves adaptability after controlling for modularity. Overall, our results suggest that the same force–the cost of connections–promotes the evolution of both hierarchy and modularity, and that these properties are important drivers of network performance and adaptability. In addition to shedding light on the emergence of hierarchy across the many domains in which it appears, these findings will also accelerate future research into evolving more complex, intelligent computational brains in the fields of artificial intelligence and robotics. PMID:27280881

The Evolutionary Origins of Hierarchy.

PubMed

Mengistu, Henok; Huizinga, Joost; Mouret, Jean-Baptiste; Clune, Jeff

2016-06-01

Hierarchical organization-the recursive composition of sub-modules-is ubiquitous in biological networks, including neural, metabolic, ecological, and genetic regulatory networks, and in human-made systems, such as large organizations and the Internet. To date, most research on hierarchy in networks has been limited to quantifying this property. However, an open, important question in evolutionary biology is why hierarchical organization evolves in the first place. It has recently been shown that modularity evolves because of the presence of a cost for network connections. Here we investigate whether such connection costs also tend to cause a hierarchical organization of such modules. In computational simulations, we find that networks without a connection cost do not evolve to be hierarchical, even when the task has a hierarchical structure. However, with a connection cost, networks evolve to be both modular and hierarchical, and these networks exhibit higher overall performance and evolvability (i.e. faster adaptation to new environments). Additional analyses confirm that hierarchy independently improves adaptability after controlling for modularity. Overall, our results suggest that the same force-the cost of connections-promotes the evolution of both hierarchy and modularity, and that these properties are important drivers of network performance and adaptability. In addition to shedding light on the emergence of hierarchy across the many domains in which it appears, these findings will also accelerate future research into evolving more complex, intelligent computational brains in the fields of artificial intelligence and robotics.

Promotion of cooperation induced by discriminators in the spatial multi-player donor-recipient game

NASA Astrophysics Data System (ADS)

Cui, Guang-Hai; Wang, Zhen; Ren, Jian-Kang; Lu, Kun; Li, Ming-Chu

2016-11-01

Although the two-player donor-recipient game has been used extensively in studying cooperation in social dilemmas, the scenario in which a donor can simultaneously donate resources to multiple recipients is also common in human societies, economic systems, and social networks. This paper formulates a model of the multi-player donor-recipient game considering a multi-recipient scenario. The promotion of cooperation is also studied by introducing a discriminative cooperation strategy into the game, which donates resources to recipients in proportion to their previous donations with a cost for the collection of information. The evolutionary dynamics of individual strategies are explored in homogeneous and heterogeneous scenarios by leveraging spatial evolutionary game theory. The results show that in a homogeneous scenario, defectors can dominate the network at the equilibrium state only when the cost-to-benefit ratio (R) of donated resources is large. In a heterogeneous scenario, three strategies can coexist all the time within the range of R that was studied, and the promotion of cooperation is more effective when the values of R are smaller. Results from a single node evolution and the formation of local patterns of interaction are provided, and it is analytically shown that discriminators can maintain fairness in resource donation and guarantee long-term cooperation when R is not too large.

Evolutionary dynamics under interactive diversity

NASA Astrophysics Data System (ADS)

Su, Qi; Li, Aming; Wang, Long

2017-10-01

As evidenced by many cases in human societies, individuals often make different behavior decisions in different interactions, and adaptively adjust their behavior in changeable interactive scenarios. However, up to now, how such diverse interactive behavior affects cooperation dynamics has still remained unknown. Here we develop a general framework of interactive diversity, which models individuals’ separated behavior against distinct opponents and their adaptive adjustment in response to opponents’ strategies, to explore the evolution of cooperation. We find that interactive diversity enables individuals to reciprocate every single opponent, and thus sustains large-scale reciprocal interactions. Our work witnesses an impressive boost of cooperation for a notably extensive range of parameters and for all pairwise games. These results are robust against well-mixed and various networked populations, and against degree-normalized and cumulative payoff patterns. From the perspective of network dynamics, distinguished from individuals competing for nodes in most previous work, in this paper, the system evolves in the form of behavior disseminating along edges. We propose a theoretical method based on evolution of edges, which predicts well both the frequency of cooperation and the compact cooperation clusters. Our thorough investigation clarifies the positive role of interactive diversity in resolving social dilemmas and highlights the significance of understanding evolutionary dynamics from the viewpoint of edge dynamics.

Active transport on disordered microtubule networks: the generalized random velocity model.

PubMed

Kahana, Aviv; Kenan, Gilad; Feingold, Mario; Elbaum, Michael; Granek, Rony

2008-11-01

The motion of small cargo particles on microtubules by means of motor proteins in disordered microtubule networks is investigated theoretically using both analytical tools and computer simulations. Different network topologies in two and three dimensions are considered, one of which has been recently studied experimentally by Salman [Biophys. J. 89, 2134 (2005)]. A generalization of the random velocity model is used to derive the mean-square displacement of the cargo particle. We find that all cases belong to the class of anomalous superdiffusion, which is sensitive mainly to the dimensionality of the network and only marginally to its topology. Yet in three dimensions the motion is very close to simple diffusion, with sublogarithmic corrections that depend on the network topology. When details of the thermal diffusion in the bulk solution are included, no significant change to the asymptotic time behavior is found. However, a small asymmetry in the mean microtubule polarity affects the corresponding long-time behavior. We also study a three-dimensional model of the microtubule network in living animal cells. Three first-passage-time problems of intracellular transport are simulated and analyzed for different motor processivities: (i) cargo that originates near the nucleus and has to reach the membrane, (ii) cargo that originates from the membrane and has to reach the nucleus, and (iii) cargo that leaves the nucleus and has to reach a specific target in the cytoplasm. We conclude that while a higher motor processivity increases the transport efficiency in cases (i) and (ii), in case (iii) it has the opposite effect. We conjecture that the balance between the different network tasks, as manifested in cases (i) and (ii) versus case (iii), may be the reason for the evolutionary choice of a finite motor processivity.

Active transport on disordered microtubule networks: The generalized random velocity model

NASA Astrophysics Data System (ADS)

Kahana, Aviv; Kenan, Gilad; Feingold, Mario; Elbaum, Michael; Granek, Rony

2008-11-01

The motion of small cargo particles on microtubules by means of motor proteins in disordered microtubule networks is investigated theoretically using both analytical tools and computer simulations. Different network topologies in two and three dimensions are considered, one of which has been recently studied experimentally by Salman [Biophys. J. 89, 2134 (2005)]. A generalization of the random velocity model is used to derive the mean-square displacement of the cargo particle. We find that all cases belong to the class of anomalous superdiffusion, which is sensitive mainly to the dimensionality of the network and only marginally to its topology. Yet in three dimensions the motion is very close to simple diffusion, with sublogarithmic corrections that depend on the network topology. When details of the thermal diffusion in the bulk solution are included, no significant change to the asymptotic time behavior is found. However, a small asymmetry in the mean microtubule polarity affects the corresponding long-time behavior. We also study a three-dimensional model of the microtubule network in living animal cells. Three first-passage-time problems of intracellular transport are simulated and analyzed for different motor processivities: (i) cargo that originates near the nucleus and has to reach the membrane, (ii) cargo that originates from the membrane and has to reach the nucleus, and (iii) cargo that leaves the nucleus and has to reach a specific target in the cytoplasm. We conclude that while a higher motor processivity increases the transport efficiency in cases (i) and (ii), in case (iii) it has the opposite effect. We conjecture that the balance between the different network tasks, as manifested in cases (i) and (ii) versus case (iii), may be the reason for the evolutionary choice of a finite motor processivity.

Entanglement guarantees emergence of cooperation in quantum prisoner's dilemma games on networks.

PubMed

Li, Angsheng; Yong, Xi

2014-09-05

It was known that cooperation of evolutionary prisoner's dilemma games fails to emerge in homogenous networks such as random graphs. Here we proposed a quantum prisoner's dilemma game. The game consists of two players, in which each player has three choices of strategy: cooperator (C), defector (D) and super cooperator (denoted by Q). We found that quantum entanglement guarantees emergence of a new cooperation, the super cooperation of the quantum prisoner's dilemma games, and that entanglement is the mechanism of guaranteed emergence of cooperation of evolutionary prisoner's dilemma games on networks. We showed that for a game with temptation b, there exists a threshold arccos √b/b for a measurement of entanglement, beyond which, (super) cooperation of evolutionary quantum prisoner's dilemma games is guaranteed to quickly emerge, giving rise to stochastic convergence of the cooperations, that if the entanglement degree γ is less than the threshold arccos √b/b, then the equilibrium frequency of cooperations of the games is positively correlated to the entanglement degree γ, and that if γ is less than arccos √b/b and b is beyond some boundary, then the equilibrium frequency of cooperations of the games on random graphs decreases as the average degree of the graphs increases.

Turning gold into ‘junk’: transposable elements utilize central proteins of cellular networks

PubMed Central

Abrusán, György; Szilágyi, András; Zhang, Yang; Papp, Balázs

2013-01-01

The numerous discovered cases of domesticated transposable element (TE) proteins led to the recognition that TEs are a significant source of evolutionary innovation. However, much less is known about the reverse process, whether and to what degree the evolution of TEs is influenced by the genome of their hosts. We addressed this issue by searching for cases of incorporation of host genes into the sequence of TEs and examined the systems-level properties of these genes using the Saccharomyces cerevisiae and Drosophila melanogaster genomes. We identified 51 cases where the evolutionary scenario was the incorporation of a host gene fragment into a TE consensus sequence, and we show that both the yeast and fly homologues of the incorporated protein sequences have central positions in the cellular networks. An analysis of selective pressure (Ka/Ks ratio) detected significant selection in 37% of the cases. Recent research on retrovirus-host interactions shows that virus proteins preferentially target hubs of the host interaction networks enabling them to take over the host cell using only a few proteins. We propose that TEs face a similar evolutionary pressure to evolve proteins with high interacting capacities and take some of the necessary protein domains directly from their hosts. PMID:23341038

Wavelet evolutionary network for complex-constrained portfolio rebalancing

NASA Astrophysics Data System (ADS)

Suganya, N. C.; Vijayalakshmi Pai, G. A.

2012-07-01

Portfolio rebalancing problem deals with resetting the proportion of different assets in a portfolio with respect to changing market conditions. The constraints included in the portfolio rebalancing problem are basic, cardinality, bounding, class and proportional transaction cost. In this study, a new heuristic algorithm named wavelet evolutionary network (WEN) is proposed for the solution of complex-constrained portfolio rebalancing problem. Initially, the empirical covariance matrix, one of the key inputs to the problem, is estimated using the wavelet shrinkage denoising technique to obtain better optimal portfolios. Secondly, the complex cardinality constraint is eliminated using k-means cluster analysis. Finally, WEN strategy with logical procedures is employed to find the initial proportion of investment in portfolio of assets and also rebalance them after certain period. Experimental studies of WEN are undertaken on Bombay Stock Exchange, India (BSE200 index, period: July 2001-July 2006) and Tokyo Stock Exchange, Japan (Nikkei225 index, period: March 2002-March 2007) data sets. The result obtained using WEN is compared with the only existing counterpart named Hopfield evolutionary network (HEN) strategy and also verifies that WEN performs better than HEN. In addition, different performance metrics and data envelopment analysis are carried out to prove the robustness and efficiency of WEN over HEN strategy.

Measuring the Evolutionary Rewiring of Biological Networks

PubMed Central

Shou, Chong; Bhardwaj, Nitin; Lam, Hugo Y. K.; Yan, Koon-Kiu; Kim, Philip M.; Snyder, Michael; Gerstein, Mark B.

2011-01-01

We have accumulated a large amount of biological network data and expect even more to come. Soon, we anticipate being able to compare many different biological networks as we commonly do for molecular sequences. It has long been believed that many of these networks change, or “rewire”, at different rates. It is therefore important to develop a framework to quantify the differences between networks in a unified fashion. We developed such a formalism based on analogy to simple models of sequence evolution, and used it to conduct a systematic study of network rewiring on all the currently available biological networks. We found that, similar to sequences, biological networks show a decreased rate of change at large time divergences, because of saturation in potential substitutions. However, different types of biological networks consistently rewire at different rates. Using comparative genomics and proteomics data, we found a consistent ordering of the rewiring rates: transcription regulatory, phosphorylation regulatory, genetic interaction, miRNA regulatory, protein interaction, and metabolic pathway network, from fast to slow. This ordering was found in all comparisons we did of matched networks between organisms. To gain further intuition on network rewiring, we compared our observed rewirings with those obtained from simulation. We also investigated how readily our formalism could be mapped to other network contexts; in particular, we showed how it could be applied to analyze changes in a range of “commonplace” networks such as family trees, co-authorships and linux-kernel function dependencies. PMID:21253555

Gene Circuit Analysis of the Terminal Gap Gene huckebein

PubMed Central

Ashyraliyev, Maksat; Siggens, Ken; Janssens, Hilde; Blom, Joke; Akam, Michael; Jaeger, Johannes

2009-01-01

The early embryo of Drosophila melanogaster provides a powerful model system to study the role of genes in pattern formation. The gap gene network constitutes the first zygotic regulatory tier in the hierarchy of the segmentation genes involved in specifying the position of body segments. Here, we use an integrative, systems-level approach to investigate the regulatory effect of the terminal gap gene huckebein (hkb) on gap gene expression. We present quantitative expression data for the Hkb protein, which enable us to include hkb in gap gene circuit models. Gap gene circuits are mathematical models of gene networks used as computational tools to extract regulatory information from spatial expression data. This is achieved by fitting the model to gap gene expression patterns, in order to obtain estimates for regulatory parameters which predict a specific network topology. We show how considering variability in the data combined with analysis of parameter determinability significantly improves the biological relevance and consistency of the approach. Our models are in agreement with earlier results, which they extend in two important respects: First, we show that Hkb is involved in the regulation of the posterior hunchback (hb) domain, but does not have any other essential function. Specifically, Hkb is required for the anterior shift in the posterior border of this domain, which is now reproduced correctly in our models. Second, gap gene circuits presented here are able to reproduce mutants of terminal gap genes, while previously published models were unable to reproduce any null mutants correctly. As a consequence, our models now capture the expression dynamics of all posterior gap genes and some variational properties of the system correctly. This is an important step towards a better, quantitative understanding of the developmental and evolutionary dynamics of the gap gene network. PMID:19876378

Gene circuit analysis of the terminal gap gene huckebein.

PubMed

Ashyraliyev, Maksat; Siggens, Ken; Janssens, Hilde; Blom, Joke; Akam, Michael; Jaeger, Johannes

2009-10-01

The early embryo of Drosophila melanogaster provides a powerful model system to study the role of genes in pattern formation. The gap gene network constitutes the first zygotic regulatory tier in the hierarchy of the segmentation genes involved in specifying the position of body segments. Here, we use an integrative, systems-level approach to investigate the regulatory effect of the terminal gap gene huckebein (hkb) on gap gene expression. We present quantitative expression data for the Hkb protein, which enable us to include hkb in gap gene circuit models. Gap gene circuits are mathematical models of gene networks used as computational tools to extract regulatory information from spatial expression data. This is achieved by fitting the model to gap gene expression patterns, in order to obtain estimates for regulatory parameters which predict a specific network topology. We show how considering variability in the data combined with analysis of parameter determinability significantly improves the biological relevance and consistency of the approach. Our models are in agreement with earlier results, which they extend in two important respects: First, we show that Hkb is involved in the regulation of the posterior hunchback (hb) domain, but does not have any other essential function. Specifically, Hkb is required for the anterior shift in the posterior border of this domain, which is now reproduced correctly in our models. Second, gap gene circuits presented here are able to reproduce mutants of terminal gap genes, while previously published models were unable to reproduce any null mutants correctly. As a consequence, our models now capture the expression dynamics of all posterior gap genes and some variational properties of the system correctly. This is an important step towards a better, quantitative understanding of the developmental and evolutionary dynamics of the gap gene network.

Virophages, polintons, and transpovirons: a complex evolutionary network of diverse selfish genetic elements with different reproduction strategies.

PubMed

Yutin, Natalya; Raoult, Didier; Koonin, Eugene V

2013-05-23

Recent advances of genomics and metagenomics reveal remarkable diversity of viruses and other selfish genetic elements. In particular, giant viruses have been shown to possess their own mobilomes that include virophages, small viruses that parasitize on giant viruses of the Mimiviridae family, and transpovirons, distinct linear plasmids. One of the virophages known as the Mavirus, a parasite of the giant Cafeteria roenbergensis virus, shares several genes with large eukaryotic self-replicating transposon of the Polinton (Maverick) family, and it has been proposed that the polintons evolved from a Mavirus-like ancestor. We performed a comprehensive phylogenomic analysis of the available genomes of virophages and traced the evolutionary connections between the virophages and other selfish genetic elements. The comparison of the gene composition and genome organization of the virophages reveals 6 conserved, core genes that are organized in partially conserved arrays. Phylogenetic analysis of those core virophage genes, for which a sufficient diversity of homologs outside the virophages was detected, including the maturation protease and the packaging ATPase, supports the monophyly of the virophages. The results of this analysis appear incompatible with the origin of polintons from a Mavirus-like agent but rather suggest that Mavirus evolved through recombination between a polinton and an unknown virus. Altogether, virophages, polintons, a distinct Tetrahymena transposable element Tlr1, transpovirons, adenoviruses, and some bacteriophages form a network of evolutionary relationships that is held together by overlapping sets of shared genes and appears to represent a distinct module in the vast total network of viruses and mobile elements. The results of the phylogenomic analysis of the virophages and related genetic elements are compatible with the concept of network-like evolution of the virus world and emphasize multiple evolutionary connections between bona fide viruses and other classes of capsid-less mobile elements.

Virophages, polintons, and transpovirons: a complex evolutionary network of diverse selfish genetic elements with different reproduction strategies

PubMed Central

2013-01-01

Background Recent advances of genomics and metagenomics reveal remarkable diversity of viruses and other selfish genetic elements. In particular, giant viruses have been shown to possess their own mobilomes that include virophages, small viruses that parasitize on giant viruses of the Mimiviridae family, and transpovirons, distinct linear plasmids. One of the virophages known as the Mavirus, a parasite of the giant Cafeteria roenbergensis virus, shares several genes with large eukaryotic self-replicating transposon of the Polinton (Maverick) family, and it has been proposed that the polintons evolved from a Mavirus-like ancestor. Results We performed a comprehensive phylogenomic analysis of the available genomes of virophages and traced the evolutionary connections between the virophages and other selfish genetic elements. The comparison of the gene composition and genome organization of the virophages reveals 6 conserved, core genes that are organized in partially conserved arrays. Phylogenetic analysis of those core virophage genes, for which a sufficient diversity of homologs outside the virophages was detected, including the maturation protease and the packaging ATPase, supports the monophyly of the virophages. The results of this analysis appear incompatible with the origin of polintons from a Mavirus-like agent but rather suggest that Mavirus evolved through recombination between a polinton and an unknownvirus. Altogether, virophages, polintons, a distinct Tetrahymena transposable element Tlr1, transpovirons, adenoviruses, and some bacteriophages form a network of evolutionary relationships that is held together by overlapping sets of shared genes and appears to represent a distinct module in the vast total network of viruses and mobile elements. Conclusions The results of the phylogenomic analysis of the virophages and related genetic elements are compatible with the concept of network-like evolution of the virus world and emphasize multiple evolutionary connections between bona fide viruses and other classes of capsid-less mobile elements. PMID:23701946