# Stability Analysis of Stochastic Markovian Jump Neural Networks with Different Time Scales and Randomly Occurred Nonlinearities Based on Delay-Partitioning Projection Approach

Authors: Jianmin Duan; Manfeng Hu; Yongqing Yang; Liuxiao Guo
Journal: Abstract and Applied Analysis
 (2013)

---

## Abstract

In this paper, the mean square asymptotic stability of stochastic Markovian jump neural networks with different time scales and randomly occurred nonlinearities is investigated. In terms of linear matrix inequality (LMI) approach and delay-partitioning projection technique, delay-dependent stability criteria are derived for the considered neural networks for cases with or without the information of the delay rates via new Lyapunov-Krasovskii functionals. We also obtain that the thinner the delay is partitioned, the more obviously the conservatism can be reduced. An example with simulation results is given to show the effectiveness of the proposed approach.


---

## Body

## 1. Introduction

The human brain is made up of a large amount of neurons and their interconnections. An artificial neural network is an information processing system that has certain characteristics in common with biological neural networks. During the past decades, neural networks have been used for a wide variety of applications, for example, associative memories, pattern recognition, signal processing, and the other fields [1–4]. As is well known, the stability of neural networks plays an important role in modern control theories for these applications. However, time delays are often attributed as the major sources of instability in various engineering systems. Therefore, how to find sufficient conditions to guarantee the stability of neural networks with time delays is an important research topic [5–15].Markovian jump system is an important class of stochastic models, which can be described by a set ofnonlinear systems with the transitions between models determined by a Markovian chain in a finite mode set. This kind of system has been extensively applied to study the stability of neural networks. In real life, neural networks have a phenomenon of information latching, and it is recognized that the best way for modeling this class of neural networks is Markovian jump system [16–18]. Obviously, the Markovian jump system is more complex and challenging than the system without Markovian jump parameters, in which many authors are interested [12, 19–24].On the other hand, it should be pointed out that lots of practical systems are influenced by additive randomly occurred nonlinear disturbances which are caused by environmental circumstances. In today’s networked environment, such nonlinear disturbances may be subject to random abrupt changes, which may result from abrupt phenomena, such as random failures and repairs of the components, environmental disturbance, and so forth. In other words, the nonlinear disturbances may occur in a probabilistic way, but they are randomly changeable in terms of their types and/or intensity. The stochastic nonlinearities, which are then named as randomly occurred nonlinearities (RONs), have recently attracted much attention [25–28].Recently, by introducing free-weighting matrices [29, 30], model transformation method [31], linear matrix inequality (LMI) approach [32, 33], and adopting the concept of delay partitioning [9, 11, 34], stability criteria have been obtained for some neural networks. Sufficient conditions for the robust stability of uncertain stochastic system with interval time-varying delay were derived in [29] by employing the delay partitioning approach. Delay-dependent conditions on mean square asymptotic stability of stochastic neural networks with Markovian jumping parameters are presented by using the delay partitioning method which is different from the existing ones in the literature and convex combination method in [12]. The RONs model and the sensor failure model were introduced in [26]. In [9], better delay-dependent stability criteria for continuous systems with multiple delay components were established by utilizing a delay-partitioning projection approach. On the other hand, it is worth mentioning that neural networks on time scales have been presented and studied [35–37], which can unify the continuous and discrete situations. To the best of the authors’ knowledge, the delay-partitioning projection approach to stability analysis of stochastic Markovian jump neural networks with different time scales and randomly occurred nonlinearities has never been tackled in the previous literature. This motivates our research.In this paper, the problem of stability analysis of stochastic Markovian jump neural networks with different time scales and RONs is considered. The paper is organised as follows. Section2 introduces model description and preliminaries. RONs are introduced to model a class of sector-like nonlinearities whose occurrence is governed by a Bernoulli distributed white sequence with a known conditional probability. In Section 3, we derive the stability results based on delay-partitioning projection approach for stochastic Markovian jump neural networks with RONs. The results include two cases, one with a specified delay rates and the other with arbitrary delay rates. In addition to delay dependence, the obtained conditions are also dependent on the partitioning size; we verify that the conservatism of the conditions is a nonincreasing function of the number of partitions. A numerical example is presented to illustrate the effectiveness of the obtained criteria in Section 4. And finally, conclusions are drawn in Section 5.Notations. Throughout this paper, the notation is fairly standard. Rn denotes the n-dimensional Euclidean space. Rn×m stands for real matrix R of size n×m (simply abbreviated Rn when m=n). P>(<)0 is used to define a real symmetric positive definite (negative definite) matrix. For real symmetric matrices X and Y, the notation X≥Y (resp., X>Y) means that the matrix X-Y is positive semidefinite (resp., positive definite). The symmetric terms in a symmetric matrix are denoted by * and diag{⋯} denotes a block-diagonal matrix. The superscripts AT and A-1 stand for the transpose and inverse of matrix A. (Ω,ℱ,{ℱt}t≥0,𝒫) denotes a complete probability space with a filtration {ℱt}t≥0, where Ω is a sample space, ℱ is the σ-algebra of subset of the sample space, and 𝒫 is the probability measure on ℱ. E{x} stands for the expectation of the stochastic variable x.


