Skip to main content
Cognitive Neurodynamics logoLink to Cognitive Neurodynamics
. 2010 Jun 19;4(3):251–261. doi: 10.1007/s11571-010-9113-1

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

Qi Luo 1, Rubei Zhang 1,, Xiaoxin Liao 2
PMCID: PMC2918749  PMID: 21886678

Abstract

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.

Keywords: Genetic regulatory networks, Lagrange stability, Unconditional global exponential stability, Lyapunov function

Introduction

With the appearance and development of DNA microarray technology (Pease et al. 1994), it has become possible to measure gene expression levels on a genomic scale and furthermore analyze the genetic regulatory networks (GRNs). Considerable attention has been contributed to theoretical analysis and experimental investigation on GRNs (Becskei and Serrano 2000; Gardner et al. 2000; Li et al. 2006a, b; Ren and Cao 2008; Chen and Aihara 2002). And the GRN is the key to understand how genes and proteins interact to form a network that performs complicated biological functions. In living organisms, the process in which the information encoded in DNA is converted into proteins through transcription and translation is called gene expression. So gene expression is a process consisting of transcription and translation. During transcription process, mRNAs are synthesized from genes by the regulations of transcription factors, which are proteins. During translation process, the sequence of nucleotides in the mRNA is used in the synthesis of a protein. A genetic regulatory network is a dynamic system to describe highly complex interactions among two main species of gene product: mRNAs and proteins, in the interactive transcription and translation processes. Several computational models have been applied to investigate the behaviors of genetic regulatory networks: Bayesian network models (Friedman et al. 2000; Hartemink et al. 2002), Petri net models (Chaouiya et al. 2008; Hardy and Robillard 2004), the Boolean models (Somogyi and Sniegoski 1996; Weaver et al. 1999), and the differential equation models (Bolouri and Davidson 2002; Chen and Aihara 2002; Jong 2002; Smolen et al. 2000), etc. In the differential model, the variables describe the concentrations of gene product, such as mRNA and proteins, as continuous value of the genetic regulatory systems. Meanwhile the differential model has been more widely used to investigate the GRNs, and certain quantitative results have been presented (Chen and Aihara 2002; Jong 2002; Goodwin 1963; Chen et al. 1999; Tian et al. 2007).

As a dynamic system, it is natural of great importance to investigate the stability of GRNs. Li et al. (2006), Ren and Cao (2008), Chen and Aihara (2002), Wang and Cao (2009), Wang et al. (2009) have derived some results. Li et al. (2006), presented a nonlinear model for GRNs with SUM logic and gave some criteria for the stability. Ren and Cao (2008), studied the stability for a class of GRNs with time delays and the robust stability for GRNs with norm bounded uncertainties. Wang and Cao (2009) presented some sufficient conditions for the robust stability for stochastic GRNs with parameters uncertainty. And GRNs with distributed delays were addressed in Wang et al. (2009). From a dynamical system point of view, globally stable networks in Lyapunov sense are monostable systems, which have a unique equilibrium point attracting all trajectories asymptotically. But in many real applications, biological systems are no longer globally stable, thus more appropriate notions of stability are needed to deal with multistable networks. Yi and Tan (2004) investigated three important properties: boundedness, attractivity and complete convergence of a multistable networks. Liao and Wang (2003) addressed the global dissipativity of a general class of continuous-time recurrent neural networks.

The main difference between Lagrange stability and Lyapunov stability is that Lagrange stability refers to the stability of total systems, not the stability of equilibrium points. When studying the stability in Lagrange sense, we don’t make any assumption on the numbers of the equilibrium points. Especially as to the asymptotical stability in Lagrange sense, only if all the solutions of a system ultimately enter into an attractive compact set, we call the system to be asymptotically stable in Lagrange sense or ultimately bounded. Lagrange stability can be used in analyzing both monostable systems and multistable systems and it is less conservative. And in the special case where the attractive compact set is a single point, the system is globally stable in Lyapunov sense and the attractive compact set is the unique equilibrium point.

We have noted that Lagrange stability has long been studied in the theory and applications of dynamical systems. LaSalle (1960) and Yoshizawa (1966), apply Lyapunov functions to study Lagrange stability. In Thornton and Mulholland (1974), Rekasius considers asymptotic stability in Lagrange sense for nonlinear feedback control systems. In Rekasius (1963), Lagrange stability is discussed by Thornton and Mulholland as a useful concept for determining the stability of ecological systems. More recently, Passino and Burgess (1995) adapt the concept of Lagrange stability to investigate discrete event systems, and Hassibi et al. (1999) study the Lagrange stability of hybrid dynamical systems. Wang et al. (2006) and Yang and Huang (2006), investigates Lagrange stability for pendulum-like systems. See also (Liao et al. 2008a, b; Chen and Luo 2009) for recent results on global exponential stability in Lagrange sense for neural networks with time delay.

