Oscillatory Behavior on a Three-Node Neural Network Model with Discrete and Distributed Delays
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
2. Preliminaries
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
Lemma 2. Assume that the matrix
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:
Noting that , then we have
If is another equilibrium point of system (8), neglecting of the higher order infinitesimal, we obtain
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:
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:
Proof. First we consider system (16) in the case τ1 = τ2 = τ3 = τ and we easily get:
Let ; then for some t*, y(t) > 0 (t ≥ t*) and we have
Consider the scalar equation
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
So we get
Based on the formula ex ≥ ex (x > 0), from (35), we have
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.












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.