Volume 2014, Issue 1 536324
Research Article
Open Access

Oscillatory Behavior on a Three-Node Neural Network Model with Discrete and Distributed Delays

Chunhua Feng

Corresponding Author

Chunhua Feng

College of Mathematics and Statistics, Guangxi Normal University, Guilin 541004, China gxnu.edu.cn

Search for more papers by this author
First published: 24 February 2014
Academic Editor: Songcan Chen

Abstract

This paper investigates the oscillatory behavior of the solutions for a three-node neural network with discrete and distributed delays. Two theorems are provided to determine the conditions for oscillating solutions of the model. The criteria for selecting the parameters in this network are derived. Some simulation examples are presented to illustrate the effectiveness of the results.

1. Introduction

Neural networks are complex and large-scale dynamical systems. Time delay is inevitably encountered in implementation of dynamical neural networks and is frequently a source of oscillation and instability. On the one hand, information transmission from one neuron to another neuron may make the response of networks with discrete delays. On the other hand, neural networks usually have spatial extent due to the presence of a multitude of parallel pathways with a variety of axon sizes and lengths. Thus, the distributed delays in neural system need to be considered. In the past two decades, many researches have studied various neural networks with discrete and distributed delays [14]. In [1], Gopalsamy and Leung studied the following neural network model:
(1)
By means of the Lyapunov functional, the authors obtained some necessary and sufficient conditions for the existence of a globally asymptotically stable equilibrium point of system (1). Ruan and Filfil [2] considered a two-neuron network model with multiple discrete and distributed delays as follows:
(2)
where the delayed feedback kernel satisfies and ,2). Local stability analyses are carried out for model (2). Computer simulations are performed to illustrate the obtained results. Liao et al. [3] discussed a two-neuron system with distributed delays in the frequency domain as follows:
(3)
where F(r) is a strong kernel. For simplicity, the authors set c1 = c2 = 0. Let
(4)
Then system (3) is equivalent to the following model:
(5)
By applying the frequency domain approach and analyzing the characteristic equation, the Hopf bifurcation occurs when the mean delay μ exceeds a critical value. Thus, there is a family of periodic solutions bifurcates from the equilibrium point. Recently, Hajihosseini et al. [4] have investigated the following three-node network model:
(6)
where w1 and w2 are parameters. The authors also make the change of variables such that system (6) changes to the following:
(7)
Under the restrictive condition |w1 + w2 | < 1, the Hopf bifurcation and stability of the bifurcating periodic solutions have been discussed. There are many authors who have studied the bifurcating periodic solutions for various models [514]. It is well known that the basic method in studying the bifurcating periodic solution for a time delay system is to discuss an algebraic equation in which the bifurcating value will be determined. Motivated by the above models we shall concern the existence of oscillating solutions for the following three-node network system with discrete and distributed delays:
(8)
where F(r) = μ2reμr  (μ > 0) is a strong kernel function, the passive decay rates a1, a2, and a3 are positive constants, bi, ci, and li  (i = 1,2,3) are constants, and delays τ1, τ2, and τ3 are nonnegative constants. It was emphasized that bifurcating approach is hard to deal with model (8), because it is very difficult to find the bifurcating parameter when τ1, τ2, and τ3 are different nonnegative constants. In order to discuss the existence of oscillating solutions for system (8) we adopt Chafee’s criterion [15]. A time delay system will generate a limit cycle if the system has a unique unstable equilibrium point and bounded solutions. In other words, there exists an oscillatory solution of the model. System (8) can accord with the demands of Chafee’s criterion; we refer the reader to [16, appendix].

2. Preliminaries