To the best of our knowledge, the current results of stability analysis for GRNs is all based on the Lyapunov global stability. The Lagrange stability for GRNs has not been touched. Hence, from the perspective of theory and application, it is of significance to study the Lagrange stability for GRNs. In this paper, we first study the globally exponentially stability in Lagrange sense for GRNs with time delay and presents some criteria for global exponential attractive set of GRNs. In order to give a comprehensive study of the stability for GRNs, we also investigate the stability in Lyapunov sense for GRNs. We first prove the existence of the equilibrium point of the GRNs, and then study the global exponential stability in Lyapunov sense for GRNs and derive two theorems. It is believed that our results are useful for comprehensive analysis of GRNs and have certain applicable value.

The rest of this paper is organized as follows. In the section following the introduction section, a description of problem formulation and preliminaries are given. We then present the main results of global exponential stability in Lagrange sense for GRNs. The existence of the equilibrium point of GRNs is proved in the following section. The next section considers the global exponential stability in Lyapunov sense of GRNs. In the final section, two numerical examples are given to illustrate the application of our results.

Problem formulation and preliminaries

In this paper, we consider the GRN described by the following differential equations (Wang and Zhang 2007; Li et al. 2006; Chen and Aihara 2002):

graphic file with name M1.gif 1

where mi(t), pi(t) are the concentrations of mRNA and protein of the ith node, respectively. In this network, there is only one output but multiple inputs for a single node or gene. If the transcriptional factor or protein j regulates the gene i, a direct edge will be linked from node j to i (Chen and Aihara 2002). In (1), the parameters ai and ci are the decay rates of mRNA and protein, respectively, di is a constant, which is the translational rate. bi is the regulation function of the ith gene, and it is generally a nonlinear function of the variables (p1(t), p2(t), …, pn(t)) but has a form of monotone with each variable (Jong 2002; Smolen et al. 2000).

The gene activities are tightly controlled in cellular, and the gene regulation function bi plays an essential role in the dynamics. Generally the form of bi may be very complicated, depending on all biochemical reactions involved in this regulation. In this paper, we investigate the model of GRN where each transcriptional factor acts additively to regulate the ith gene. That is the regulation function has a form of Inline graphic, which is also called SUM logic (Yuh et al. 1998; Kalir et al. 2005). The function bij(pj(t)) is a monotonic function of Hill form, which can be expressed as follows:

graphic file with name M3.gif

where Hj is the Hill coefficient, βj is a positive constant, αij is the dimensionless transcriptional rate of transcriptional factor j to gene i, which is a bounded constant.

Note that,

graphic file with name M4.gif

Hence, we can rewrite Eq. (1) as follows,

graphic file with name M5.gif 2

where Inline graphic is a monotonically increasing function. Ii is defined as a basal rate, Inline graphic, in which Vi1 is the set of repressors of gene i. And wij is defined as follows: if there is no link from node j to node i, wij = 0; if transcription factor j is an activator of gene i, wij = αij; if transcription factors j is a repressor of gene i, wij = −αij.

In the real genetic regulatory networks, time delays usually exist due to the slow process of diffusion, transcription and translation of modular. Taking the time delays into account, (2) can be transformed to

graphic file with name M8.gif 3

where τ = max {τ(t), σ(t)}.

Let C[−τ,0] be the Banach space of continuous functions Inline graphic, Inline graphic with the norm Inline graphic and Inline graphic, respectively. Define two subsets on space C[−τ,0],

graphic file with name M13.gif
graphic file with name M14.gif

where E > 0, H > 0 are positive constants. Let BBF+ be the set of all non-negative continuous functional Inline graphic, mapping bounded sets in C[−τ,0] into bounded sets in [0, +∞).For any initial function φ ∈ C[−τ,0], ψ ∈ C[−τ,0], the solution of (2) with initial conditions (φ, ψ)will be denoted by m(t, φ), p(t, ψ), respectively.

Let Ω1, Ω2 ∈ Rn be compact sets in Rn. Denote the complement by Inline graphic and Inline graphic, respectively. For any Inline graphic is the distance between m and Inline graphic, and for any Inline graphic is the distance between p and Inline graphic. We call the compact set Inline graphica global attractive set with respect to partial variables (m1, m2, …, mn) of system (3) if for every solution such that Inline graphic, one has Inline graphic. Similarly, We call the compact set Ω2 a global attractive set with respect to partial variables Inline graphic of system (3) if for every solution such that Inline graphic, one has Inline graphic. The compact set Inline graphic is the global attractive set of system (3).Obviously, if the system (3) has a global attractive set, then the solutions of (3) are ultimately bounded.

