Research Article  Open Access
Robust Synchronization Criterion for Coupled Stochastic DiscreteTime Neural Networks with Interval TimeVarying Delays, Leakage Delay, and Parameter Uncertainties
Abstract
The purpose of this paper is to investigate a delaydependent robust synchronization analysis for coupled stochastic discretetime neural networks with interval timevarying delays in networks coupling, a time delay in leakage term, and parameter uncertainties. Based on the Lyapunov method, a new delaydependent criterion for the synchronization of the networks is derived in terms of linear matrix inequalities (LMIs) by constructing a suitable LyapunovKrasovskii’s functional and utilizing Finsler’s lemma without freeweighting matrices. Two numerical examples are given to illustrate the effectiveness of the proposed methods.
1. Introduction
In recent years, the problem of synchronization of coupled neural networks which is one of hot research fields of complex networks has been a challenging issue due to its potential applications such as physics, information sciences, biological systems, and so on. Here, complex networks, which are a set of interconnected nodes with specific dynamics, have been studied from various fields of science and engineering such as the World Wide Web, social networks, electrical power grids, global economic markets, and so on. Many mathematical models were proposed to describe various complex networks [1, 2]. Also, in the real applications of systems, there exists naturally time delay due to the finite information processing speed and the finite switching speed of amplifiers. It is well known that time delay often causes undesirable dynamic behaviors such as performance degradation and instability of the systems. So, some sufficient conditions for synchronization of coupled neural networks with time delay have been proposed in [3–5]. Moreover, the synchronization of delayed systems was applied in practical systems such as secure communication [6]. Furthermore, these days, most systems use digital computers (usually microprocessor or microcontrollers) with the necessary input/output hardware to implement the systems. The fundamental character of the digital computer is that it takes compute answers at discrete steps. Therefore, discretetime modeling with time delay plays an important role in many fields of science and engineering applications. In this regard, various approaches to synchronization stability criterion for discretetime complex networks with time delay have been investigated in the literature [7–9].
On the other hand, in implementation of many practical systems such as aircraft, chemical and biological systems, and electric circuits, there exist occasionally stochastic perturbations. It is not less important than the time delay as a considerable factor affecting dynamics in the fields of science and engineering applications. Therefore, the study on the problems for various forms of stochastic systems with timedelay has been addressed. For more details, see the literature [10–13] and references therein. Furthermore, on the problem of synchronization of coupled stochastic neural networks with time delay, various researches have been conducted [14–17]. Li and Yue [14] studied the synchronization stability problem for a class of complex networks with Markovian jumping parameters and mixed time delays. The model considered in [14] has stochastic coupling terms and stochastic disturbances to reflect more realistic dynamical behaviors of the complex networks that are affected by noisy environment. In [15], by utilizing novel LyapunovKrasovskii's functional with both lower and upper delay bounds, the synchronization criteria for coupled stochastic discretetime neural networks with mixed delays were presented. Tang and Fang [16] derived several sufficient conditions for the synchronization of delayed stochastically coupled fuzzy cellular neural networks with mixed delays and uncertain hybrid coupling based on adaptive control technique and some stochastic analysis methods. In [17], by using Kronecker product as an effective tool, robust synchronization problem of coupled stochastic discretetime neural networks with timevarying delay was investigated. Moreover, Song [18–20] addressed synchronization problem for the array of asymmetric, chaotic, and coupled connected neural networks with timevarying delay or nonlinear coupling. Also, in [21], robust exponential stability analysis of uncertain delayed neural networks with stochastic perturbation and impulse effects was investigated.
Very recently, a time delay in leakage term of the systems is being put to use in the problem of stability for neural networks as a considerable factor affecting dynamics for the worse in the systems [22, 23]. Li et al. [22] studied the existence and uniqueness of the equilibrium point of recurrent neural networks with time delays in the leakage term. By use of the topological degree theory, delaydependent stability conditions of neural networks of neutral type with time delays in the leakage term were proposed in [23]. Unfortunately, to the best of authors’ knowledge, delaydependent synchronization analysis of coupled stochastic discretetime neural networks with timevarying delay in network coupling and leakage delay has not been investigated yet. Thus, by attempting the synchronization analysis for the model of coupled stochastic discretetime neural networks with time delay in the leakage term, the model for coupled neural networks and its applications are closed to the practical networks. Here, delaydependent analysis has been paid more attention than delayindependent one because the sufficient conditions for delaydependent analysis make use of the information on the size of time delay [24]. That is, the former is generally less conservative than the latter.
Motivated by the above discussions, the problem of a new delaydependent robust synchronization criterion for coupled stochastic discretetime neural networks with interval timevarying delays in network coupling, the time delay in leakage term, and parameter uncertainties is considered for the first time. The coupled stochastic discretetime neural networks are represented as a simple mathematical model by the use of Kronecker product technique. Then, by construction of a suitable LyapunovKrasovskii's functional and utilization of Finsler’s lemma without freeweighting matrices, a new synchronization criterion is derived in terms of LMIs. The LMIs can be formulated as convex optimization algorithms which are amenable to computer solution [25]. In order to utilize Finsler’s lemma as a tool of getting less conservative synchronization criteria on the number of decision variables, it should be noted that a new zero equality from the constructed mathematical model is devised. The concept of scaling transformation matrix will be utilized in deriving zero equality of the method. In [26], the effectiveness of Finsler’s lemma was illustrated by the improved passivity criteria of uncertain neural networks with timevarying delays. Finally, two numerical examples are included to show the effectiveness of the proposed method.
Notation. is the dimensional Euclidean space, and denotes the set of all real matrices. For symmetric matrices and , (resp., ) means that the matrix is positive definite (resp., nonnegative). denotes a basis for the nullspace of . and and denote identity matrix and and zero matrices, respectively. refers to the Euclidean vector norm or the induced matrix norm. means the maximum eigenvalue of a given square matrix. denotes the block diagonal matrix. represents the elements below the main diagonal of a symmetric matrix. Let be complete probability space with a filtration satisfying the usual conditions (i.e., it is right continuous and contains all pull sets). stands for the mathematical expectation operator with respect to the given probability measure .
2. Problem Statements
Consider the following discretetime delayed neural networks: where denotes the number of neurons in a neural network, is the neuron state vector, denotes the neuron activation function vector, means a constant external input vector, is the state feedback matrix, are the connection weight matrices, and and are the parameter uncertainties of the form where is a real uncertain matrix function with Lebesgue measurable elements satisfying The delays and are interval timevarying delays and leakage delay, respectively, satisfying where and are positive integers.
The neuron activation functions, , are assumed to be nondecreasing, bounded, and globally Lipschitz; that is, where and are constant values.
For simplicity, in stability analysis of the network (1), the equilibrium point is shifted to the origin by the utilization of the transformation , which leads the network (1) to the following form: where is the state vector of the transformed network, and is the transformed neuron activation function vector with satisfies, from (5), , which is equivalent to
In this paper, a model of coupled stochastic discretetime neural networks with interval timevarying delays in network coupling, leakage delay, and parameter uncertainties is considered as where is the number of couple nodes, is the state vector of the th node, is the constant innercoupling matrix of nodes, which describe the individual coupling between the subnetworks, is the outercoupling matrix representing the coupling strength and the topological structure of the network satisfies the diffusive coupling connections and are dimensional Wiener processes (Brownian Motion) on which satisfy Here, and , which are mutually independent, are the coupling strength disturbance and the system noise, respectively. And the nonlinear uncertainties are the noise intensity functions satisfying the Lipschitz condition and the following assumption: where are constant matrices with appropriate dimensions.
Remark 1. According to the graph theory [27], the outercoupling matrix is called the negative Laplacian matrix of undirected graph. A physical meaning of the matrix is the bilateral connection between node and . If the matrix cannot satisfy symmetric, the unidirectional connection between nodes and is expressed. At this time, the matrix is called the negative Laplacian matrix of directed graph. Therefore, new numerical model and strong sufficient condition guaranteed to the stability for networks are needed. Moreover, in order to analyze the consensus problem for multiagent systems, the Laplacian matrix of directed graph was used [28].
For the convenience of stability analysis for the network (8), the following Kronecker product and its properties are used.
Lemma 2 (see [29]). Let denote the notation of Kronecker product. Then, the following properties of Kronecker product are easily established:(i),(ii),(iii),(iv).
Let us define Then, with Kronecker product in Lemma 2, the network (8) can be represented as where , , and .
In addition, for stability analysis, (13) can be rewritten as follows: where
The aim of this paper is to investigate the delaydependent synchronization stability analysis of the network (14) with interval timevarying delays in network coupling, leakage delay, and parameter uncertainties. In order to do this, the following definition and lemmas are needed.
Definition 3 (see [7]). The network (8) is said to be asymptotically synchronized if the following condition holds:
Lemma 4 (see [3]). Let , , , and . If and each row sum of is zero, then
Lemma 5 (see [30]). For any constant matrix , integers and satisfying , and vector function , the following inequality holds:
Lemma 6 (see [31] (Finsler's lemma)). Let , , and such that . The following statements are equivalent: (i), , , (ii).
3. Main Results
In this section, a new synchronization criterion for the network (14) will be proposed. For the sake of simplicity on matrix representation, are defined as block entry matrices (e.g., ). The notations of several matrices are defined as follows:
Then, the main result of this paper is presented as follows.
Theorem 7. For given positive integers , and , diagonal matrices and , the network (14) is asymptotically synchronized for , if there exist positive scalars , , positive definite matrices , , , , , , , positive diagonal matrices , , and any matrix satisfying the following LMIs for : where , , , and are defined in (19).
Proof. Define a matrix as
and the forward difference of and as
Let us consider the following LyapunovKrasovskii's functional candidate as
where
The mathematical expectation of is calculated as follows:
By Lemmas 4 and 5, the sum terms of are bounded as follows:
where , which satisfies .
Also, by Theorem 7 in [32], the following inequality for any matrix holds
which implies
then, an upper bound of the sum term (29) of can be rebounded as
Similarly, the sum term of is bounded as
Also, by properties of Kronecker product in Lemma 2 and , the terms in (27) are calculated as follows:
where is defined in (19), and, if , then, from (11), the upper bound of terms in (27) is calculated as follows:
Then, by utilizing Lemma 4, an upper bound of can be written as follows:
From (7), for any positive diagonal matrices , the following inequalities hold.
Since the relational expression between and , , holds from the second equality of the system (14), there exists a positive scalar satisfying the following inequality:
From (36)–(38), by Sprocedure [25], the has a new upper bound as follows:
Also, the network (14) with the augmented matrix can be rewritten as follows:
Here, in order to illustrate the process of obtaining (40), let us define the following:
By (14), (23), and properties of Kronecker product in Lemma 2, we have the following zero equality:
By Lemma 4, the first term of (42) can be obtained as follows:
Similarly, the other terms of (42) are calculated as follows:
Then, (42) can be rewritten as follows:
Therefore, if the zero equality (40) holds, then a synchronization condition for the network (14) is
subject to
Here, if inequality (47) holds, then there exists a positive scalar such that . From (39) and (47), we have . Thus, by Lyapunov theorem and Definition 3, it can be guaranteed that the subnetworks in the coupled discretetime neural networks (14) are asymptotically synchronized. Also, condition (47) is equivalent to the following inequality:
subject to
Finally, by the use of Lemma 6, condition (49) is equivalent to the following inequality:
and applying Schur complement [25] leads to
which can be rewritten by
From inequality (52), if the LMIs (22) are satisfied, then stability condition (47) holds. This completes our proof.
Remark 8. In order to induce a new zero equality (40), the matrix in (41) was defined. It is inspired by the concept of scaling transformation matrix. To reduce the decision variable, Finsler’s lemma (ii) without freeweighting matrices was used. At this time, a zero equality is required. If the matrix is not considered, then the following description (see only (43) as an example) as shown in (53) does not hold. Thus, the derivation of zero equality in (40) is impossible. Here, to use Lemma 4, a suitable vector or matrix in the empty parentheses is needed. Therefore, by defining the matrix , the induction of the zero equality (40) is possible.
Remark 9. In this paper, the problem of new delaydependent synchronization for coupled stochastic discretetime neural networks with leakage delay and parameter uncertainties is considered. By using Finsler's lemma without freeweighting matrices, the proposed robust synchronization criterion for the network is established in terms of LMIs. Here, as mentioned in the Introduction, the leakage delay is the time delay in leakage or forgetting term of the systems and a considerable factor affecting dynamics for the worse in the network. The effect of the leakage delay which cannot be negligible is shown in Figure 2. Also, the stochastic discretetime systems with parameter uncertainties do not formulate like as the network (14) in any other literature. To do this, the vector is added in the augmented vector . It is just like as in continuoustime systems. This form for the systems may give more less conservative results for stability analysis. As a case of stochastic continuoustime systems with parameter uncertainties, Kwon [13] derived the delaydependent stability criteria for uncertain stochastic dynamic systems with timevarying delays via the LyapunovKrasovskii's functional approach with two delay fraction numbers.
4. Numerical Examples
In this section, we provide two numerical examples to illustrate the effectiveness of the proposed synchronization criterion in this paper.
Example 10. Consider the following coupled neural networks by complex model in Figure 1:
with , where
For the network above, the maximum allowable delay bounds with different and fixed by Theorem 7 are listed in Table 1. In order to confirm the obtained results with the conditions of the time delays as listed in Table 2, the simulation results for the trajectories of state responses, , and synchronization errors, , of the network (54) are shown in Figures 2, 3, 4, and 5. These figures show that the network with the errors converge to zero for given initial values of the state by , , , , and . Specially, the simulation results in Figure 2 show state response trajectories for the values of leakage delay, , by 3, 15, and 30 with fixed values and . It is easy to illustrate that the larger value of leakage delay gives the worse dynamic behaviors of the network (54).


(a)
(b)
(c)
(a)
(b)
(c)
(d)
(a)
(b)
(c)
(d)
Example 11. Consider the following coupled neural networks by BA scalefree model [33] in Figure 6:
with , where
The results of maximum allowable delay bounds with different and fixed by Theorem 7 are listed in Table 3. For lack of space, the outercoupling matrix is omitted. It is easy that the matrix was expressed from Figure 6. Figures 7 and 8 show the state response trajectories, , of the network (56) with the condition of the time delays as listed in Table 4 for random initial values of the state. These figures show that the network (56) with the state responses converge to zero. This means the synchronization stability of the network (56).