First we assume that the activation functions f and g both are monotone continuous bounded functions. f, gC4(R), f(0) = g(0) = 0, uf(u) > 0, and ug(u) > 0 for u ≠ 0. For example, f(u) = tanh(u), and g(u) = arctan⁡ (u) satisfy those conditions. For the kernel function F(r) = μ2reμr  (μ > 0) we have
(9)
From (9) we get
(10)
Taking the derivative on both sides of system (8) we obtain
(11)
Set
(12)
so (11) can be rewritten as follows:
(13)
Taking the derivative again on both sides of (13) and using (10) give
(14)
Now by setting   x4(t) = dx1(t)/dt, x5(t) = dx2(t)/dt, x6(t) = dx3(t)/dt, , , and , we get the following time delay equivalent system of (8):
(15)
The linearization of system (15) around the zero point is the following:
(16)
System (16) can be written as a matrix form:
(17)
where , = (x1(tτ1), x2(tτ2), x3(tτ3), x4(tτ1), x5(tτ2), x6(tτ3), x7(tτ1), x8(tτ2), and x9(tτ3)) T. So,
(18)
where p71 = −μ2a1,   p73 = c3μ2g(0), p74 = −(2μa1 + μ2), p77 = −(a1 + 2μ),   p81 = c1μ2g(0), p82 = −μ2a2,   p85 = −(2μa2 + μ2),   p88 = −(a2 + 2μ), p92 = c2μ2g(0),   p93 = −μ2a3, p96 = −(2μa3 + μ2), p99 = −(a3 + 2μ); q72 = μ2b2f(0), q75 = −2μb2f(0), q78 = b2f(0), q83 = μ2b3f(0), q86 = −2μb3f(0), q89 = b3f(0), q91 = μ2b1f(0), q94 = −2μb1f(0), and q97 = b1f(0).

Lemma 1. All solutions of system (8) are bounded.

Proof. Since we assume that f and g both are monotone continuous bounded functions. So we have |f(u) | ≤ M and |g(u) | ≤ N  (M and N are positive constants). From (8) we obtain

(19)
where A1 = |b2|M + |c3|N, A2 = |b3|M + |c1|N, and A3 = |b1|M + |c2|N. Thus, |xi(t)| ≤ (Ai/ai)+|xi(0)|  (i = 1, 2, 3). This means that the solutions of system (8) are uniformly bounded.

Lemma 2. Assume that the matrix

(20)
is a nonsingular matrix. Then system (8) has a unique equilibrium point.

Proof. Noting that f and g both are monotone continuous bounded functions satisfying f(0) = g(0) = 0. Then f(x) = f(0)x + α, g(x) = g(0)x + β, where α and β both are higher order infinitesimals when x → 0. From (8), an equilibrium point is a solution of the following algebraic equation:

(21)

Noting that , then we have

(22)

If is another equilibrium point of system (8), neglecting of the higher order infinitesimal, we obtain

(23)
The matrix form of (23) is follows:
(24)
Since B is a nonsingular matrix based on the algebraic knowledge one can have x*  y* = 0 or x* =   y*. This means that system (8) has a unique equilibrium point. Obviously, the unique equilibrium point exactly is zero point since f(0) = g(0) = 0.

3. Oscillating Solutions Analysis

We adopt the following norms of vectors and matrices: ,  . The measure σ(P) of the matrix P is defined by , which for the chosen norms reduces to .

In order to discuss the instability of equilibrium point for system (8), we consider the equivalent system (15) of (8). Note that the linearized system of (15) is (16). Obviously, if the trivial solution of (16) is unstable, it implies that the trivial solution of system (15) is unstable and thus the instability of the trivial solution of system (8). Therefore, we first have

Theorem 3. Assume that system (8) has a unique equilibrium point and the determinant of matrix P is not equal to zero. Let ρ1, ρ2, …, ρ9, ϱ1,  ϱ2, …, ϱ9 be the eigenvalues of the matrixes P and Q, respectively. If there is at least one Reρi> 0 (Imρi may be equal to zero) or there exists one positive real eigenvalue ϱj>|ρj|, for some j ∈ {1,2, …, 9}, then the unique equilibrium point, namely, the trivial solution of system (16) is unstable, implying that the equivalent system (15) or (8) generates oscillating solutions.

Proof. Since Q is a singular matrix, set ϱ1 =  ϱ2 = ⋯ = ϱ6 = 0. For given value of  μ, let ρ1, ρ2, …, ρ9 be the eigenvalues of the matrix P. Thus, the characteristic equation of system (16) is as follows:

(25)
where
(26)
or
(27)

Since there is at least one Reρi > 0, without loss of generality, set Reρ1 > 0. From ϱ1 = 0 we have the equation λρ1 = 0. This means that λ = ρ1, and there is a Re λ > 0. So, the unique equilibrium point of system (16) is unstable based on the theory of differential equation. If by corresponding some ρj we have ϱj>|ρj|  j ∈ {1,2, …, 9}, we pointed out that there exists positive real root for transcendental equation . Let . Then f(λ) is a continuous function of λ. Since f(0) = −ρjϱj, from ϱj>|ρj|, we know that f(0) < 0. Obviously, there is a suitable large λ* > 0 such that since can be suitably small. Thus, by the continuity of f(λ), there is a point, say such that . In other words, there is a positive real eigenvalue. In this case the unique equilibrium point of system (16) is also unstable. Since all solutions of the system are bounded, on the basis of Chafee’s criterion [15], system (15) generates a limit cycle, implying that there exists an oscillating solution of system (15) and therefore system (8).