Now we introduce some necessary definitions (Kalir et al. 2005).

Definition 1 The GRN(3) is said to be uniformly stable in Lagrange sense (or uniformly bounded), if for any E > 0, H > 0, there exist constants K1 = K(E) > 0, K2 = K(H) > 0 such that m(t, φ) < K1, p(tψ) < K2, t ≥ 0 for all Inline graphic.The GRN(3) is said to be uniformly asymptotically stable in Lagrange sense (or ultimately uniformly bounded), if for any E > 0, H > 0, there exist constants K1 = K(E) > 0, K2 = K(H) > 0 and T > 0 such that m(tφ) < K1p(tψ) < K2, t ≥ T for all Inline graphic.

Definition 2 If there exist a positive constant α1 > 0 (α2 > 0) and a continuous function Inline graphic, such that for Inline graphic, every solution of system (3) with respect to partial variables (m1, m2, …, mn) ((p1, p2, …, pn)) Inline graphic (Inline graphic) satisfies, Inline graphic (Inline graphic). So the compact set Inline graphic (Inline graphic) is said to be a globally exponentially attractive (GEA) set with respect to partial variables Inline graphic (Inline graphic) of system (3). The compact set Inline graphic is the globally exponentially attractive set of GRN(3).The above definition for a GEA set is often difficult to use. The main difficulty is that the distance function seems hard to be direct linked to the exponential decay function. So we now cite following definitions, which involve positive definite function and hence typically suitable in employing Lyapunov-like function to analyze the global exponential attractivity of GRN(3).

Definition 3 If there exist positive constants l1 > 0, α1 > 0 (l2 > 0, α2 > 0) and a radially unbounded Lyapunov function V1(m) (V2(p)), and a continuous functional Inline graphic such that for every solution with respect to partial variables (m1, m2, …, mn) ((p1, p2, …, pn)) of system (3) m(t) = m(tφ)(p(t) = p(tψ)), V1(m(t)) > l1, t ≥ 0, (V2(p(t)) > l2, t ≥ 0) implies Inline graphicInline graphic.Then the GRN(3) is said to be globally exponentially attractive with respect to partial variables Inline graphicInline graphic, the GRN(3) is globally exponentially attractive with respect to Inline graphic. The compact set Inline graphic (Inline graphic) is called a GEA set with respect to partial variables Inline graphicInline graphic of system (3). The compact set Inline graphic is the GEA set of GRN(3).

Definition 4 The GRN(3) is called globally exponentially stable (GES) in Lagrange sense, if it is both uniformly stable in Lagrange sense and globally exponentially attractive. If there is a need to emphasize the Lyapunov-like functions, the network (3) will be called globally exponentially stable in Lagrange sense with respect to (V1, V2).

We now give a lemma that will be used in the proof of main results.

Lemma 1 (Liao 2000) LetInline graphicbe a positive definite and radially unbounded function, and there exist two constants α > 0, β > 0 such that

graphic file with name M54.gif 4

ThenInline graphic.Particularly ifInline graphic, forInline graphic, V(x) exponentially approachesInline graphicas t increases.

Proof We consider the comparison equation of (4)

graphic file with name M59.gif 5

The solutions of the comparison equation of (5) as

graphic file with name M60.gif

By the comparison theory, we have

graphic file with name M61.gif

Unconditional global exponential stability in Lagrange sense for GRNs

We should point out that the unconditional stability in Lagrange sense indicates that the system is stable in Lagrange sense without any additional conditions. We also don’t make any assumption about the model or the parameters of the model, either. The results derived are all constructive and not dependent on any existence conditions. In the following, we will consider the unconditional global exponential stability in Lagrange sense for GRN(3).

From the above discussion, we can derive Inline graphic, in the following, we will take full advantage of this property. Choose Inline graphic, Inline graphic. And denote Inline graphic, Inline graphic, Inline graphic, Inline graphic.

Theorem 1 GRN(3) is unconditionally globally exponentially stable in Lagrange sense. The compact setInline graphicis a GEA set with respect to partial variablesInline graphic; The compact setInline graphicis a GEA set with respect to partial variablesInline graphic. And the compact setInline graphicis a GEA set of GRN(3).

