New stability criteria for uncertain neural networks with interval time-varying delays

This paper is concerned with the stability analysis for neural networks with interval time-varying delays and parameter uncertainties. An approach combining the Lyapunov-Krasovskii functional with the differential inequality and linear matrix inequality techniques is taken to investigate this problem. By constructing a new Lyapunov-Krasovskii functional and introducing some free weighting matrices, some less conservative delay-derivative-dependent and delay-derivative-independent stability criteria are established in term of linear matrix inequality. And the new criteria are applicable to both fast and slow time-varying delays. Three numerical examples show that the proposed criterion are effective and is an improvement over some existing results in the literature.     

Design of delay-dependent state estimator for discrete-time recurrent neural networks with interval discrete and infinite-distributed time-varying delays

The state estimation problem for discrete-time recurrent neural networks with both interval discrete and infinite-distributed time-varying delays is studied in this paper, where interval discrete time-varying delay is in a given range. The activation functions are assumed to be globally Lipschitz continuous. A delay-dependent condition for the existence of state estimators is proposed based on new bounding techniques. Via solutions to certain linear matrix inequalities, general full-order state estimators are designed that ensure globally asymptotic stability. The significant feature is that no inequality is needed for seeking upper bounds for the inner product between two vectors, which can reduce the conservatism of the criterion by employing the new bounding techniques. Two illustrative examples are given to demonstrate the effectiveness and applicability of the proposed approach.     

Robust filtering for stochastic genetic regulatory networks with time-varying delay

This paper addresses the robust filtering problem for a class of linear genetic regulatory networks (GRNs) with stochastic disturbances, parameter uncertainties and time delays. The parameter uncertainties are assumed to reside in a polytopic region, the stochastic disturbance is state-dependent described by a scalar Brownian motion, and the time-varying delays enter into both the translation process and the feedback regulation process. We aim to estimate the true concentrations of mRNA and protein by designing a linear filter such that, for all admissible time delays, stochastic disturbances as well as polytopic uncertainties, the augmented state estimation dynamics is exponentially mean square stable with an expected decay rate. A delay-dependent linear matrix inequality (LMI) approach is first developed to derive sufficient conditions that guarantee the exponential stability of the augmented dynamics, and then the filter gains are parameterized in terms of the solution to a set of LMIs. Note that LMIs can be easily solved by using standard software packages. A simulation example is exploited in order to illustrate the effectiveness of the proposed design procedures.     

Evolving modular genetic regulatory networks with a recursive,top-down approach

Being able to design genetic regulatory networks (GRNs) to achieve a desired cellular function is one of the main goals of synthetic biology. However, determining minimal GRNs that produce desired time-series behaviors is non-trivial. In this paper, we propose a ‘top-down’ approach to evolving small GRNs and then use these to recursively boot-strap the identification of larger, more complex, modular GRNs. We start with relatively dense GRNs and then use differential evolution (DE) to evolve interaction coefficients. When the target dynamical behavior is found embedded in a dense GRN, we narrow the focus of the search and begin aggressively pruning out excess interactions at the end of each generation. We first show that the method can quickly rediscover known small GRNs for a toggle switch and an oscillatory circuit. Next we include these GRNs as non-evolvable subnetworks in the subsequent evolution of more complex, modular GRNs. Successful solutions found in canonical DE where we truncated small interactions to zero, with or without an interaction penalty term, invariably contained many excess interactions. In contrast, by incorporating aggressive pruning and the penalty term, the DE was able to find minimal or nearly minimal GRNs in all test problems.     

Modelling the evolution of genetic regulatory networks

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

Unconditional global exponential stability in Lagrange sense of genetic regulatory networks with SUM regulatory logic

In this paper, the global exponential stability in Lagrange sense for genetic regulatory networks (GRNs) with SUM regulatory logic is firstly studied. By constructing appropriate Lyapunov-like functions, several criteria are presented for the boundedness, ultimate boundedness and global exponential attractivity of GRNs. It can be obtained that GRNs with SUM regulatory logic are unconditionally globally exponentially stable in Lagrange sense. These results can be applied to analyze monostable as well as multistable networks. Furthermore, to analyze the stability for GRNs more comprehensively, the existence of equilibrium point of GRNs is proved, and some sufficient conditions of the global exponential stability in Lyapunov sense for GRNs are derived. Finally two numerical examples are given to illustrate the application of the obtained results.     