Theorem 4. Assume that system (8) has a unique equilibrium point and the following inequalities hold:

(28)
where τ = min⁡⁡{τ1,  τ2,  τ3} and τ* = max⁡{τ1,  τ2,  τ3}. Then the unique equilibrium point, namely, the trivial solution of system (16) is unstable, implying that the equivalent system (15) or (8) generates oscillating solutions.

Proof. First we consider system (16) in the case τ1 =  τ2 =  τ3 = τ and we easily get:

(29)

Let ; then for some t*,  y(t) > 0  (tt*) and we have

(30)

Consider the scalar equation

(31)
with y(s) = z(s) and s ∈ [t*,  t* + τ]. According to the comparison theorem of differential equation, one can obtain
(32)

We claim that the trivial solution of (31) is unstable. Suppose that this is not true; then the characteristic equation associated with (31) given by

(33)
will have a real negative root say λ* such that , where .

So we get

(34)
Thus
(35)

Based on the formula exex  (x > 0), from (35), we have

(36)

Inequality (36) contradicts the first inequality of (28). Therefore, our claim regarding the instability of the trivial solution is valid. Similarly, consider system (16) in the case τ1 =  τ2 =  τ3 = τ*; we know that the trivial solution is unstable if the second inequality of (28) holds. Note that ττiτ*  (i = 1,  2,  3). So, the trivial solution of (16) is unstable when condition (28) holds, implying that the trivial solution of (15) is unstable. According to Chafee’s criterion, system (15) generates a limit cycle, suggesting that there is an oscillating solution of system (15) and therefore system (8).

4. Computer Simulations

We use the equivalent system (15) of (8) for computer simulation. In Figure 1 both activation functions f(u) and g(u) are taken tanh (u). Thus, , f(u) = g(u) = 2(tanh⁡(u))3 − 2tanh⁡(u), and f(0) = g(0) = 1. We select μ = 5.5, a1 = 0.48, a2 = 0.65, a3 = 0.78, b1 = 0.6, b2 = 0.8, b3 = 0.9, c1 = −0.8, and c2 = −1.8, c3 = 0.4. Then the eigenvalues of matrix P are −5.8250 ± 1.8620i, −1.7568 ± 2.5151i, −0.0000, −0.4840, −5.3568, −5.6392, and −8.2087 and the eigenvalues of matrix Q are −0.3780 ± 0.6547i, 0.7560, and 0, 0, 0, 0, 0, 0. Note that the eigenvalue 0.7560 of matrix Q is larger than |−0.4840| = 0.4840. Based on Theorem 3, the trivial solution of system (15) is unstable. The system generates an oscillating solution. In order to compare the effect of the time delays, we change the delays from (0.2, 0.3, and 0.4) to (1, 1.5, and 2), while keeping the other parameters as shown in Figure 1. We see that the oscillatory amplitude and frequency both are changed (see Figure 2). In Figure 3, we keep the parameter values the same as Figure 2, the activation function g(u) = tanh⁡(u), and change the activation function f(u) = arctan⁡(u). Then f(u) = 1/(1 + u2) and . We see that the graph is changed slightly in comparison with Figure 2. In Figure 4, we set the activation function f(u) = 1/(1 + e−2u) and g(u) = (e−2u − 1)/(1 + e−2u). Then , , , and . Thus f(0) = 1/2 and g(0) = −1. Note that f(0) = 1/2 ≠ 0 and g(0) = −1/2 ≠ 0. When we select the parameters as follows: μ = 3.5, a1 = 0.18, a2 = 0.15, a3 = 0.19, b1 = 0.05, b2 = 0.08, b3 = 0.12, c1 = −0.6, and c2 = 0.8, c3 = 0.5, time delays are (0.5, 0.6, and 0.7). The oscillatory solutions also appeared. This means that the restrictive condition f(0) = g(0) = 0, uf(u) > 0, and ug(u) > 0 for u ≠ 0 is only for convenience of the proof.