Proof

  1. Construct a radially unbounded and positive definite Lyapunov function with respect to partial variables Inline graphicfor the first equation of (3).
    graphic file with name M75.gif

Choose Inline graphic, and compute the derivative of V1 along (3)

graphic file with name M77.gif

where Inline graphic. By Lemma 1, we have Inline graphic, where Inline graphic. That implies the uniform boundedness and ultimate uniform boundedness of the solution with respect to partial variables Inline graphic of system (3), which means the GRN(3) is uniformly stable in Lagrange sense with respect to partial variables Inline graphic. Note that,

graphic file with name M83.gif

where Inline graphic,and this implies that for t ≥ 0

graphic file with name M85.gif

by Definition (3), GRN(3) is globally exponentially attractive and Inline graphic is a GEA set with respect to partial variables Inline graphic.

  1. From step 1), we can see that mi(t) is uniformly bounded, and the ultimate bound is Inline graphic. Let Inline graphic. For the partial variables Inline graphicof the second equation of (3), we may let Inline graphic

We now construct a radially unbounded and positive definite Lyapunov function with respect to partial variables Inline graphic for the second equation of (3) as

graphic file with name M93.gif

Choose Inline graphic and compute the derivative of V2 along (3)

graphic file with name M95.gif

where Inline graphic. By Lemma 1, we have Inline graphic, where Inline graphic. That implies the uniform boundedness and ultimate uniform boundedness of the solution with respect to partial variables Inline graphic of system (3), which means the GRN(3) is uniformly stable in Lagrange sense with respect to partial variables Inline graphic. Note that,

graphic file with name M101.gif

where Inline graphic, and this implies that for t ≥ 0

graphic file with name M103.gif

By Definition (3), GRN(3) is globally exponentially attractive and Inline graphic is a GEA set with respect to partial variables Inline graphic.According to 1) and 2), we can conclude that the GRN(3) is uniformly stable and the compact set Inline graphic is GEA set of GRN(3). Hence by Definition 4, GRN(3) is globally exponentially stable in Lagrange sense.Proof is completed.

Denoting Inline graphic, Inline graphic, Inline graphic.

Theorem 2 GRN(3) is unconditionally globally exponentially stable in Lagrange sense. And the compact setInline graphicis a GEA set with respect to partial variablesInline graphic; The compact setInline graphicis a GEA set with respect to partial variablesInline graphic. Thus the compact setInline graphicis a GEA set of GRN(3).

Proof

  1. Employ a radially unbounded and positive definite Lyapunov function for the first equation of (3)
    graphic file with name M115.gif

Take the right upper Dini derivative along (3),

graphic file with name M116.gif

where Inline graphic, Inline graphic. By Lemma 1, we can obtain Inline graphic, where Inline graphic. This implies the uniform boundedness and ultimate uniform boundedness of the solution with respect to partial variables Inline graphic of system (3), which means the GRN(3) is uniformly stable and uniformly asymptotically stable in Lagrange sense with respect to partial variables Inline graphic. Note that,

graphic file with name M123.gif

where Inline graphic. Thus, Inline graphic. By Definition 3, Inline graphic is a GEA set with respect to partial variables Inline graphic of GRN(3).

  1. Let Inline graphic. From the Proof in 1), we may assume the variables Inline graphic in the second equation of (3) satisfy Inline graphic. We employ another radially unbounded and positive definite Lyapunov function for the second equation of (3),
    graphic file with name M131.gif

Take the right upper Dini derivative along (3),

graphic file with name M132.gif

where Inline graphic, Inline graphic. By Lemma 1, we can obtain Inline graphic, where Inline graphic. This implies the uniform boundedness and ultimate uniform boundedness of the solution with respect to partial variables Inline graphic of system (3), which means the GRN(3) is uniformly stable and uniformly asymptotically stable in Lagrange sense with respect to partial variable Inline graphic. Observe that Inline graphic, where Inline graphic. Then Inline graphic. By Definition 3, GRN(3) is globally exponentially attractive and Inline graphic is a GEA set with respect to partial variables Inline graphic.According to 1) and 2), we can conclude that the GRN(3) is uniformly stable and the compact set Inline graphic is GEA set of GRN(3). Hence by Definition 4, GRN(3) is globally exponentially stable in Lagrange sense.Proof is completed.

Denoting Inline graphic, Inline graphic.

Theorem 3 GRN(3) is unconditionally globally exponentially stable in Lagrange sense. The compact set Inline graphic is a GEA set with respect to partial variable mi, the compact set Inline graphic is a GEA set with respect to partial variable pi. Hence, the compact set Inline graphic is a GEA set of GRN(3).

