Abstract
This paper concerns periodic solutions of a class of equations that model gene regulatory networks. Unlike the vast majority of previous studies, it is not assumed that all decay rates are identical. To handle this more general situation, we rely on monotonicity properties of these systems. Under an alternative assumption, it is shown that a classical fixed point theorem for monotone, concave operators can be applied to these systems. The required assumption is expressed in geometrical terms as an alignment condition on so-called focal points. As an application, we show the existence and uniqueness of a stable periodic orbit for negative feedback loop systems in dimension 3 or more, and of a unique stable equilibrium point in dimension 2. This extends a theorem of Snoussi, which showed the existence of these orbits only.
Similar content being viewed by others
References
Casey R, de Jong H, Gouzé JL (2006) Piecewise-linear models of genetic regulatory networks: equilibria and their stability. J Math Biol 52(1):27–56
de Jong H (2002) Modeling and simulation of genetic regulatory systems: a literature review. J Comput Biol 9(1):67–103
de Jong H, Gouzé JL, Hernandez C, Page M, Sari T, Geiselmann J (2004) Qualitative simulation of genetic regulatory networks using piecewise-linear models. Bull Math Biol 66(2):301–340
Edwards R (2000) Analysis of continuous-time switching networks. Phys D 146:165–199
Elowitz MB, Leibler S (2000) A synthetic oscillatory network of transcriptional regulators. Nature 403:335–338
Farcot E (2006) Geometric properties of piecewise affine biological network models. J Math Biol 52(3):373–418
Gedeon T, Mischaikow K (1995) Structure of the global attractor of cyclic feedback systems. J Dyn Differ Equ 7(1):141–190
Glass L (1975) Combinatorial and topological methods in nonlinear chemical kinetics. J Chem Phys 63:1325–1335
Glass L, Pasternack JS (1978a) Prediction of limit cycles in mathematical models of biological oscillations. Bull Math Biol 40:27–44
Glass L, Pasternack JS (1978b) Stable oscillations in mathematical models of biological control systems. J Math Biol 6:207–223
Gouzé JL, Sari T (2003) A class of piecewise linear differential equations arising in biological models. Dyn Syst 17:299–316
Krasnosel’skii MA (1964) Positive solutions of operator equations. P. Noordhoff Ltd, Groningen
Mallet-Paret J, Smith H (1990) The Poincaré-Bendixson Theorem for monotone cyclic feedback systems. J Dyn Differ Equ 2:367–421
Mestl T, Plahte E, Omholt SW (1995) Periodic solutions of piecewise-linear differential equations. Dyn Stab Syst 10(2):179–193
Smith H (1986) Cooperative systems of differential equations with concave nonlinearities. Nonlinear Anal 10:1037–1052
Snoussi EH (1989) Qualitative dynamics of piecewise-linear differential equations: a discrete mapping approach. Dyn Stab Syst 4(3–4):189–207
Acknowledgments
This work was partially supported by the European Commission, under project Hygeia Nest-004995. The authors would like to thank the anonymous referee for a very detailed review, which has led to substantial improvements of the paper.
Author information
Authors and Affiliations
Corresponding author
Appendix: Proofs
Appendix: Proofs
1.1 Proof that Local Maps Preserve Closed Walls
See Sect. 4.2.1 for notation.
Let \(x\;{\in}\;c\ell({W^{i-1}})\) be such that x j = 0. Since \(c\ell({W^{i-1}})\subset\{x | x_{s_{i-1}}=0\},\) we assume j ≠ s i−1. Then, \({\mathcal T}^{a^i}x\;{\in}\;c\ell({W^{i}})\) if, and only if, each coordinate \({\mathcal T}^{a^i}_kx\) belongs to the projection of \(c\ell({W^{i}})\) in the direction of k, which is either [0, θ + k ] or [θ − k , 0]. From (22), the coordinate map \({\mathcal T}^{a^i}_j\,\) depends only on variables x j and x s − i. Hence, there are two cases:
-
If \(j\neq s_i, {\mathcal T}^{a^i}_jx=(1-\alpha_j(x_s)) \phi_j^i\) depends on x s only. From the inequalities linking x j , ϕ i j and θ j = 0, it is easily checked that \(\alpha_j(x_s) \in (0,1]\) for all x s . From j ≠ s i , ϕi j belongs to the projection of W i in direction j, hence so does the entire closed interval bounded by 0 and ϕi j , and in particular \({\mathcal T}^{a^i}_jx. \)
-
If j = s i , then for any k ∈ {1…n}, \(\alpha_{s_{k}}(x)=1\), so that \({\mathcal T}^{a^i}_kx=x_k,\) that is, x is a fixed point. Moreover, \(x\,\in\,c\ell({W^{i-1}})\,\cap\,c\ell({W^{i}})\) in this case. Then \({\mathcal T}^{a^i}_kx=x_k\) clearly belongs to the projection of \(c\ell({W^{i}})\) in the direction of k.
1.2 Proof of Proposition 4
Proof
From (17) and (18), it follows that sign(ϕ1) = (− 1, 1…1) ∈ {± 1}n, so that σ1 = (1…1) ∈ {± 1}{2…n}, and
Let \(x^1 \in \widetilde W^1.\) In the following we denote \(x^i = \widetilde{\mathcal T}^{a^{i}}x^{i-1}\) for \(i \geq 2,\) so that \({\bf T} x^1 = x^{2n+1}.\) Clearly, \(x^i \in \widetilde W^i\) for all i.
Now, for each i ∈ {1…2n}, the alignment condition (20) and the expression (22) of \({\mathcal T}^{a^i}\) imply the following conservation of signs:
In particular, for the n last domains of the cycle \({\mathcal C},\) remarking from Eq. 18 that s n+i = i, the above has the following consequence:
This equality can be propagated, in the sense that
Now, since \(x^{n+i} \in \widetilde W^{n+i},\) and since (23) is satisfied on \(\widetilde W^{n+i}\) by definition, we obtain
Combining this with the previous list of equalities gives
which means that \(x^{2n+1}={\bf T} x^{1} \in {\mathcal Z}^1,\) as expected.\(\square\)
1.3 Proof of Proposition 5
Proof
Let \(x \in {\mathcal Z}^i,\) which by definition is equivalent to
First, observe that in dimension n = 2, j = s i−1 necessarily, and thus \({\mathcal Z}^i(\sigma^i)=\widetilde W^{i};\) see the discussion in Sect. 4.2.2. There is nothing to prove in this case, and we thus assume \(n \geq 3\) in the rest of the proof.
From the alignment condition (20), we get
Since α j (x) > 0, using (39) leads to
From (23) it is immediate that
which concludes the proof.
1.4 Proof of Theorem 2: Last Part
Proof
The subscripts in (36) and (37) are those to be used in Eq. 33. To compute (35), on the other hand, it is more relevant to use the actual row and column numbers, as represented in (36) over the nonzero column, which is numbered s i−1. Hence, in the expressions below, \(D{\mathcal M}^{(i)}_{jk}\) refers to the entry j, k of matrix \(D{\mathcal M}^{(i)}(0),\) which is not necessarily \(\frac{\partial{\mathcal M}^{(i)}_j} {\partial x_k}(0). \) A simple induction shows that
In particular, the diagonal terms can be conveniently denoted using the following abbreviation. Define the integer vector \({\bf k}=(k_1 \ldots k_{2n-1}) \in \{1 \ldots n-1\}^{2n-1},\) and denote
Note that the general form of terms in the products above is the following:
Then, \(\left(D{\bf T}(x^1)\right)_{ii}\) equals the sum of products \(p_{\bf k}^i\) when k varies in the whole set {1…n − 1}2n−1. Now, since each matrix \(D{\mathcal M}^{(i)}(0)\) is composed of zeros and positive terms, it follows that each nonzero product \(p_{\bf k}^i\) is positive. Hence, if for all i there is a k such that \(p_{\bf k}^i=1,\) and at least one other nonzero \(p_{\bf k}^i,\) the proof will be finished.
To help intuition, let us detail the shape of \(D{\mathcal M}^{(i)}(0)\) and \(D{\mathcal M}^{(n+i)}(0)\) for \(n \geq i > 1,\) using (36) and (37):
For i ∈ {1, n + 1}:
Now, we claim that \(p_{\bf k}^i=1,\) for 1 < i ≤ n − 1, and
where k j = i for n + 1 − i ≤ j ≤ n, and 2n + 1 − i ≤ j ≤ 2n − 1, and k j = 1 otherwise. Actually, we have, on the one hand,
and, on the other hand,
Moreover, for any \(j \in \{2n+1-i \ldots 2n-1\} \cup \{n+1-i \ldots n\},\) it appears that \(D{\mathcal M}^{(j)}_{i,i}=1,\) since i ≠ s j − 1, and similarly, for \(j \in \{1 \ldots n-i\} \cup \{n+1 \ldots 2n-i\},\) we have \(D{\mathcal M}^{(j)}_{1,1}=1.\) As a consequence, for k as in (42),
Now we refer to the Eq. 17 of successive boxes, and recall that ϕi belongs to the domain a i+1. Then it is rather straightforward to check that
for any i ∈ {1…n}. It follows immediately that sign(κn + i) = − sign(κi) as well. From this and the fact that any production term κi j is fully determined by its sign, it follows that
whence \(p_{\bf k}^i= 1. \)
Recall that the previous holds only for i > 1. Now, let k = (1…1). Then,
while
Moreover, for any other \(j, D{\mathcal M}^{(j)}_{1,1}=1,\) and thus
Thus, we have found, for each i ∈ {1…n − 1}, a k such that \(p^i_{\bf k}=1.\) Now, for any i > 1, let \({\bf k}=(1 \ldots 1,i \ldots i),\) where k j = i for 2n + 1 − i ≤ j ≤ 2n − 1. This leads to
and from (40) and (41), we check readily that the above is positive: the entry (1, 1) is actually never zero in the first terms, the ith column of \(D{\mathcal M}^{(i+1)}\) is nonzero, and the diagonal terms of the last terms in the product are positive as well.
For i = 1, a positive \(p^1_{\bf k}\) is found for instance with k = (2…2). Actually, (2, 2) entries are never zero in (40), and moreover \(D{\mathcal M}^{(1)}_{1,2}\) and \(D{\mathcal M}^{(2)}_{2,1}\) are also positive.\(\square\)
Rights and permissions
About this article
Cite this article
Farcot, E., Gouzé, JL. Periodic Solutions of Piecewise Affine Gene Network Models with Non Uniform Decay Rates: The Case of a Negative Feedback Loop. Acta Biotheor 57, 429–455 (2009). https://doi.org/10.1007/s10441-009-9086-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10441-009-9086-9