Stability Analysis Including Monostability and Multistability in Dynamical System and ApplicationsView this Special Issue
Dynamical Behaviors of the Stochastic Hopfield Neural Networks with Mixed Time Delays
This paper investigates dynamical behaviors of the stochastic Hopfield neural networks with mixed time delays. The mixed time delays under consideration comprise both the discrete time-varying delays and the distributed time-delays. By employing the theory of stochastic functional differential equations and linear matrix inequality (LMI) approach, some novel criteria on asymptotic stability, ultimate boundedness, and weak attractor are derived. Finally, a numerical example is given to illustrate the correctness and effectiveness of our theoretical results.
The well-known Hopfield neural networks were firstly introduced by Hopfield [1, 2] in early 1980s. Since then, both the mathematical analysis and practical applications of Hopfield neural networks have gained considerable research attention. The Hopfield neural networks have already been successfully applied in many different areas such as combinatorial optimization, knowledge acquisition, and pattern recognition, see, for example, [3–5]. In both the biological and artificial neural networks, the interactions between neurons are generally asynchronous, which give rise to the inevitable signal transmission delays. Also, in electronic implementation of analog neural networks, time delay is usually time-varying due to the finite switching speed of amplifiers. Note that continuously distributed delays have gained particular attention, since a neural network usually has a spatial nature due to the presence of an amount of parallel pathways of a variety of axon sizes and lengths.
Recently, it has been well recognized that stochastic disturbances are ubiquitous and inevitable in various systems, ranging from electronic implementations to biochemical systems, which are mainly caused by thermal noise and environmental fluctuations as well as different orders of ongoing events in the overall systems [6, 7]. Therefore, considerable attentions have been paid to investigate the dynamics of stochastic neural networks, and many results on stochastic neural networks with delays have been reported in the literature, see, for example, [8–30] and references therein. Among which, some sufficient criteria on the stability of uncertain stochastic neural networks were derived in [8–10]. Almost sure exponential stability of stochastic neural networks was discussed in [11–15]. In [16–22], mean square exponential stability and pth moment exponential stability of stochastic neural networks were investigated; Some sufficient criteria on the exponential stability for impulsive stochastic neural networks were established in [23–26]. In , the stability of discrete-time stochastic neural networks was analyzed, while exponential stability of stochastic neural networks with Markovian jump parameters is investigated in [28–30]. These references mainly considered the stability of equilibrium point of stochastic neural networks. What do we study when the equilibrium point does not exist?
Except for stability property, boundedness and attractor are also foundational concepts of dynamical systems. They play an important role in investigating the uniqueness of equilibrium, global asymptotic stability, global exponential stability, the existence of periodic solution, its control and synchronization [31, 32], and so on. Recently, ultimate boundedness and attractor of several classes of neural networks with time delays have been reported. Some sufficient criteria were derived in [33, 34], but these results hold only under constant delays. Following, in , the globally robust ultimate boundedness of integrodifferential neural networks with uncertainties and varying delays was studied. After that, some sufficient criteria on the ultimate boundedness of neural networks with both varying and unbounded delays were derived in , but the concerned systems are deterministic ones. In [37, 38], a series of criteria on the boundedness, global exponential stability, and the existence of periodic solution for nonautonomous recurrent neural networks were established. In [39–41], the ultimate boundedness and attractor of the stochastic Hopfield neural networks with time-varying delays were discussed. To the best of our knowledge, for stochastic neural networks with mixed time delays, there are few published results on the ultimate boundedness and weak attractor. Therefore, the arising questions about the ultimate boundedness, weak attractor, and asymptotic stability of the stochastic Hopfield neural networks with mixed time delays are important yet meaningful.
The left of the paper is organized as follows and some preliminaries are in Section 2, Section 3 presents our main results, a numerical example and conclusions will be in Sections 4 and 5, respectively.
Consider the following stochastic Hopfield neural networks with mixed time delays: where is the state vector associated with the neurons, , represents the rate with which the th unit will reset its potential to the resting state in isolation when being disconnected from the network and the external stochastic perturbation; , and represent the connection weight matrix; , denotes the external bias on the th unit; and denote activation functions, , ; are the diffusion coefficient matrices; is one-dimensional Brownian motion defined on a complete probability space with a natural filtration generated by ; there exists a positive constant such that the transmission delay satisfies
The initial conditions are given in the following form: where is -valued function, -measurable -valued random variable satisfying is the Euclidean norm, and is the space of all continuous -valued functions defined on .
Let , , where Then system (1) can be written by Throughout this paper, the following assumption will be considered.
(A1) There exist constants , , and such that
Remark 1. It follows from  that under the assumption (A1), system (1) has a global solution on . Moreover, under assumption 1, it is not difficult to prove that and satisfy the local Lipschitz condition in .
The notation (resp., ) means that matrix is symmetric positive definite (resp., positive semidefinite). denotes the transpose of the matrix . represents the minimum eigenvalue of matrix . Denote by the family of continuous functions from to . Let be the family of all continuous nonnegative functions defined on such that they are continuously twice differentiable in and once in . Given , we define the functional by where and .
The following lemmas will be used in establishing our main results.
Lemma 3 (see ). For any positive definite matrix , scalar , vector function such that the integrations concerned are well defined, and the following inequality holds:
Lemma 4 (see ). Suppose that system (5) satisfies the local Lipschitz condition and the following assumptions hold. (A2) There are two functions and and two probability measures and on such that
while for all ,
where , and . (A3) If there is a pair of positive constants and such that
Then the unique global solution to system (5) obeys
where while and is the unique root to the following equation:
If, furthermore, , then
3. Main Results
Theorem 5. Suppose that there exist some matrices , and positive constants , , such that and
where , , , , , , , , , means the symmetric terms.
Then, the following results hold.(i) System (1) is stochastically ultimately bounded; that is, for any , there exists a positive constant such that the solution of system (1) satisfies (ii)If , where is the same as defined in Lemma 4,
Proof. Let the Lyapunov function . Applying Itô’s formula in  to along with system (1), one may obtain the following:
From Lemma 3, it follows that
From (A1), it follows that for ,
Similarly, one derives that
Further from (20)–(23), one derives where , , , , , , , Let , , , , . Then it follows from Lemma 4 that where is the same as defined in Lemma 4, Therefore, for any , it follows from Chebyshev’s inequality that If, furthermore, , then it follows from Lemma 4 that (ii) holds.
Theorem 5 shows that there exists such that for any , . Let denote by Clearly, is closed, bounded, and invariant. Moreover, with no less than probability , which means that attracts the solutions infinitely many times with no less than probability , so we may say that is a weak attractor for the solutions.
Remark 7. Compared with [39–41], assumption (A1) is less conservative than that in  and system (1) includes mixed time delays, which is more complex than that in [39–41]. In addition, Lemma 4 is firstly used to investigate the dynamical behaviors of stochastic neural networks with mixed time delays. The bound for may be in a much weaker form. Our results do not only deal with the asymptotic moment estimation but also the path wise (almost sure) estimation.
4. Numerical Example
In this section, a numerical example is presented to demonstrate the validity and effectiveness of our theoretical results.
Example 8. Consider the following stochastic Hopfield neural networks with mixed time delays:
where , ,
and , is one-dimensional Brownian motion. Then , . By using the Matlab LMI Control Toolbox , for , , based on Theorem 5, such system is stochastically ultimately bounded when , , and are chosen as follows:
For , , , we obtain and constant . Then , . For the system in Example 8 (color online), Figure 1(a) shows time trajectories, and Figure 1(b) shows the set and several typical phase portraits, where initial value for is chosen as . In Figure 1(b), only phase portraits for are shown. From Figure 1, one can easily find that these trajectories are almost all attracted by the set .
In this paper, by using the theory of stochastic functional differential equations and linear matrix inequality, new results and sufficient criteria on the asymptotic stability, ultimate boundedness, and attractor of stochastic Hopfield neural networks with mixed time delays are established. A numerical example is also presented to demonstrate the correctness of our theoretical results.
The authors thank the Editor and the Reviewers for their detailed comments and valuable suggestions. This work was supported by the National Natural Science Foundation of China (no. 11271295, 10926128, and 11047114), Science and Technology Research Projects of Hubei Provincial Department of Education (no. Q20111607, Q20111611, D20131602, and D20131604), and Young Talent Cultivation Projects of Guangdong (LYM09134).
J. J. Hopfield, “Neurons with graded response have collective computational properties like those of two-state neurons,” Proceedings of the National Academy of Sciences of the United States of America, vol. 81, no. 10, part 1, pp. 3088–3092, 1984.View at: Google Scholar
S. S. Young, P. D. Scott, and N. M. Nasrabadi, “Object recognition using multilayer Hopfield neural network,” IEEE Transactions on Image Processing, vol. 6, no. 3, pp. 357–372, 1997.View at: Google Scholar
X. D. Li and X. L. Fu, “Global asymptotic stability of stochastic Cohen-Grossberg-type BAM neural networks with mixed delays: an LMI approach,” Journal of Computational and Applied Mathematics, vol. 235, no. 12, pp. 3385–3394, 2011.View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
J. K. Tian, Y. M. Li, J. Z. Zhao, and S. M. Zhong, “Delay-dependent stochastic stability criteria for Markovian jumping neural networks with mode-dependent time-varying delays and partially known transition rates,” Applied Mathematics and Computation, vol. 218, no. 9, pp. 5769–5781, 2012.View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
X. Mao, Stochastic Differential Equations and Applications, Horwood Limited, Chichester, UK, 1997.View at: MathSciNet
K. Gu, “An integral inequality in the stability problem of time-delay systems,” in Proceedings of the 39th IEEE Confernce on Decision and Control, pp. 2805–2810, Sydney, Australia, December 2000.View at: Google Scholar
P. Gahinet, A. Nemirovski, A. J. Laub, and M. Chilali, LMI Control Toolbox User'S Guide, MathWorks, 1995.