Proof

  1. Employ a radially unboundedness and positive definite Lyapunov function
    graphic file with name M150.gif
    graphic file with name M151.gif

By Lemma 1, we can obtain

graphic file with name M152.gif

which deduces the uniform boundedness and ultimate uniform boundedness(i.e. uniformly stable and uniformly asymptotically stable in Lagrange sense)of the solution of partial variable mi of system (3). Observe that

graphic file with name M153.gif

where Inline graphic. Then Inline graphic. By Definition 3, we have Inline graphic is a GEA set of partial variable mi of (3).

  1. Employ another radially unbounded and positive definite Lyapunov function
    graphic file with name M157.gif
    graphic file with name M158.gif

By Lemma 1, we obtain

graphic file with name M159.gif

This deduces the uniform boundedness and ultimate uniform boundedness (i.e. uniformly stable and uniformly asymptotically in Lagrange sense)of the solution of partial variable pi of system (3). Observe that

graphic file with name M160.gif

where Inline graphic. Then Inline graphic. By Definition 3, Inline graphicis a GEA set of partial variable pi of (3).According to 1) and 2), we can deduce that the GRN(3) is uniformly stable and the compact set Inline graphic is GEA set of GRN(3). Hence by Definition 4, GRN(3) is globally exponentially stable in Lagrange sense.Proof is completed.

Theorem 4 GRN(3) is unconditionally globally exponentially stable in Lagrange sense, and the GEA setInline graphicis a better GEA set of GRN(3).

Proof According to the properties of intersection sets, the result is obvious.

Proof of existence of the equilibrium point of GRNs

In the following, we will investigate the stability in Lyapunov sense of the genetic regulatory network with SUM logic. So, we need to prove the existence of equilibrium point of the GRNs. As to the uniqueness of the equilibrium point, it will be settled during the proof of the globally asymptotic stability, because the uniqueness of the equilibrium point is the necessary condition of the globally asymptotic stability of GRNs.

Theorem 5 Under the above assumption, the equilibrium point always exists of GRN(2).

Proof Consider the following mapping operator,

graphic file with name M166.gif 6

Inline graphic, for the first group mapping component operator

graphic file with name M168.gif

One has

graphic file with name M169.gif 7

Hence Inline graphic maps the Inline graphic space into the compact set Inline graphic in space Inline graphic. Specially, it maps the compact set Inline graphic in space Inline graphic into the compact set Inline graphic in space Inline graphic.Consider the second group mapping component operator

graphic file with name M178.gif

For Inline graphic, due to the first group operator, we can let

graphic file with name M180.gif

Then, we have

graphic file with name M181.gif

Thus the second group mapping operator Inline graphic maps the compact set in space Inline graphic into the compact set Inline graphic in space Inline graphic.So the combined operator Inline graphic maps Inline graphic in space Inline graphic into Inline graphic in space Inline graphic. Let Inline graphic, in space Inline graphic. Construct a 2n-dimension hypersphere with radius r and take origin as its circle center

graphic file with name M193.gif

Thus Inline graphic.According to the Brown fixed point theorem, the combined operator has a fixed point i.e. there exists at least one equilibrium point of equation (3).

Stability analysis in Lyapunov sense of GRNs

Based on the existence of the equilibrium point of GRNs, we will analyze the stability in Lyapunov sense of GRN(3) with time delay.

Let Inline graphic be an equilibrium point of (3), i.e. it is the solution of equation

graphic file with name M196.gif

For convenience, in the following, we will always shift an intended equilibrium point to origin. Using Inline graphic, (3) can be transformed to

graphic file with name M198.gif 8

Hence the Lyapunov stability of the trivial solution of (8) is equivalent to the Lyapunov stability of the equilibrium point Inline graphic of (3).

Let Inline graphic and Inline graphic.

Theorem 6 Assume that there exist positive constantsInline graphicsatisfying

graphic file with name M203.gif 9

Then the trivial solution of (8) is globally exponentially stable in Lyapunov sense, and thereby the equilibrium pointInline graphicof (3) is globally exponentially stable in Lyapunov sense.

Proof The condition (9) implies that there exists Inline graphic, such that

graphic file with name M206.gif 10

Employing a radially unbounded and positive definite Lyapunov functional

graphic file with name M207.gif

Taking the right upper Dini derivative along the solution of (8),

graphic file with name M208.gif

We can obtain Inline graphic, then

graphic file with name M210.gif 11

Thus

graphic file with name M211.gif 12