A proposal for using the ensemble approach to understand genetic regulatory networks

Understanding the genetic regulatory network comprising genes, RNA, proteins and the network connections and dynamical control rules among them, is a major task of contemporary systems biology. I focus here on the use of the ensemble approach to find one or more well-defined ensembles of model networks whose statistical features match those of real cells and organisms. Such ensembles should help explain and predict features of real cells and organisms. More precisely, an ensemble of model networks is defined by constraints on the "wiring diagram" of regulatory interactions, and the "rules" governing the dynamical behavior of regulated components of the network. The ensemble consists of all networks consistent with those constraints. Here I discuss ensembles of random Boolean networks, scale free Boolean networks, "medusa" Boolean networks, continuous variable networks, and others. For each ensemble, M statistical features, such as the size distribution of avalanches in gene activity changes unleashed by transiently altering the activity of a single gene, the distribution in distances between gene activities on different cell types, and others, are measured. This creates an M-dimensional space, where each ensemble corresponds to a cluster of points or distributions. Using current and future experimental techniques, such as gene arrays, these M properties are to be measured for real cells and organisms, again yielding a cluster of points or distributions in the M-dimensional space. The procedure then finds ensembles close to those of real cells and organisms, and hill climbs to attempt to match the observed M features. Thus obtains one or more ensembles that should predict and explain many features of the regulatory networks in cells and organisms.     

Synchronization criteria of discrete-time complex networks with time-varying delays and parameter uncertainties

This paper is pertained with the synchronization problem for an array of coupled discrete-time complex networks with the presence of both time-varying delays and parameter uncertainties. The time-varying delays are considered both in the network couplings and dynamical nodes. By constructing suitable Lyapunov–Krasovskii functional and utilizing convex reciprocal lemma, new synchronization criteria for the complex networks are established in terms of linear matrix inequalities. Delay-partitioning technique is employed to incur less conservative results. All the results presented here not only depend upon lower and upper bounds of the time-delay, but also the number of delay partitions. Numerical simulations are rendered to exemplify the effectiveness and applicability of the proposed results.     

Exponential synchronization of discontinuous neural networks with time-varying mixed delays via state feedback and impulsive control

This paper investigates drive-response synchronization for a class of neural networks with time-varying discrete and distributed delays (mixed delays) as well as discontinuous activations. Strict mathematical proof shows the global existence of Filippov solutions to neural networks with discontinuous activation functions and the mixed delays. State feedback controller and impulsive controller are designed respectively to guarantee global exponential synchronization of the neural networks. By using Lyapunov function and new analysis techniques, several new synchronization criteria are obtained. Moreover, lower bound on the convergence rate is explicitly estimated when state feedback controller is utilized. Results of this paper are new and some existing ones are extended and improved. Finally, numerical simulations are given to verify the effectiveness of the theoretical results.     

On multistability of delayed genetic regulatory networks with multivariable regulation functions

Many genetic regulatory networks (GRNs) have the capacity to reach different stable states. This capacity is defined as multistability which is an important regulation mechanism. Multiple time delays and multivariable regulation functions are usually inevitable in such GRNs. In this paper, multistability of GRNs is analyzed by applying the control theory and mathematical tools. This study is to provide a theoretical tool to facilitate the design of synthetic gene circuit with multistability in the perspective of control theory. By transforming such GRNs into a new and uniform mathematical formulation, we put forward a general sector-like regulation function that is capable of quantifying the regulation effects in a more precise way. By resorting to up-to-date techniques, a novel Lyapunov-Krasovskii functional (LKF) is introduced for achieving delay dependence to ensure less conservatism. New conditions are then proposed to ensure the multistability of a GRN in the form of linear matrix inequalities (LMIs) that are dependent on the delays. Our multistability conditions are applicable to several frequently used regulation functions especially the multivariable ones. Two examples are employed to illustrate the applicability and usefulness of the developed theoretical results.     

Robust stability of genetic regulatory networks with distributed delay