Details are in the caption following the image
Figure 1 (a) solid line: x1(t), dashed line: x2(t), and dotted line: x3(t)
Oscillatory behavior of the solutions: mu = 3.5, delays: (0.5, 0.6, and 0.7), and activation functions: f(u) = g(u) = tanh(u).
Details are in the caption following the image
Figure 1 (b) solid line: x4(t), dashed line: x5(t), and dotted line: x6(t)
Oscillatory behavior of the solutions: mu = 3.5, delays: (0.5, 0.6, and 0.7), and activation functions: f(u) = g(u) = tanh(u).
Details are in the caption following the image
Figure 1 (c) solid line: x7(t), dashed line: x8(t), and dotted line: x9(t)
Oscillatory behavior of the solutions: mu = 3.5, delays: (0.5, 0.6, and 0.7), and activation functions: f(u) = g(u) = tanh(u).
Details are in the caption following the image
Figure 2 (a) solid line: x1(t), dashed line: x2(t), and dotted line: x3(t)
Oscillatory behavior of the solutions: mu = 5.5, delays: (1, 1.5, and 2), and activation functions: f(u) = g(u) = tanh(u).
Details are in the caption following the image
Figure 2 (b) solid line: x4(t), dashed line: x5(t), and dotted line: x6(t)
Oscillatory behavior of the solutions: mu = 5.5, delays: (1, 1.5, and 2), and activation functions: f(u) = g(u) = tanh(u).
Details are in the caption following the image
Figure 2 (c) solid line: x7(t), dashed line: x8(t), and dotted line: x9(t)
Oscillatory behavior of the solutions: mu = 5.5, delays: (1, 1.5, and 2), and activation functions: f(u) = g(u) = tanh(u).
Details are in the caption following the image
Figure 3 (a) solid line: x1(t), dashed line: x2(t), and dotted line: x3(t)
Oscillatory behavior of the solutions: mu = 5.5, delays: (1, 1.5, and 2), and activation functions: f(u) = arctan(u), g(u) = tanh(u).
Details are in the caption following the image
Figure 3 (b) solid line: x4(t), dashed line: x5(t), and dotted line: x6(t)
Oscillatory behavior of the solutions: mu = 5.5, delays: (1, 1.5, and 2), and activation functions: f(u) = arctan(u), g(u) = tanh(u).
Details are in the caption following the image
Figure 3 (c) solid line: x7(t), dashed line: x8(t), and dotted line: x9(t)
Oscillatory behavior of the solutions: mu = 5.5, delays: (1, 1.5, and 2), and activation functions: f(u) = arctan(u), g(u) = tanh(u).
Details are in the caption following the image
Figure 4 (a) solid line: x1(t), dashed line: x2(t), and dotted line: x3(t)
Oscillatory behavior of the solutions: mu = 3.5, delays: (0.5, 0.6, and 0.7), and activation functions: f(u) = 1/(1 + exp⁡(−2u)), g(u) = (exp⁡(−2u) − 1)/(1 + exp⁡(−2u)).
Details are in the caption following the image
Figure 4 (b) solid line: x4(t), dashed line: x5(t), and dotted line: x6(t)
Oscillatory behavior of the solutions: mu = 3.5, delays: (0.5, 0.6, and 0.7), and activation functions: f(u) = 1/(1 + exp⁡(−2u)), g(u) = (exp⁡(−2u) − 1)/(1 + exp⁡(−2u)).
Details are in the caption following the image
Figure 4 (c) solid line: x7(t), dashed line: x8(t), and dotted line: x9(t)
Oscillatory behavior of the solutions: mu = 3.5, delays: (0.5, 0.6, and 0.7), and activation functions: f(u) = 1/(1 + exp⁡(−2u)), g(u) = (exp⁡(−2u) − 1)/(1 + exp⁡(−2u)).

5. Conclusion

This paper discusses the oscillatory behavior of the solutions for a three-node network model with discrete and distributed delays. Two theorems are provided to ensure the existence of oscillating solutions for the model. Computer simulations suggested that our theorems are only sufficient conditions. How to find a necessary condition is still an open problem.

Conflict of Interests

The author declares that there is no conflict of interests regarding the publication of this paper.

Acknowledgment

This work is supported by Grant no. 11361010 from NNFS of China to Chunhua Feng.

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.