(12) implies the trivial solution of (8) is globally exponentially stable in Lyapunov sense. Hence the equilibrium point Inline graphic of (3) is globally exponentially stable in Lyapunov sense.Proof is completed.

Corollary 1 IfInline graphic(speciallyInline graphic), then the condition

graphic file with name M215.gif

implies the trivial solution of (8) is globally exponentially stable in Lyapunov sense. Thus the equilibrium pointInline graphicof (3) is globally exponentially stable in Lyapunov sense.

Proof The condition (12) implies there exists Inline graphic, such that

graphic file with name M218.gif 13

We can let Inline graphic. By Theorem 6, the result is derived.Proof is completed.

In the following, we let Inline graphic.

For convenience, we define some necessary vectors and matrices. Let

graphic file with name M221.gif
graphic file with name M222.gif

where Inline graphic, then (8) can be transformed to vector form as follows

graphic file with name M224.gif 14

Theorem 7 If there exists a positive definite diagonal matrix satisfying

graphic file with name M225.gif 15

Then the trivial solution of (8) is globally exponentially stable in Lyapunov sense, thus the equilibrium pointInline graphicis globally exponentially stable in Lyapunov sense.

Proof By the dependence of matrices to the coefficient, (15) implies there exists Inline graphic such that

graphic file with name M228.gif

Construct a radially unbounded and positive definite Lyapunov functional

graphic file with name M229.gif

Compute the derivative along the solution of (8)

graphic file with name M230.gif

Then

graphic file with name M231.gif

Thus

graphic file with name M232.gif

This implies the result.Proof is completed.

Corollary 2 If

graphic file with name M233.gif

then the trivial solution of (8) is globally exponentially stable, thus the equilibrium pointInline graphicis globally exponentially stable.

Proof Let Inline graphic and apply Theorem 8, conclusion is derived.

Numerical examples

Example 1 In this example, we consider repressilator which has been experimentally investigated in Escherichia coli (Elowitz and Leibler 2000).The repressilator is a cyclic negative feedback loop comprising three repressor genes (lacl,tetR,and cl) and their promoters. The kinetics of the system is described as follows:

graphic file with name M236.gif

where Inline graphic and Inline graphic are the concentrations of the three mRNAs and repressor-proteins, and Inline graphic denotes the ratio of the protein decay rate to the mRNA decay rate. Taking the transcriptional delays into account and selecting a set of biologically plausible parameters, we rewrite the above equlities in the vector form,

graphic file with name M240.gif 16

where Inline graphic, Inline graphic, Inline graphic, Inline graphic,

graphic file with name M245.gif

Inline graphic, Assuming the time delays Inline graphic, Inline graphicAccording to Theorem 1, we may choose Inline graphic, Inline graphic. Then we can obtain the compact set Inline graphic is a GEA set with respect to partial variables Inline graphic of (16). The compact set Inline graphic is a GEA set with respect to partial variables Inline graphic of (16). Thus the compact set Inline graphic is a GEA set of (16).According to Theorem 2, we can obtain Inline graphic is a GEA set with respect to partial variables Inline graphic of (16). The compact set Inline graphic is a GEA set with respect to partial variables Inline graphic of (16). Thus the compact set Inline graphic is GEA set of (16). According to Theorem 3, we obtain Inline graphic is a GEA set with respect to partial variable Inline graphic, Inline graphic. The compact set Inline graphic is a GEA set with respect to partial variable Inline graphic, Inline graphic, the compact set Inline graphic is a compact set of (16). The compact set Inline graphic is a better GRA set of (16) by Theorem 4.

Example 2 Now we consider another GRN with five nodes (Fig. 1) presented in Li et al. (2006). Let

graphic file with name M269.gif

We can choose the appropriate parameters that satisfy the condition of Theorem 6 as follows, Inline graphic, Inline graphicThen according to Theorem 6, we can conclude the GRN is globally exponentially stable.

Fig. 1.

Fig. 1

Genetic network model (↑: activation, ⊥: repression)

Conclusion

In this paper, we investigated the global exponential stability in Lagrange sense for a class of genetic regulatory networks with SUM regulatory networks. From the results obtained, we can see this class of GRNs is unconditionally globally exponentially stable in Lagrange sense, which in some degree meets the natural facts and shows the rationality of the model presented. Several criteria are also derived for the boundedness and global exponential attractivity. Besides, to study the stability of GRNs more comprehensively, we then firstly prove the existence of the equilibrium point of GRNs, and we give some sufficient condition for GRNs to be globally exponentially stable in Lyapunov sense. Finally two numerical examples are given to illustrate the application of our results.

Acknowledgments