This paper investigates robust stability of genetic regulatory networks with distributed delay. Different from other papers, distributed delay is induced. It says that the concentration of macromolecule depends on an integral of the regulatory function of over a specified range of previous time, which is more realistic. Based on Lyapunov stability theory and linear matrix inequality (LMI), sufficient conditions for genetic regulatory networks to be global asymptotic stability and robust stability are derived in terms of LMI. Two numerical examples are given to illustrate the effectiveness of our theoretical results.     

Sufficient and necessary conditions for Lyapunov stability of genetic networks with SUM regulatory logic

In this paper, a nonlinear model for genetic regulator networks (GRNs) with SUM regulatory logic is presented. Four sufficient and necessary conditions of global asymptotical stability and global exponential stability for the equilibrium point of the GRNs are proposed, respectively. Specifically, three weak sufficient conditions and corresponding corollaries are derived by using comparing theorem and Dini derivative method. Then, a famous GRN model is used as the example to illustrate the effectiveness of our theoretical results. Comparing to the results in the previous literature, some novel ideas, study methods and interesting results are explored.     

The effect of scale-free topology on the robustness and evolvability of genetic regulatory networks

We investigate how scale-free (SF) and Erd?s-Rényi (ER) topologies affect the interplay between evolvability and robustness of model gene regulatory networks with Boolean threshold dynamics. In agreement with Oikonomou and Cluzel (2006) we find that networks with SF_in topologies, that is SF topology for incoming nodes and ER topology for outgoing nodes, are significantly more evolvable towards specific oscillatory targets than networks with ER topology for both incoming and outgoing nodes. Similar results are found for networks with SF_both and SF_out topologies. The functionality of the SF_out topology, which most closely resembles the structure of biological gene networks (Babu et al., 2004), is compared to the ER topology in further detail through an extension to multiple target outputs, with either an oscillatory or a non-oscillatory nature. For multiple oscillatory targets of the same length, the differences between SF_out and ER networks are enhanced, but for non-oscillatory targets both types of networks show fairly similar evolvability. We find that SF networks generate oscillations much more easily than ER networks do, and this may explain why SF networks are more evolvable than ER networks are for oscillatory phenotypes. In spite of their greater evolvability, we find that networks with SF_out topologies are also more robust to mutations (mutational robustness) than ER networks. Furthermore, the SF_out topologies are more robust to changes in initial conditions (environmental robustness). For both topologies, we find that once a population of networks has reached the target state, further neutral evolution can lead to an increase in both the mutational robustness and the environmental robustness to changes in initial conditions.     

Global robust power-rate stability of delayed genetic regulatory networks with noise perturbations

In this paper, by using the Lyapunov method, Itô’s differential formula and linear matrix inequality (LMI) approach, the global robust power-rate stability in mean square is discussed for genetic regulatory networks with unbounded time-varying delay, noise perturbations and parameter uncertainties. Sufficient conditions are given to ensure the robust power-rate stability (in mean square) of the genetic regulatory networks. Meanwhile, the criteria ensuring global power-rate stability in mean square are a byproduct of the criteria guaranteeing global robust power-rate stability in mean square. The obtained conditions are derived in terms of linear matrix inequalities (LMIs) which are easy to be verified via the LMI toolbox. An illustrative example is given to show the effectiveness of the obtained result.     

Exponential input-to-state stability of recurrent neural networks with multiple time-varying delays

In this paper, input-to-state stability problems for a class of recurrent neural networks model with multiple time-varying delays are concerned with. By utilizing the Lyapunov–Krasovskii functional method and linear matrix inequalities techniques, some sufficient conditions ensuring the exponential input-to-state stability of delayed network systems are firstly obtained. Two numerical examples and its simulations are given to illustrate the efficiency of the derived results.     

Reliability of regulatory networks and its evolution

The problem of reliability of the dynamics in biological regulatory networks is studied in the framework of a generalized Boolean network model with continuous timing and noise. Using well-known artificial genetic networks such as the repressilator, we discuss concepts of reliability of rhythmic attractors. In a simple evolution process we investigate how overall network structure affects the reliability of the dynamics. In the course of the evolution, networks are selected for reliable dynamics. We find that most networks can be easily evolved towards reliable functioning while preserving the original function.