## 2. Model Description and Preliminaries

In this paper, the stochastic Markovian jump neural networks with different time scales RONs are considered:(1)εx˙(t)=-A(r(t))x(t)+B(r(t))x(t-τ(t))+ξ(t)Ef(x(t))+[C(r(t))x(t)+D(r(t))x(t-τ(t))]W(t),x(t)=ϕ(t),∀t∈[-d,0],
where x(t)∈Rn is the state vector. W(t) is a scalar zero mean Gaussian white noise process. ϕ(t) is a real-valued initial condition. ε>0 is the time scale. {r(t)} is a right-continuous Markov chain on the probability space (Ω,ℱ,𝒫) taking values in a given finite set S={1,2,…,N}. The transition probability matrix of system (1) is given by
(2)P{r(t+Δt)=j∣r(t)=i}={qijΔt+o(Δt)ifi≠j,1+qiiΔt+o(Δt),ifi=j,
where Δt>0 and limΔt→0o(Δt)/Δt=0, qij≥0 is the transition rate from mode i at time t to mode j at time t+Δt, and qii=-∑i≠jqij. A(r(t))=diag{ai1,ai2,…,ain} is a positive diagonal matrix. B(r(t)), C(r(t)), D(r(t)), and E are known matrices. For the sake of simplicity, in the sequel, each possible value of r(t) is denoted by i,i∈S and A(r(t)), B(r(t)), C(r(t)), D(r(t)) are abbreviated as Ai, Bi, Ci, Di, respectively. d(t) denotes the time-varying delay satisfying
(3)0≤d(t)≤d,d˙(t)≤μ,
where d and μ are constant real numbers.Finally,f(x(t)) stands for the mismatched external nonlinearity. The stochastic variable ξ(t)∈R, which accounts for the phenomena of RONs, is a Bernoulli distributed white noise sequence specified by the following distribution laws:
(4)Prob{ξ(t)=1}=E{ξ(t)}=ξ-,Prob{ξ(t)=0}=1-E{ξ(t)}=1-ξ-.
Furthermore, we can show that
(5)E{ξ(t)-ξ-}=0,E{(ξ(t)-ξ-)2}=ξ-(1-ξ-),
where ξ-∈[0,1] is a constant.Before proceeding, we make the following assumption.Assumption 1.
For allx∈Rn, the nonlinear function f(x) is assumed to satisfy the following sector-bounded condition:
(6)[f(x)-K1x]T[f(x)-K2x]≤0,
where K1 and K2 are known real matrices of appropriate dimensions and K1-K2≥0.Remark 2.
The nonlinear functionf(x) satisfying (6) is customarily said to belong to sector [K1,K2]. Because such a nonlinear condition is quite general which includes the usual Lipschitz condition as a special case, the systems with sector-bounded nonlinearities have been intensively studied in [25, 26].Recall that the time derivative of a Wiener process is a white noise [27, 28]. We establish dw(t)=W(t)dt, where w(t) is a scalar Wiener process on a probability space (Ω,ℱ,{ℱt}t≥0,𝒫), which is independent from the Markov chain {r(t),t≥0}. It is further assumed that w(t) and the stochastic variable ξ(t) are mutually independent. Besides, w(t) satisfies
(7)E{dw(t)}=0,E{dw2(t)}=dt.
Hence, the network (1) is rewritten as the following stochastic differential equations:
(8)dx(t)=ε-1[Ef(x(t))-A(r(t))x(t)+B(r(t))x(t-τ(t))=ε-1h+ξ(t)Ef(x(t))]dt+ε-1[C(r(t))x(t)+D(r(t))x(t-τ(t))]dw(t),x(t)=ϕ(t),∀t∈[-d,0].Remark 3.
The stochastic Markovian neural network with different time scales and RONs (8) is general enough to include many models as its special cases. For example, if we do not consider the RONs, time scales and remove the noise perturbations, then (8) is reduced to those studied in [9, 23, 38–41], whereas the authors in [9, 38–41] ignore the Markovian jump parameters. If we do not consider the RONs and time scales, then (8) is discussed in [29] and its references. If we do not take the noise perturbations and time scales into account and let Prob{ξ(t)=1}=1, B(r(t))=0, (8) is just the one in [42]. If we do not consider the RONs, the Markovian jump parameters, and the noise perturbations, then (8) is studied in [37]. Furthermore, if we remove the time scales, (8) is the one in [43]. Thus, our model generalizes and improves greatly many previous works and is therefore very significant.Remark 4.
In [44], the delay-partitioning approach was introduced to study the discrete-time recurrent neural networks. As an extension of the approach, we use two different partitions to deal with the continuous Markovian jump neural networks with different time scales in this paper.Note that it is easy to prove that there exists at least one equilibrium point for (8) by employing the well-known Brouwer’s fixed point theorem. To end this section, the lemmas which are necessary for the proof of our main results are introduced as follows.Lemma 5.
For any constant matrixR>0, any scalars a and b with a<b, and a vector function x(t):[a,b]→Rn such that the integrations concerned are well defined, the following inequality holds:
(9)[∫ab‍x(s)ds]TR[∫ab‍x(s)ds]≤(b-a)∫ab‍xT(s)Rx(s)ds.Lemma 6 (see [9]).
LetZ∈Rn×n and the bidiagonal upper triangular block matrix
(10)JK(Z)=(In-Z0⋱⋱⋱-Z0In)∈RKn×Kn.
If Y=(JK(Z)F)∈RKn×(Kn+m) with F=(F1⋮Fk)∈RKn×m, Fj∈Rn×m(j=1,…,K), then
(11)Y⊥=col{-∑j=1K‍Zj-1Fj,-∑j=2K‍Zj-2Fj,…,-FK,Im}.Lemma 7 (Finsler’s lemma).
Suppose thatx∈Rn, M=MT∈Rn×n and B∈Rm×n such that B has full row rank. Then, the following statements are equivalent:(1)
there exists a vectorx∈Rn such that xTMx<0 and Bx=0,(2)
there exists a scalarμ∈R such that μBTB-M>0,(3)
∃X∈Rn×m such that M+XB+BTXT<0,(4)
B⊥TMB⊥<0, where B⊥ is the orthogonal complement of B.Remark 8.
It should be pointed out that various problems in control theory have been solved by combing Lyapunov control approach with Finsler’s lemma. In lots of applications, Finsler’s lemma is referred to Elimination lemma, which devotes to eliminate the redundant variables in matrix inequalities [45].


## 3. Main Results

In this section, we will give the mean square asymptotic stability for the system (8) in terms of LMI approach. The main results are stated as follows.Theorem 9.
For given constantsd and μ, and two positive integers m and M, the stochastic system (8) is mean square asymptotically stable if there exist matrices Pi>0, Qk>0(k=1,…,m), R>0, X1>0, X2>0 and
(12)W=WT=(W11⋯W1M⋮⋱⋮W1MT⋯WMM)>0,
and positive scalar l>0 such that the following LMI holds:
(13)B⊥T(Ξ1+Ξ2+Ξ30*Ξ4)B⊥<0,
where B⊥∈R(2m+2M+3)n×(m+M+3)n is all arbitrary but fixed matrix whose columns form a basis of the kernel space of B(m+M)n×(2m+2M+3)n=(Jm+M(In)F),(14)
F
=
(
0
0
0
-
I
n
0
⋯
0
⋮
⋮
⋮
⋱
⋱
⋮
0
0
0
⋱
⋱
0
-
I
n
0
0
0
⋯
0
-
I
n
)
∈
R
(
m
+
M
)
n
×
(
m
+
M
+
3
)
n
,
Ξ
1
=
(
Ω
1
0
⋯
ε
-
1
P
i
B
i
0
W
1
M
⋯
W
12
Δ
1
*
Ω
2
⋯
0
0
0
⋯
0
0
⋮
⋮
⋱
⋮
⋮
⋮
⋱
⋮
⋮
*
*
…
Ω
m
+
1
0
0
⋯
0
0
*
*
…
*
Γ
M
+
1
-
W
(
M
-
1
)
M
T
⋯
-
W
1
M
T
0
*
*
…
*
*
Γ
M
⋯
W
2
M
T
-
W
1
(
M
-
1
)
T
0
⋮
⋮
⋱
⋮
⋮
⋮
⋱
⋮
⋮
*
*
…
*
*
*
⋯
Γ
2
0
*
*
…
*
*
*
⋯
*
Δ
2
)
,
Ω
1
=
-
2
ε
-
1
P
i
A
i
+
∑
j
=
1
N
q
i
j
P
j
+
W
11
+
∑
i
=
1
m
Q
i
-
l
K
~
1
,
Δ
1
=
-
l
K
~
2
+
ξ
-
ε
-
1
P
i
E
,
Δ
2
=
-
l
I
+
R
+
E
T
(
ε
-
2
(
ξ
-
-
ξ
-
2
)
h
(
d
-
h
)
X
1
+
ε
-
2
(
ξ
-
-
ξ
-
2
)
d
σ
X
2
)
E
,
Ω
k
=
(
(
k
-
1
)
μ
m
-
1
)
Q
k
-
1
,
(
k
=
2
,
…
,
m
+
1
)
,
Γ
k
=
W
k
k
-
W
(
k
-
1
)
(
k
-
1
)
,
W
(
M
+
1
)
(
M
+
1
)
=
0
,
(
k
=
2
,
…
,
M
+
1
)
,
Ξ
2
=
(
-
A
i
0
⋯
0
B
i
0
⋯
0
ξ
-
E
)
T
(
ε
-
2
h
(
d
-
h
)
X
1
+
ε
-
2
d
σ
X
2
)
(
-
A
i
0
⋯
0
B
i
0
⋯
0
ξ
-
E
)
,
Ξ
3
=
(
C
i
0
⋯
0
D
i
0
⋯
0
)
T
(
ε
-
2
(
d
-
h
)
X
1
+
ε
-
2
d
X
2
+
ε
-
2
P
i
)
(
C
i
0
⋯
0
D
i
0
⋯
0
)
,
Ξ
4
=
diag
{
(
μ
-
1
)
R
,
-
X
2
,
…
,
-
X
2
,
-
m
-
1
X
2
,
-
X
1
,
…
,
-
X
1
}
,
K
~
1
=
(
K
1
T
K
2
+
K
2
T
K
1
)
2
,
K
~
2
=
-
(
K
1
T
+
K
2
T
)
2
.Proof.
For presentation convenience, in the following, we denote(15)y(t)=-A(r(t))x(t)+B(r(t))x(t-d(t))+ξ(t)Ef(x(t)),m(t)=C(r(t))x(t)+D(r(t))x(t-d(t)),
then, the system (8) becomes
(16)dx(t)=y(t)dt+m(t)dw(t).
By employing the idea of delay partitioning approach to the time-delay d(t), we choose the following Lyapunov-Krasovskii functional candidate:
(17)V(x(t),t,i)=xT(t)Pix(t)+∑k=1m‍∫t-αk(t)t‍xT(s)Qkx(s)ds+∫t-ht‍γT(s)Wγ(s)ds+∫t-d(t)t‍fT(x(s))Rf(x(s))ds+h∫-d-h‍∫t+θt‍yT(s)X1y(s)dsdθ+∫-d-h‍∫t+θt‍mT(s)X1m(s)dsdθ+σ∫-d0‍∫t+θt‍yT(s)X2y(s)dsdθ+∫-d0‍∫t+θt‍mT(s)X2m(s)dsdθ,
where
(18)γT(t)=(xT(t)xT(t-h)⋯xT(t-(M-1)h)),σ(t)=d(t)m,h=dM,σ=dm,αk(t)=kσ(t),(k=1,…,m).
Let ℒ be the weak infinitesimal generator of the random process {x(t),r(t),t≥0} along the trajectory of the system (8). Then, by Itô differential formula, we have
(19)ℒV(x(t),t,i)=2xT(t)Piy(t)+xT(t)∑j=1N‍qijPjx(t)+mT(t)Pim(t)+∑i=1m‍xT(t)Qix(t)-∑i=1m‍(1-α˙i(t))xT(t-αi(t))Qix(t-αi(t))+γT(t)Wγ(t)-γT(t-h)Wγ(t-h)+fT(x(t))Rf(x(t))-(1-d˙(t))fT(x(t-d(t)))Rf(x(t-d(t)))+h(d-h)yT(t)X1y(t)-h∑k=2M‍∫t-kht-(k-1)h‍yT(s)X1y(s)ds+(d-h)mT(t)X1m(t)-∑k=2M‍∫t-kht-(k-1)h‍mT(s)X1m(s)ds+σdyT(t)X2y(t)-σ∑i=1m‍∫t-αi(t)t-αi-1(t)‍yT(s)X2y(s)ds-σ∫t-dt-d(t)‍yT(s)X2y(s)ds+dmT(t)X2m(t)-∑i=1m‍∫t-αi(t)t-αi-1(t)‍mT(s)X2m(s)ds-∫t-dt-d(t)‍mT(s)X2m(s)ds.
By virtue of (3), (7), and (9), it can be verified that
(20)E{ℒV(x(t),t,i)}≤E{2xT(t)Piy(t)+xT(t)∑j=1N‍qijPjx(t)+mT(t)Pim(t)-∑i=1m‍(1-imμ)xT(t-αi(t))Qix(t-αi(t))+∑i=1m‍xT(t)Qix(t)+γT(t)Wγ(t)-γT(t-h)Wγ(t-h)+fT(x(t))Rf(x(t))-(1-μ)fT(x(t-d(t)))×Rf(x(t-d(t)))+h(d-h)yT(t)X1y(t)+(d-h)mT(t)X1m(t)+σdyT(t)X2y(t)+dmT(t)X2m(t)-∑k=2M‍(∫t-kht-(k-1)h‍y(s)ds)TX1×(∫t-kht-(k-1)h‍y(s)ds)-∑k=2M‍(∫t-kht-(k-1)h‍m(s)dω(s))TX1×(∫t-kht-(k-1)h‍m(s)dω(s))-∑i=1m‍(∫t-αi(t)t-αi-1(t)‍y(s)ds)TX2×(∫t-αi(t)t-αi-1(t)‍y(s)ds)-1m(∫t-dt-d(t)‍y(s)ds)TX2×(∫t-dt-d(t)‍y(s)ds)-∑i=1m‍(∫t-αi(t)t-αi-1(t)‍m(s)dω(s))TX2×(∫t-αi(t)t-αi-1(t)‍m(s)dω(s))-1m(∫t-dt-d(t)‍m(s)dω(s))TX2×(∫t-dt-d(t)‍m(s)dω(s))}.
On the other hand, note that (6) is equivalent to
(21)(xf(x))T(K~1K~2*I)(xf(x))≤0,
which implies
(22)-l[fT(x(t))f(x(t))+fT(x(t))K~2Tx(t)+xT(t)K~2f(x(t))+xT(t)K~1x(t)]≥0,
where l is a positive constant.
Substituting (5), (7), (15), and (22) into (20), we can obtain
(23)E{ℒV(x(t),t,i)}≤E{(∫t-kht-(k-1)h‍m(s)dω(s))T2xT(t)Pi(-Aix(t)+Bix(t-d(t)))-lxT(t)K~1x(t)+2xT(t)(ε-1ξ-PiE-lK~2)×f(x(t))+xT(t)∑j=1N‍qijPjx(t)+hT(t)Pih(t)-∑i=1m‍(1-imμ)xT×(t-αi(t))Qix(t-αi(t))+∑i=1m‍xT(t)Qix(t)+γT(t)Wγ(t)-γT(t-h)Wγ(t-h)+fT(x(t))(R-lI)f(x(t))+h(d-h)yT(t)X1y(t)-(1-μ)fT×(x(t-d(t)))Rf(x(t-d(t)))+(d-h)mT(t)X1m(t)+σdyT(t)X2y(t)+dmT(t)X2m(t)-∑k=2M‍(∫t-kht-(k-1)h‍y(s)ds)TX1×(∫t-kht-(k-1)h‍y(s)ds)-∑k=2M‍(∫t-kht-(k-1)h‍m(s)dω(s))TX1×(∫t-kht-(k-1)h‍m(s)dω(s))-∑i=1m‍(∫t-αi(t)t-αi-1(t)‍y(s)ds)TX2×(∫t-αi(t)t-αi-1(t)‍y(s)ds)-1m(∫t-dt-d(t)‍y(s)ds)TX2×(∫t-dt-d(t)‍y(s)ds)-∑i=1m‍(∫t-αi(t)t-αi-1(t)‍m(s)dω(s))TX2×(∫t-αi(t)t-αi-1(t)‍m(s)dω(s))-1m(∫t-dt-d(t)‍m(s)dω(s))TX2×(∫t-dt-d(t)‍m(s)dω(s))(∫t-kht-(k-1)h‍m(s)dω(s))T}=E{ξT(t)(Ξ1+Ξ2+Ξ30*Ξ4)ξ(t)},
where
(24)ξ(t)=(ζ1T(t)ζ2T(t)fT(x(t))fT(x(t-d(t)))ζT(t))T,ζ1(t)=(xT(t)xT(t-α1(t))⋯xT(t-αm(t)))T,ζ2(t)=(xT(t-d)xT(t-(M-1)h)⋯xT(t-h))T,ζ(t)=(δ1⋯δm∫t-dt-d(t)‍yT(s)ds+∫t-dt-d(t)‍mT(s)dω(s)θM-1θ1)T,δk=∫t-αk(t)t-αk-1(t)‍yT(s)ds+∫t-αk(t)t-αk-1(t)‍mT(s)dω(s),(s)ds+∫t-αk(t)t-αk-1(t)‍mT(s)dω(s)(k=1,…,m),θk=∫t-(k+1)ht-kh‍yT(s)ds+∫t-(k+1)ht-kh‍mT(s)dω(s),s+∫t-(k+1)ht-kh‍mT(s)dω(s)(k=1,…,M-1).
In addition, it follows from the Newton-Leibniz formula that
(25)x(t)-x(t-α1(t))-∫t-α1(t)t‍y(s)ds-∫t-α1(t)t‍m(s)dω(s)=0,⋮x(t-αm-1(t))-x(t-αm(t))-∫t-αm(t)t-αm-1(t)‍y(s)ds-∫t-αm(t)t-αm-1(t)‍m(s)dω(s)=0,x(t-αm(t))-x(t-d)-∫t-dt-αm(t)‍y(s)ds-∫t-dt-αm(t)‍m(s)dω(s)=0,x(t-d)-x(t-(M-1)h)+∫t-dt-(M-1)h‍y(s)ds+∫t-dt-(M-1)h‍m(s)dω(s)=0,⋮x(t-2h)-x(t-h)+∫t-2ht-h‍y(s)ds+∫t-2ht-h‍m(s)dω(s)=0
which are equivalent to
(26)Bξ(t)=(Jm+1(In)F)ξ(t)=(In-In0⋯000-In0⋯00In-In⋯0000-In⋯0⋮⋮⋱⋱⋮⋮⋮⋮⋮⋱⋮00⋯In-In0000⋯-In)ξ(t)=0.
The full column rank matrix representation of the right orthogonal complement of B is denoted by B⊥, and Lemma 6 offers a computation method with Z=In, B⊥=col{-∑j=1K‍Fj,-∑j=2K‍Fj,…,-FK,Im}. According to Lemma 7, E{ℒV(x(t),t,i)} is negative as long as
(27)ξT(t)(B⊥B-(Ξ1+Ξ2+Ξ30*Ξ4))ξ(t)>0
holds, which, in other words, can be expressed as (13). Hence, the stochastic system (8) is asymptotical stable in the mean square, and it completes the proof.Remark 10.
The delay-partitioning projection technique employed in this paper constitutes the major improvement from most existing results in the literature. Firstly, it should be pointed out that such technique is very rational. The reasons are twofold.(1) The properties of subinterval delays may be sharply different in many practical situations. Thus, it is not reasonable to combine them together. (2) When d(t) reaches its upper bound, we do not necessarily have every subinterval delay reaches its maximum at the same time. That is to say, if we use an upper bound to bound the delay d(t) we have to use the sum of the maxima of subinterval delays; however, d(t) does not achieve this maximum value usually. Therefore, by adopting the delay-partitioning projection approach, less conservative conditions can be proposed. Secondly, in [46], the central point of variation of the delay was introduced to study the stability for time-delay systems, which is called the DCP method. As an extension of the method, we divide the delay into several subintervals which permits employing one slightly different function for different subintervals. This treatment makes us utilize more information on the time delay and thus may present better criteria with less conservatism. Thirdly, two different partitions are made to deal with the time-varying delay in this paper, which are different from the approach in [43]. The parameters m and M refer to the number of delay partitioning, and it indicates that the solution can be searched in a wider space, which leads to the reduction of conservatism. Finally, using the similar analysis method of [7], it is easy to verify that the conservatism of the conditions is a nonincreasing function of the number of delay partitions. However, as we all know, the computational complexity will be increased as the partitioning becomes thinner. Therefore, the delay-partitioning projection approach can provide the flexibility that allows us to trade off between complexity and performance of the stability analysis.We now consider that the time-varying delay is nondifferentiable or the bound of the delay is unknown, which means that the restriction on the delay is removed. For this goal, we modify the Lyapunov-Krasovskii functional as(28)V^(x(t),t,i)=xT(t)Pix(t)+∫t-ht‍γT(s)Wγ(s)ds+∫t-dt‍fT(x(s))Rf(x(s))ds+h∫-d-h‍∫t+θt‍yT(s)X1y(s)dsdθ+∫-d-h‍∫t+θt‍mT(s)X1m(s)dsdθ+σ∫-d0‍∫t+θt‍yT(s)X2y(s)dsdθ+∫-d0‍∫t+θt‍mT(s)X2m(s)dsdθ.
The proof can then be derived by following a similar line of arguments as that in Theorem 9. Besides, f(x(t-d(t))) in ξ(t) will turn out to be f(x(t-d)).Theorem 11.
For given constantd and two positive integers m and M, the stochastic system (8) is mean square asymptotically stable if there exist matrices Pi>0, R>0, X1>0, X2>0, and
(29)W=WT=(W11⋯W1M⋮⋱⋮W1MT⋯WMM)>0,
and positive scalar l>0 such that the following LMI holds:
(30)B⊥T(Ξ^1+Ξ2+Ξ30*Ξ^4)B⊥<0,
where(31)
Ξ
^
1
=
(
Ω
^
1
0
⋯
ε
-
1
P
i
B
i
0
W
1
M
⋯
W
12
Δ
1
*
0
⋯
0
0
0
⋯
0
0
⋮
⋮
⋱
⋮
⋮
⋮
⋱
⋮
⋮
*
*
⋯
0
0
0
⋯
0
0
*
*
⋯
*
Γ
M
+
1
-
W
(
M
-
1
)
M
T
⋯
-
W
1
M
T
0
*
*
⋯
*
*
Γ
M
⋯
W
2
M
T
-
W
1
(
M
-
1
)
T
0
⋮
⋮
⋱
⋮
⋮
⋮
⋱
⋮
⋮
*
*
⋯
*
*
*
⋯
Γ
2
0
*
*
⋯
*
*
*
⋯
*
Δ
2
)
,
Ω
^
1
=
-
2
ε
-
1
P
i
A
i
+
∑
j
=
1
N
‍
q
i
j
P
j
+
W
11
-
l
K
~
1
,
Ξ
^
4
=
diag
{
-
R
,
-
X
2
,
…
,
-
X
2
,
-
m
-
1
X
2
,
-
X
1
,
…
,
-
X
1
}
,andB⊥, Δ1, Δ2, Γk, Ξ2, Ξ3, K~1, K~2 are the same as in Theorem 9.Remark 12.
Obviously, the delay rate is not specified in Theorem11, which includes the constant time delay as a special case. Therefore, Theorem 11 is applicable to the special case to derive some results.Remark 13.
In previous work as [47], the authors have investigated the stability of neutral type neural networks with discrete and distributed delays. The reason why we do not take these neural networks into account is to make our idea more lucid and to avoid complicated notations. However, it is not difficult to extend our results to the neutral type neural networks with mixed time-varying delays. The results will appear in our following study.


## 4. A Numerical Example

One illustrative example is presented to show the effectiveness of the theoretical results. For simplicity, the system (8) with Markovian switching between two modes is taken into consideration. In addition, the state vector of each node is of dimension two. In other words, N=2, n=2. The mode switching is governed by the rate matrix (-0.40.40.3-0.3), and the other parameters are assumed as
(32)A1=(3.3003.4),A2=(4.4004.5),B1=(-0.3-0.6-0.50.5),B2=(-2.2-0.5-1.21.2),E=(-100-0.1),C1=(0.10.20.10.5),C2=(0.510.20.1),D1=(0.1-0.2-0.50.4),D2=(0.2-0.5-0.10.2),ξ-=0.56,ε=1,d(t)=0.8+0.5sintπ2(t∈Z).
The sector-bounded nonlinear function f(x(t)) is given as follows:
(33)f(x(t))=12(0.3(x1(t)+x2(t))1+x12(t)+x22(t)+0.1x1(t)+0.1x2(t)0.3x1(t)+0.3x2(t))T,
which can be bounded by
(34)K1=(0.20.100.2),K2=(-0.10-0.10.1).
We choose the parameters m=2 and M=2. It is easy to know d=1.3 and μ=0.5.By using Matlab LMI control toolbox, we can find the feasible solution of the LMI (13) as follows:
(35)P1=(1.8392-0.8471-0.84714.5444),P2=(2.0534-0.5930-0.59303.9335),Q1=(0.4422-0.3769-0.37691.8266),Q2=(7.6178-2.8997-2.899711.9753),X1=(0.0594-0.1562-0.15620.4677),X2=(0.0663-0.1841-0.18410.5600),R=(0.2487-0.0084-0.00840.5947),W11=(1.1837-0.4007-0.40073.6472),W12=(0.0111-0.1045-0.10450.4755),W22=(0.7856-0.4878-0.48782.4023).
The simulation result is shown in Figure 1, which implies that all the expected system performance requirements are well achieved.Figure 1
State development of system (8) with parameters (32).Remark 14.
It is worth pointing out that ifProb{ξ(t)=1}=1, then the function f(x(t)) in (8) will be the neuron activation function. According to Assumption 1, f(x(t)) satisfies the sector-bounded condition which is more general than the Lipschitz condition. Therefore, the stability criteria in [42] can not apply to our example.Remark 15.
In our example, many factors such as noise perturbations, Markovian jump parameters, RONs, and different time scales are considered and the delay-partitioning projection approach is employed. Therefore, the results reported in [9, 23, 38–41] do not hold in our example. Moreover, our results are expressed by LMIs, which can be easily checked by using the powerful Matlab LMI Toolbox. Thus, our stability criteria are more computationally efficient than those given in [13, 40, 41].


## 5. Conclusions

In this paper, we have dealt with the mean square asymptotic stability problem for stochastic Markovian jump neural networks with different time scales and RONs. By using new Lyapunov-Krasovskii functionals and delay-partitioning projection approach, the LMI-based criteria have been developed to guarantee stability of such systems. It is also shown that the delay-partitioning projection approach can achieve the aim of reducing conservativeness. An numerical example is exploited to illustrate the effectiveness of the theoretical results.



---

*Source: 212469-2013-11-14.xml*