This work was supported by the Natural Science Foundations of China under Grants 60874110.

References

  1. Becskei A, Serrano L. Engineering stability in gene networks by autoregulation. Nature. 2000;405:590–593. doi: 10.1038/35014651. [DOI] [PubMed] [Google Scholar]
  2. Bolouri H, Davidson EH. Modeling transcriptional regulatory networks. Bio Essays. 2002;24:1118–1129. doi: 10.1002/bies.10189. [DOI] [PubMed] [Google Scholar]
  3. Chaouiya C, Remy E, Ruet P, Thieffry D. Petri net modeling of biological regulatory networks. J Discrete Algorithms. 2008;6:165–177. doi: 10.1016/j.jda.2007.06.003. [DOI] [Google Scholar]
  4. Chen L, Aihara K. Stability of genetic regulatory networks with time delay. IEEE Trans Circuits Syst I Fundam Theory Appl. 2002;49:602–608. doi: 10.1109/TCSI.2002.1001949. [DOI] [Google Scholar]
  5. Chen YY, Luo Q. Global exponential stability in Lagrange sense for a class of neural networks. J Nanjing Univ Inf Sci Technol Nat Sci Ed. 2009;1(1):50–58. [Google Scholar]
  6. Chen T, He H, Church GM. Modeling gene expression with differential equations. Proc Pac Symp Biocomputing. 1999;4:29–40. [PubMed] [Google Scholar]
  7. Elowitz MB, Leibler S. A synthetic oscillatory network of transcriptional regulators. Nature. 2000;403:335–338. doi: 10.1038/35002125. [DOI] [PubMed] [Google Scholar]
  8. Friedman N, Linial M, Nachman I, Pe’er D. Using Bayesian networks to analyze expression data. J Comput Biol. 2000;7:601–620. doi: 10.1089/106652700750050961. [DOI] [PubMed] [Google Scholar]
  9. Gardner T, Cantor C, Collins J. Construction of a genetic toggle switch in Escherichia coli. Nature. 2000;403:339–342. doi: 10.1038/35002131. [DOI] [PubMed] [Google Scholar]
  10. Goodwin BC. Temporal organization in cells. New York: Academic Press; 1963. [Google Scholar]
  11. Hardy S, Robillard PN. Modeling and simulation of molecular biology systems using Petri nets: modeling goals of various approaches. J Bioinform Comput Biol. 2004;2:595–613. doi: 10.1142/S0219720004000764. [DOI] [PubMed] [Google Scholar]
  12. Hartemink AJ, Gifford DK, Jaakkola TS, Young RA. Bayesian methods for elucidating genetic regulatory networks. IEEE Intell Syst. 2002;17:37–43. [Google Scholar]
  13. Hassibi A, Boyd SP, How JP (1999) A class of Lyapunov functionals for analyzing hybrid dynamical systems. In: Proceedings of American Control Conference, San Diego, California, June, 1999
  14. Jong HD. Modelling and simulation of genetic regulatory systems: a literature review. J Comput Biol. 2002;9:67–103. doi: 10.1089/10665270252833208. [DOI] [PubMed] [Google Scholar]
  15. Kalir S, Mangan S, Alon U (2005) A coherent feed-forward loop with a SUM input function prolongs flagella expression in Escherichia coli. Mol Syst Biol. doi: 10.1038/msb4100010 [DOI] [PMC free article] [PubMed]
  16. LaSalle J. Some extensions of Liapunov’s second method. IEEE Trans Circuit Theory. 1960;7(4):520–527. [Google Scholar]
  17. Li C, Chen L, Aihara K. Synchronization of coupled nonidentical genetic oscillators. Phys Biol. 2006;3:37–44. doi: 10.1088/1478-3975/3/1/004. [DOI] [PubMed] [Google Scholar]
  18. Li C, Chen L, Aihara K. Stability of genetic networks with sum regulatory logic: Lur’e system and LMI approach. IEEE Trans Circuits Syst I. 2006;53(11):2451–2458. doi: 10.1109/TCSI.2006.883882. [DOI] [Google Scholar]
  19. Liao XX. Theory and application of stability for dynamical system. Beijing: National Defense Industry Press; 2000. [Google Scholar]
  20. Liao XX, Wang J. Global dissipativity of continuous-time recurrent neural networks. Phys Rev E. 2003;68(016118):1–4. doi: 10.1103/PhysRevE.68.016118. [DOI] [PubMed] [Google Scholar]
  21. Liao XX, Luo Q, Zeng ZG, Guo YX. Global exponential stability in Lagrange sense for recurrent neural networks with time delays. Nonlinear Anal RWA. 2008;9:1535–1557. doi: 10.1016/j.nonrwa.2007.03.018. [DOI] [Google Scholar]
  22. Liao XX, Luo Q, Zeng ZG. Positive invariant and global exponential attractive sets of neural networks with time-varying delays. Neurocomputing. 2008;71:513–518. doi: 10.1016/j.neucom.2007.07.017. [DOI] [Google Scholar]
  23. Passino KM, Burgess KL. Lagrange stability and boundedness of discrete event systems. Discrete Event Dyn Syst Theory Appl. 1995;5:383–403. doi: 10.1007/BF01439154. [DOI] [Google Scholar]
  24. Pease A, Solas D, Sullivan E, Cronin M, Holmes C, Fodor S. Light-generated oligonucleotide arrays for rapid DNA sequence analysis. Proc Natl Acad Sci USA. 1994;91(11):5022–5026. doi: 10.1073/pnas.91.11.5022. [DOI] [PMC free article] [PubMed] [Google Scholar]
  25. Rekasius ZV. Lagrange stability of nonlinear feedback systems. IEEE Trans Automat Control. 1963;8(2):160–163. doi: 10.1109/TAC.1963.1105547. [DOI] [Google Scholar]
  26. Ren F, Cao J. Asymptotic and robust stability of genetic regulatory networks with time-varying delays. Neurocomputing. 2008;71:834–842. doi: 10.1016/j.neucom.2007.03.011. [DOI] [Google Scholar]
  27. Smolen P, Baxter DA, Byrne JH. Mathematical modeling of gene networks review. Neuron. 2000;26:567–580. doi: 10.1016/S0896-6273(00)81194-0. [DOI] [PubMed] [Google Scholar]
  28. Somogyi R, Sniegoski C. Modeling the complexity of genetic networks: understanding multigenic and pleiotropic regulation. Complexity. 1996;1:45–63. [Google Scholar]
  29. Thornton KW, Mulholland RJ. Lagrange stability and ecological systems. J Theor Biol. 1974;45:473–485. doi: 10.1016/0022-5193(74)90126-X. [DOI] [PubMed] [Google Scholar]
  30. Tian T, Burragea K, Burragea PM, Carlettib M. Stochastic delay differential equations for genetic regulatory networks. J Comput Appl. 2007;205:696–707. doi: 10.1016/j.cam.2006.02.063. [DOI] [Google Scholar]
  31. Wang GJ, Cao JD. Robust exponential stability analysis for stochastic genetic networks with uncertain parameters. Commun Nonlinear Sci Numer Simul. 2009;14:3369–3378. doi: 10.1016/j.cnsns.2009.01.004. [DOI] [Google Scholar]
  32. Wang R, Zhang Z. Energy coding in biological neural networks. Cogn Neurodyn. 2007;1(3):203–212. doi: 10.1007/s11571-007-9015-z. [DOI] [PMC free article] [PubMed] [Google Scholar]
  33. Wang J, Duan Z, Huang L. Control of a class of pendulum-like systems with Lagrange stability. Automatica. 2006;42:145–150. doi: 10.1016/j.automatica.2005.08.014. [DOI] [Google Scholar]
  34. Wang ZX, Liao XF, et al. Robust stability of stochastic genetic regulatory networks with discrete and distributed delays. Soft Comput. 2009;13:1199–1208. doi: 10.1007/s00500-009-0417-1. [DOI] [Google Scholar]
  35. Weaver DC, Workman CT, Storm GD. Modeling regulatory networks with weight matrices. Proc Pac Symp Biocomput. 1999;4:113–123. doi: 10.1142/9789814447300_0011. [DOI] [PubMed] [Google Scholar]
  36. Yang Y, Huang L (2006) Lagrange stability of a class of nonlinear discrete-time systems. In: First IEEE conference on industrial electronics and applications, May 2006, pp 1–6
  37. Yi Z, Tan KK. Convergence analysis of recurrent neural networks. Dordrecht: Kluwer; 2004. [Google Scholar]
  38. Yoshizawa T. Stability theory by Liapunov’s second method. Tokyo: Mathematical Society of Japan; 1966. [Google Scholar]
  39. Yuh CH, Bolouri H, Davidson EH. Genomic cis-regulatory logic: experimental and computational analysis of a sea urchin gene. Science. 1998;279:1896–1902. doi: 10.1126/science.279.5358.1896. [DOI] [PubMed] [Google Scholar]

Articles from Cognitive Neurodynamics are provided here courtesy of Springer Science+Business Media B.V.

RESOURCES