# Synchronization of General Complex Networks with Hybrid Couplings and Unknown Perturbations

Authors: Xinsong Yang; Shuang Ai; Tingting Su; Ancheng Chang
Journal: Abstract and Applied Analysis
 (2013)

---

## Abstract

The issue of synchronization for a class of hybrid coupled complex networks with mixed delays (discrete delays and distributed delays) and unknown nonstochastic external perturbations is studied. The perturbations do not disappear even after all the dynamical nodes have reached synchronization. To overcome the bad effects of such perturbations, a simple but all-powerful robust adaptive controller is designed to synchronize the complex networks even without knowing a priori the functions and bounds of the perturbations. Based on Lyapunov stability theory, integral inequality Barbalat lemma, and Schur Complement lemma, rigorous proofs are given for synchronization of the complex networks. Numerical simulations verify the effectiveness of the new robust adaptive controller.


---

## Body

## 1. Introduction

Over the past decade, complex networks have attracted much attention from authors of many disciplines since the pioneer works of Watts and Strogatz [1, 2]. In fact, many phenomena in nature and our daily life can be explained by using complex networks, such as the Internet, World Wide Web, social networks, and neural networks. A complex network can be considered as a graph which consists of a set of nodes and edges connecting these nodes [3].In recent years, chaos synchronization [3–7] has been intensively studied due to its important applications in many different areas, such as secure communication, biological systems, and information science [8–11]. Particularly, the synchronization of all the dynamical nodes in complex networks has become a hot research topic [3], and several results have been appeared in the literature. The authors of [12] studied the synchronization in complex networks with switching topology. In [13], Wu and Jiao investigated the synchronization in complex dynamical networks with nonsymmetric coupling. They showed that the synchronizability of a dynamical network with nonsymmetric coupling is not always characterized by its second-largest eigenvalue, even though all the eigenvalues of the nonsymmetric coupling matrix are real. Liu and Chen [14] gave some criteria for the global synchronization of complex networks in virtual of the left eigenvector corresponding to the zero eigenvalue of the coupling matrix. For a given network with identical node dynamics, the authors of [15] showed that two key factors influencing the network synchronizability are the network inner linking matrix and the eigenvalues of the network topological matrix. Some synchronization criteria were given in [16–19] for coupled neural networks with or without delayed couplings. In [20], the robust impulsive synchronization of coupled delayed neural networks with uncertainties is considered; several new criteria are obtained to guarantee the robust synchronization via impulses.Complex networks have the properties of robustness and fragility. A complex network can synchronize itself when parameter mismatch is within some limit. If parameter mismatch exceeds this limit, networks cannot realize synchronization themselves. Thus the controlled synchronization of coupled networks is believed to be a rather significant topic in both theoretical research and practical applications [21–29]. Some effective control scheme has been proposed, for instance, state feedback control with constant control gains, impulsive control, intermittent control, and adaptive control. Adaptive control method receives particular attention of researchers in recently rears. In [3], the authors studied synchronization in complex networks by using distributed adaptive control scheme. By designing a simple adaptive controller, authors of [23] investigated the locally and globally adaptive synchronization of an uncertain complex dynamical network. Authors in [24] investigated synchronization of neural networks with time-varying delays and distributed delays via adaptive control method. By using the adaptive feedback control scheme, Chen and Zhou [25] studied synchronization of complex nondelayed networks and Cao et al. [26] investigated the complete synchronization in an array of linearly stochastically coupled identical networks with delays. By using adaptive pinning control method, Zhou et al. [27] studied local and global synchronization of complex networks without delays, authors of [28, 29] considered the global synchronization of the complex networks with nondelayed and delayed couplings and the authors of [30] investigated lag synchronization of complex networks via state feedback pinning strategy. Outer synchronization of complex delayed networks with uncertain parameters was considered by using adaptive coupling in [31]. However, models in the previous references are special; that is, each of them does not consider general complex networks in which every dynamical node has mixed delays (discrete delay and distributed delay), and the complex networks have nondelayed, discrete-delayed, and distributed-delayed couplings.Complex networks are always affected by some unknown external perturbations due to environmental causes and human causes. White noises brought by some random fluctuations in the course of transmission and other probabilities causes have received extensive attention in the literatures [21, 24, 32–35]. However, not all the external perturbations are white noise, and some of them may be nonlinear and nonstochastic perturbations. When complex networks are disturbed by nonlinear and nonstochastic perturbations, the states of the nodes will be changed dramatically, which will affect the stability and synchronization of the complex networks. Due to the fragility of complex networks, if some important nodes are perturbed by such external perturbations, whole states of the network will be affected or even the network cannot operate normally. Hence, how to realize synchronization of all nodes for complex networks with uncertain nonlinear nonstochastic external perturbations is an urgent practical problem to be solved. Obviously, the controllers for stability and synchronization of stochastic perturbations are not applicable to the case of nonlinear nonstochastic perturbations, especially when the functions and bounds of the perturbations are unknown. Therefore, to enhance antiperturbations capability and to realize synchronization of complex networks, more effective controller should be designed.Motivated by the previous analysis, in this paper, a class of more general complex networks is proposed. The new model has nondelayed, discrete-delayed, and distributed-delayed couplings, and every dynamical node has mixed delays. Unknown nonstochastic external perturbations to the complex networks are also considered. Then we study the global complete synchronization of the proposed model. A new simple but robust adaptive controller is designed to overcome the effects of such perturbations and synchronize the complex networks even without knowing the exact functions and bounds of the perturbations. Moreover, the adaptive controller can also synchronize coupled systems with stochastic perturbations since it includes existing adaptive controller as special case. Two cases are considered: all nodes or partial nodes are perturbed. All nodes should be controlled for the former case. Pinning control scheme can also be used for the latter case. Based on Lyapunov stability theory, integral inequality, Barbalat lemma, and Schur Complement lemma, rigorous proofs are given for synchronization of the complex networks with unknown perturbations of the previous two cases. It should be noted that our new adaptive controllers can also prevent external perturbations. Therefore, the new adaptive controllers are better than those in [23–29]. Numerical simulations verify the effectiveness of our theoretical results.Notations. In the sequel, if not explicitly stated, matrices are assumed to have compatible dimensions. IN denotes the identity matrix of N dimension. The Euclidean norm in ℝn is denoted as ∥·∥; accordingly, for vector x∈ℝn, ∥x∥=xTx, where T denotes transposition. A=(aij)m×m denotes a matrix of m dimension, ∥A∥=λmax(ATA), and As=(1/2)(A+AT). A>0 or A<0 denotes that the matrix A is symmetric and positive or negative definite matrix. λmin(As) is the minimum eigenvalues of the symmetric matrices As, and Al denotes the matrix of the first l row-column pairs of A. Alc denotes the minor matrix of matrix A by removing all the first l row-column elements of A.The rest of this paper is organized as follows. In Section2, a class of general complex networks with mixed delays and external perturbations is proposed. Some necessary assumptions and lemmas are also given in this section. In Section 3, synchronization of the complex networks with all nodes perturbed is studied. Synchronization with only partial nodes perturbed is considered in Section 4. Then, in Section 5, numerical simulations are given to show the effectiveness of our results. Finally, in Section 6, conclusions are given.


## 2. Preliminaries

The general complex networks consisting ofN identical nodes with external perturbations and mixed-delay couplings are described as
(1)x˙i(t)=Cxi(t)+Af(xi(t))+Bf(xi(t-τ(t)))+D∫t-θ(t)t‍f(xi(s))ds+I(t)+α∑j=1N‍uijΦxj(t)+β∑j=1N‍vijΥxj(t-τ(t))+γ∑j=1N‍wijΛ∫t-θ(t)t‍xj(s)ds+σi(t,xi(t),xi(t-τ(t)),∫t-θ(t)t‍xi(s)ds)+Ri,i=0,1,…,N,
where xi(t)=[xi1(t),…,xin(t)]T∈ℝn represents the state vector of the ith node of the network at time t, and C,A,B,D are matrices with proper dimension. f(·) is a continuous vector function. I(t) is the external input vector. Ri∈ℝn is the control input. τ(t)>0, θ(t)>0 are time-varying discrete delay and distributed delay, respectively. Constants α>0, β>0, γ>0 are coupling strengths of the whole network corresponding to nondelay, discrete delay, and distributed delay, respectively. Φ,Υ,Λ∈ℝn×n are inner coupling matrices of the networks, which describe the individual coupling between two subsystems. Matrices U=(uij)N×N, V=(vij)N×N, W=(wij)N×N are outer couplings of the whole networks satisfying the following diffusive conditions:
(2)uij≥0(i≠j),uii=-∑j=1,j≠iN‍uij,vij≥0(i≠j),vii=-∑j=1,j≠iN‍uij,wij≥0(i≠j),wii=-∑j=1,j≠iN‍wij,
where i,j=1,2,…,N. Vector σi(t,xi(t),xi(t-τ(t)),∫t-θ(t)t‍xi(s)ds)∈ℝn describes the unknown perturbation to ith node of the complex networks. In this paper, we always assume that τ˙≤hτ<1 and θ˙≤hθ<1. θ(t) is bounded and we denote θmin>0 the minimum of θ(t) and θmax the maximum of θ(t).We assume that (1) has a unique continuous solution for any initial condition in the following form:
(3)xi(s)=φi(s),-ϱ≤s≤0,i=0,1,2,…,N,
where ϱ=max{τmax,σmax} and τmax is the maximum of τ(t).For convenience of writing, in the sequel, we denoteσi(t,xi(t),xi(t-τ(t)),∫t-θ(t)t‍xj(s)ds) with σi(t).The system of an isolate node without external perturbation is described as(4)z˙(t)=Cz(t)+Af(z(t))+Bf(z(t-τ(t)))+D∫t-θ(t)t‍f(z(s))ds+I(t),andz(t) can be any desired state: equilibrium point, a nontrivial periodic orbit, or even a chaotic orbit.Remark 1.
The nonstochastic perturbationsσi(t,xi(t),xi(t-τ(t)),∫t-θ(t)t‍xi(s)ds) are different from stochastic ones in the literature [21, 24, 32–35]. The distinct feature of the such stochastic perturbations is that the stochastic perturbations disappear when the synchronization goal is realized. However, perturbations of this paper still exist even when complete synchronization has been achieved. Therefore, the controllers in most of existing papers including those in [21, 24, 32–35] are invalid for perturbations of this paper.When system (4) is perturbed, then (4) turns to the following system:
(5)z-˙(t)=Cz-(t)+Af(z-(t))+Bf(z-(t-τ(t)))+D∫t-θ(t)t‍f(z-(s))ds+I(t)+σi(t,z-(t),z-(t-τ(t)),∫t-θ(t)t‍z-(s)ds).Generally, the state of a system will be changed when the system is perturbed. We assume that the state of system (5) remains to be any one of the previous three states but not necessarily the original one.The following assumptions are needed in this paper:(H1)
f(0)≡0, and there exists positive constant h such that
(6)∥f(u)-f(v)∥≤h∥u-v∥,foranyu,v∈ℝn,(H2)
σik(t,0,0,0)≡0, and there exist positive constants Mik such that |σik(t,u,v,w)|≤Mik for any bounded u,v,w∈ℝn,i=1,2,…,N,k=1,2,…,n.Remark 2.
Note that (4) unifies many well-known chaotic systems with or without delays, such as Chua system, Lorenz system, Rössler system, Chen system, and chaotic neural networks with mixed delays [12–29]. Hence, results of this paper are general.Remark 3.
Condition (H2) is very mild. We do not impose the usual conditions such as Lipschitz condition, differentiability on the external perturbation functions. It can be discontinuous or even impulsive functions. If the state of (5) is a equilibrium point or a nontrivial periodic orbit, the condition (H2) can be easily satisfied. If the state of (5) is a chaotic orbit, the condition (H2) can also be satisfied. Since chaotic system has strange attractors, there exists a bounded region containing all attractors of it such that every orbit of the system never leaves them. Anyway, condition (H2) can be satisfied for equilibrium point, a nontrivial periodic orbit, and a chaotic orbit. Moreover, we will subsequently prove that the complex networks (1) can be synchronized even without knowing the exact values of h and Mik, i=1,2,…,N,k=1,2,…,n.The aim of this paper is to synchronize all the states of complex networks (1) to the following manifold:
(7)x1(t)=x2(t)=⋯=xN(t)=z(t),
where z(t) is immune to external perturbations.Lemma 4 ((Schur Complement) see [36]).
The linear matrix inequality (LMI)(8)S=[S11S12S12TS22]<0
is equivalent to any one of the following two conditions:(L1)
S11<0,S22-S12TS11-1S12<0,(L2)
S22<0,S11-S12S22-1S12T<0,where S11=S11T, S22=S22T.Lemma 5 (see [37]).
For any constant matrixD∈ℝn×n, DT=D>0, scalar σ>0, and vector function ω:[0,σ]→ℝn, one has
(9)σ∫0σ‍ωT(s)Dω(s)ds≥(∫0σ‍ω(s)ds)TD∫0σ‍ω(s)ds
provided that the integrals are all well defined.Lemma 6 ((Barbalat lemma) see [38]).
Iff(t):ℝ→ℝ+ is a uniformly continuous function for t≥0 and if the limit of the integral
(10)limt→∞∫0t‍f(s)ds
exists and is finite, then limt→∞f(t)=0.


## 3. Synchronization with All the Nodes Perturbed

In this section, we consider the case when all the nodes are perturbed. To realize synchronization goal (7), we have to introduce an isolate node (4).Letei(t)=xi(t)-z(t). Subtracting (4) from (1), we get the following error dynamical system:
(11)e˙i(t)=Cei(t)+Ag(ei(t))+Bg(ei(t-τ(t)))+D∫t-θ(t)t‍g(ei(s))ds+α∑j=1N‍uijΦej(t)+β∑j=1N‍vijΥej(t-τ(t))+σi(t)+Ri+γ∑j=1N‍wijΛ∫t-θ(t)t‍ej(s)ds,
where g(ei)=f(xi(t))-f(z(t)),i=1,2,…,N.From(H1) and (H2) we know that (11) admits a trivial solution ei(0)≡0,i=1,2,…,N. Obviously, to reach the goal (7), we have only to prove that system (11) is asymptotically stable at the origin.Theorem 7.
Under the assumption conditions(H1) and (H2), the networks (1) are synchronized with the following adaptive controllers:
(12)Ri=-αεiei(t)-ωβisign(ei(t)),ε˙i=piei(t)Tei(t),β˙i=ξi∑k=1n|eik(t)|,
where ω>1, pi>0, and ξi>0 are arbitrary constants, respectively, i=1,2,…,N.Proof.
Define the Lyapunov function as(13)V(t)=V1(t)+V2(t)+V3(t),
where
(14)V1(t)=12∑i=1N‍eiT(t)ei(t)V1(t)=+12∑i=1N‍α(εi-ki)2pi+12∑i=1N‍(Mi-βi)2ξi,V2(t)=∫t-τ(t)t‍ηT(s)Qη(s)ds,V3(t)=∫t-θ(t)t‍∫μt‍ηT(s)Gη(s)dsdμ,
η
(
t
)
=
(
∥
e
1
(
t
)
∥
,
∥
e
2
(
t
)
∥
,
…
,
∥
e
N
(
t
)
∥
)
T, Mi=max1≤k≤n{Mik}, ki,i=1,2,…,N, are constants, Q and G are symmetric positive definite matrices, and ki, Q, and G are to be determined.
DifferentiatingV1(t) along the solution of (11) and from (H1) and (H2), we obtain
(15)V˙1(t)=∑i=1N‍eiT(t)e˙i(t)+α∑i=1N‍(εi-ki)eiT(t)ei(t)-∑i=1N‍(Mi-βi)∑k=1n‍|eik(t)|≤∑i=1N‍[∑j=1N‍(∥C∥+∥A∥h-αki)∥ei(t)∥2+∥B∥h∥ei(t)∥∥ei(t-τ(t))∥+∥D∥h∥ei(t)∥∫t-θ(t)t‍∥ei(s)∥ds+α∑j=1,j≠iN‍uij∥Φ∥∥ei(t)∥∥ej(t)∥+αλmin(Φs)uii∥ei(t)∥2+β∑j=1N‍|vij|∥Υ∥∥ei(t)∥∥ej(t-τ(t))∥+γ∑j=1N‍|wij|∥Λ∥∥ei(t)∥∫t-θ(t)t‍∥ej(s)∥ds]=ηT(t)((∥C∥+∥A∥h)IN+α(∥Φ∥U^s-K))η(t)+ηT(t)(∥B∥hIN+β∥Υ∥|V|)η(t-τ(t))+ηT(t)(∥D∥hIN+γ∥Λ∥|W|)∫t-θ(t)t‍η(s)ds≤ηT(t)((∥Φ∥U^s-K)(∥C∥+∥A∥h+1)IN+α(∥Φ∥U^s-K))η(t)+ηT(t-τ(t))B¯TB¯η(t-τ(t))+(∫t-θ(t)t‍η(s)ds)TD¯TD¯∫t-θ(t)t‍η(s)ds,
where K=diag(k1,k2,…,kN), U^=(u^ij)N×N, u^ij=uij, i≠j,  u^ii=(λmin(Φs)/∥Φ∥)uii, B¯=∥B∥hIN+β∥Υ∥|V|, D¯=∥D∥hIN+γ∥Λ∥|W|, |V|=(|vij|)N×N, |W|=(|wij|)N×N, and we have used the following deduction:
(16)∑i=1N‍[eiT(t)σi(t)-ω∑k=1n‍βi|eik(t)|-∑k=1n‍(Mi-βi)|eik(t)|]≤∑i=1N‍∑k=1n‍[|eik(t)|Mik-Mi|eik|-(ω-1)βi|eik|]≤-∑i=1N‍∑k=1n‍(ω-1)βi|eik|≤0.
DifferentiatingV2(t), we get
(17)V˙2(t)=ηT(t)Qη(t)-(1-τ˙(t))ηT(t-τ(t))Qη(t-τ(t))≤ηT(t)Qη(t)-(1-hτ)ηT(t-τ(t))Qη(t-τ(t)).
DifferentiatingV3(t) from Lemma 5 we have
(18)V˙3(t)=θ(t)ηT(t)Gη(t)-(1-θ˙(t))∫t-θ(t)t‍ηT(s)Gη(s)ds≤θmaxηT(t)Gη(t)-1-hθθmin(∫t-θ(t)t‍η(s)ds)TG∫t-θ(t)t‍η(s)ds.
TakeQ=(1/(1-hτ))B¯TB¯, G=(θmin/(1-hθ))D¯TD¯. From the definition of V(t) we reach the following inequality:
(19)V˙(t)≤αηT(t)[θminθmaxα(1-hθ)1α(∥C∥+∥A∥h+1)IN+∥Φ∥U^s+1α(1-hτ)B¯TB¯+θminθmaxα(1-hθ)D¯TD¯-K]η(t).
Letki=λmax((1/α)(∥C∥+∥A∥h+1)IN+∥Φ∥U^s+(1/α(1-hτ))B¯TB¯+(θminθmax/(α(1-hθ)))D¯TD¯)+1, where λmax((1/α)(∥C∥+∥A∥h+1)IN+∥Φ∥U^s+(1/α(1-hτ))B¯TB¯+(θminθmax/α(1-hθ))D¯TD¯) denotes the maximum eigenvalue of (1/α)(∥C∥+∥A∥h+1)IN+∥Φ∥U^s+(1/α(1-hτ))B¯TB¯+(θminθmax/α(1-hθ))D¯TD¯. Then, from the previous inequality, we get
(20)V˙(t)≤-αηT(t)η(t).
Integrating both sides of the previous equation from 0 tot yields
(21)V(0)≥V(t)+α∑i=1N‍∫0t‍∥ei(s)∥2ds≥α∑i=1N‍∫0t‍∥ei(s)∥2ds.
Therefore,(22)αlimt→∞∑i=1N‍∫0t‍∥ei(s)∥2ds≤V(0).
In view of Lemma6 and the previous inequality, one can easily get
(23)limt→∞∑i=1N‍∥ei(t)∥2=0,
which in turn means(24)limt→∞∥ei(t)∥=0,i=1,2,…,N.
This completes the proof.


## 4. Synchronization with Partial Nodes Perturbed

Usually, only partial nodes of complex networks are perturbed. If some important nodes are perturbed, then the entire network will not work correctly. Theoretically speaking, nodes with larger degree (undirected networks) or larger outdegree (directed networks) are more vulnerable to perturbation [39], since the states of these nodes have more effect on networks than those with smaller degree (undirected networks) or outdegree (directed networks). On the other hand, the real-world complex networks normally have a large number of nodes; it is usually impractical and impossible to control a complex networks by adding the controllers to all nodes. Therefore, from both practical point of view and the view of reducing control cost, we can use the scheme of pinning control [27–29, 40–42] to prevent external perturbations and synchronize complex networks.In this section, we assume that matrixU is irreducible in the sense that there is no isolate cluster in the network and there are l1 nodes affected by external perturbations.Without loss of generality, rearrange the order of the nodes in the network, and take the firstl(l≥l1) nodes to be controlled. Thus, the pinning controlled network can be described as
(25)x˙i(t)=Cxi(t)+Af(xi(t))+Bf(xi(t-τ(t)))+D∫t-θ(t)t‍f(xi(s))ds+α∑j=1N‍uijΦxj(t)+I(t)+β∑j=1N‍vijΥxj(t-τ(t))+γ∑j=1N‍wijΛ∫t-θ(t)t‍xj(s)ds+σi(t)+Ri,i=1,2,…,l1,x˙i(t)=Cxi(t)+Af(xi(t))+Bf(xi(t-τ(t)))+D∫t-θ(t)t‍f(xi(s))ds+α∑j=1N‍uijΦxj(t)+I(t)+β∑j=1N‍vijΥxj(t-τ(t))+γ∑j=1N‍wijΛ∫t-θ(t)t‍xj(s)ds+Ri,i=l1+1,l1+2,…,l,x˙i(t)=Cxi(t)+Af(xi(t))+Bf(xi(t-τ(t)))+D∫t-θ(t)t‍f(xi(s))ds+α∑j=1N‍uijΦxj(t)+I(t)+β∑j=1N‍vijΥxj(t-τ(t))+γ∑j=1N‍wijΛ∫t-θ(t)t‍xj(s)ds,i=l+1,l+2,…,N,
where Ri,i=1,2,…,l, are control inputs.Letei(t)=xi(t)-z(t). Subtracting (4) from (25) we obtain the following error dynamical system:
(26)e˙i(t)=Cei(t)+Ag(ei(t))+Bg(ei(t-τ(t)))e˙i(t)=+D∫t-θ(t)t‍g(ei(s))ds+α∑j=1N‍uijΦej(t)e˙i(t)=+β∑j=1N‍vijΥej(t-τ(t))+γ∑j=1N‍wijΛ∫t-θ(t)t‍ej(s)dse˙i(t)=+σi(t)+Ri,i=1,2,…,l1,e˙i(t)=Cei(t)+Ag(ei(t))+Bg(ei(t-τ(t)))e˙i(t)=+D∫t-θ(t)t‍g(ei(s))ds+α∑j=1N‍uijΦej(t)e˙i(t)=+β∑j=1N‍vijΥej(t-τ(t))+γ∑j=1N‍wijΛ∫t-θ(t)t‍ej(s)dse˙i(t)=+Ri,i=l1+1,l1+2,…,l,e˙i(t)=Cei(t)+Ag(ei(t))+Bg(ei(t-τ(t)))e˙i(t)=+D∫t-θ(t)t‍g(ei(s))ds+α∑j=1N‍uijΦej(t)e˙i(t)=+β∑j=1N‍vijΥej(t-τ(t))+γ∑j=1N‍wijΛ∫t-θ(t)t‍ej(s)ds,i=l+1,l+2,…,N.Similar to Theorem7, to reach the goal (7), we have only to prove that system (26) is asymptotically stable at the origin.Theorem 8.
Suppose that matrixU is irreducible and the assumptions (H1) and (H2) hold. If
(27)2α∥Φ∥(U^s)lc+ΣIN-l<0,
then the complex networks (25) are synchronized with the adaptive pinning controllers
(28)Ri=-αεiei(t)-ωβisign(ei(t)),ε˙i=piei(t)Tei(t),β˙i=ξi∑k=1n‍|eik(t)|,
where i=1,2,…,l,Σ=2(∥C∥+∥A∥h)+((θmaxθmin+1-hθ)/(1-hθ))∥∥D∥hIN+γ∥Λ∥|W|∥+((2-hτ)/(1-hτ))∥∥B∥hIN+β∥Υ∥|V|∥, and the other parameters are the same as those of Theorem 7.Proof.
We define another Lyapunov function as(29)V-(t)=V-1(t)+V2(t)+V3(t),
where
(30)V-1(t)=12∑i=1N‍eiT(t)ei(t)+12∑i=1l‍α(εi-ki)2pi+12∑i=1l1‍(Mi-βi)2ξi,
k
i
,
i
=
1,2
,
…
,
l, are constants to be determined, and V2(t) and V3(t) are defined as those in the proof of Theorem 7.
In view of(H1) and (H2), differentiating V-1(t) along the solution of (26) yields
(31)V-˙1(t)=∑i=1N‍eiT(t)e˙i(t)+α∑i=1l‍(εi-ki)eiT(t)ei(t)-∑i=1l1‍(Mi-βi)∑k=1n‍|eik(t)|≤∑i=1N‍[∫t-θ(t)t‍(∥C∥+∥A∥h)∥ei(t)∥2+∥B∥h∥ei(t)∥∥ei(t-τ(t))∥+∥D∥h∥ei(t)∥∫t-θ(t)t‍∥ei(s)∥ds]-α∑i=1l‍ki∥ei(t)∥2+α∑i=1N‍λminΦsuii∥ei(t)∥2+α∑i=1N‍∑j=1,j≠iN‍uij∥Φ∥∥ei(t)∥∥ej(t)∥+β∑i=1N‍∑j=1N‍|vij|∥Υ∥∥ei(t)∥∥ej(t-τ(t))∥+γ∑i=1N‍∑j=1N‍|wij|∥Λ∥∥ei(t)∥∫t-θ(t)t‍∥ej(s)∥ds=ηT(t)((∥C∥+∥A∥h)IN+α(∥Φ∥U^s-K-))η(t)+ηT(t)(∥B∥hIN+β∥Υ∥|V|)η(t-τ(t))+ηT(t)(∥D∥hIN+γ∥Λ∥|W|)∫t-θ(t)t‍η(s)ds,
where K-=diag(k1,…,kl,0,…,0︸N-l), and the following deduction is used:
(32)∑i=1l1‍eiT(t)σi(t)-ω∑i=1l1‍∑k=1n‍βi|eik(t)|-∑i=1l1‍∑k=1n‍(Mi-βi)|eik(t)|-ω∑i=l1+1l‍∑k=1n‍βi|eik(t)|≤∑i=1l1‍∑k=1n‍[|eik(t)|Mik-Mi|eik|-(ω-1)βi|eik|]-ω∑i=l1+1l‍∑k=1n‍βi|eik(t)|≤-∑i=1l1‍∑k=1n‍(ω-1)βi|eik|-ω∑i=l1+1l‍∑k=1n‍βi|eik(t)|≤0.
Combining (31) with (17) and (25), we have
(33)V-˙(t)≤12ζT(t)Πζ(t),
where ζ(t)=(ηT(t),ηT(t-τ(t)),(∫t-θ(t)t‍η(s)ds)T)T and
(34)Π=[Π11Π12Π13Π12T-2(1-hτ)Q0Π13T0-2(1-hθ)θminG]
withΠ11=2((∥C∥+∥A∥h)IN+α(∥Φ∥U^s-K)+Q+θmaxG), Π12=∥B∥hIN+β∥Υ∥|V|, Π13=∥D∥hIN+γ∥Λ∥|W|.
According to Lemma4, Π<0 is equivalent to
(35)Δ=2((∥C∥+∥A∥h)IN+α(∥Φ∥U^s-K)+Q+θmaxG)+12(1-hτ)(∥B∥hIN+β∥Υ∥|V|)Q-1×(∥B∥hIN+β∥Υ∥|V|T)+θmin2(1-hθ)(∥D∥hIN+γ∥Λ∥|W|)G-1×(∥D∥hIN+γ∥Λ∥|W|T)<0.
LetQ=(1/2(1-hτ))∥∥B∥hIN+β∥Υ∥|V|∥IN, G=(θmin/2(1-hθ))∥∥D∥hIN+γ∥Λ∥|W|∥IN. We have
(36)Δ≤2(∥C∥+∥A∥h)IN+2α(∥Φ∥U^s-K)+θmaxθmin+1-hθ1-hθ∥∥D∥hIN+γ∥Λ∥|W|∥IN+2-hτ1-hτ∥∥B∥hIN+β∥Υ∥|V|∥IN-1=[Δ112α∥Φ∥(U^s)*2α∥Φ∥(U^s)*T2α∥Φ∥(U^s)lc+ΣIN-l],
where Δ11=2α∥Φ∥(U^s)l-2αKl+ΣIl, 2α∥Φ∥(U^s)* is matrix with appropriate dimension.
Since2α∥Φ∥(U^s)lc+ΣIN-l<0 and there exist positive constants k1,k2,…,kl such that
(37)2α∥Φ∥(U^s)l-2αKl+ΣIl-(2α∥Φ∥)2(U^s)*×(2α∥Φ∥(U^s)lc+ΣIN-l(U^s)lc)-1(U^s)*T<0,
again, from Lemma4 we obtain Δ<0. Hence, Π<0. Denote λmin to be the minimum eigenvalue of -Π; then
(38)V-˙(t)≤-λmin∑i=1N‍∥ei(t)∥2≤0.
Integrating both sides of the previous equation from 0 tot yields
(39)V-(0)≥V-(t)+λmin∑i=1N‍∫0t‍∥ei(s)∥2ds≥λmin∑i=1N‍∫0t‍∥ei(s)∥2ds.
Therefore,(40)limt→∞λmin∑i=1N‍∫0t‍∥ei(s)∥2ds≤V-(0).
By Lemma6 we obtain
(41)limt→∞λmin∑i=1N‍∥ei(t)∥2=0,
which in turn means(42)limt→∞∥ei(t)∥=0,i=1,2,…,N.
This completes the proof.When there is no external perturbation, that is,σi(t)=0,i=1,2,…,N, one can easily get the following corollaries from Theorems 7 and 8, respectively. We omit their proofs here.Corollary 9.
Suppose thatσi(t)=0,i=1,2,…,N, and the assumption condition (H1) holds. Then complex networks (1) are synchronized with the adaptive controllers (12). Moreover, the scalar ω can be relaxed to any positive constant.Corollary 10.
Suppose that matrixU is irreducible and the assumption (H1) holds. The complex networks (25) are synchronized with the adaptive pinning controllers (28), if (27) holds. Moreover, the scalar ω can be relaxed to any positive constant.Remark 11.
From the inequalities (16) and (32) one can see that the designed adaptive controllers (12) and (28) are very useful. They can overcome the bad effects of the uncertain nonlinear perturbations without knowing the exact functions and bounds of the perturbations as long as the perturbed systems are chaotic. Especially, when there are only partial nodes perturbed (the first l1 nodes in the system (25)), the designed controllers still are effective to stabilize the error system by adding them to nodes with and without such perturbations, (see the inequality (32)). Obviously, in the case of no perturbation, the parameter ω can also be taken as 0. When ω=0, the controllers (12) and (28) turn out to be the usual adaptive controller, which is extensively utilized to synchronize coupled systems with or without stochastic perturbations [8, 23–34, 40–42]. However, the controllers in [8, 23–34, 40–42] cannot synchronize coupled systems with nonstochastic perturbations. Therefore, the designed controllers can deal with both stochastic and nonstochastic perturbations to the systems, and hence they have better robustness than usual adaptive controllers.Remark 12.
Model (1) can be extended to the following more general complex networks:
(43)x˙i(t)=Cxi(t)+Af(xi(t))+Bfτ(xi(t-τ(t)))+D∫t-θ(t)t‍fθ(xi(s))ds+I(t)+α∑j=1N‍uijΦxj(t)+β∑j=1N‍vijΥxj(t-τ(t))+γ∑j=1N‍wijΛ∫t-θ(t)t‍xj(s)ds+σi(t)+Ri,i=0,1,…,N.
Moreover, we can also consider stochastic perturbations [21] and Markovian jump [43, 44] in (43) to get more general results. For simplicity, we omit the corresponding results and only consider model (1).


## 5. Numerical Examples

In this section, we provide two examples to illustrate the general model and the advantage of the new adaptive controller.Example 13.
The Lorenz system is described as(44)z˙(t)=Cz(t)+Af(z(t)),
where
(45)C=[-1010028-10008/3],A=[000010001],
f
(
z
(
t
)
)
=
(
0
,
-
z
1
(
t
)
z
3
(
t
)
,
z
1
(
t
)
z
2
(
t
)
)
T. When initial values are taken as z1(0)=0.8, z2(0)=2, z3(0)=2.5, chaotic trajectory of (44) can be seen in Figure 1.
The following three perturbed Lorenz systems are chaotic:(46)z-˙(t)=Cz-(t)+Af(z-(t))+σi(t),i=1,2,3,
where σ1(t)=(0.1z-12(t),0.2z-2(t),0.2z-3(t))T, σ2(t)=(0.1z-1(t),0.05z-22(t),sinz-3(t))T, σ3(t)=(0.1z-1(t),cosz-2(t),sinz-3(t))T. Chaotic trajectories of the three perturbed Lorenz systems are showed in Figure 2 with the same initial values z-1(0)=0.8, z-2(0)=2, z-3(0)=2.5.
Now consider the following complex networks with each node as the previous perturbed Lorenz system:(47)x˙i(t)=Cxi(t)+Af(xi(t))+α∑j=1N‍uijΦxj(t)+σi(t)+Ri,i=0,1,3,
where α=0.5,Φ=I3 and
(48)U=[-1101-1011-2].
Obviously, conditions(H1) and (H2) are satisfied. According to Theorem 7, the complex networks (47) can be synchronized with adaptive controllers (12).
The initial conditions of the numerical simulations are as follows:ω=4, step=0.0005, x1(0)=(-2,-1,0)T, x2(0)=(1,2,3)T, x3(0)=(4,5,6)T, εi(0)=1, βi(0)=2, pi=ξi=0.5, i=1,2,3. Figure 3 describes the synchronization errors eij(t)=xij(t)-zj(t), i,j=1,2,3. Figure 4 shows the adaptive feedback gains. Numerical simulations verify the effectiveness of Theorem 7.Figure 1
Chaotic trajectory of (44).Chaotic trajectories of (46) with σ1(t) (a), σ2(t) (b), σ3(t) (c).
(a)
(b)
(c)Synchronization errors of (47): (a) ei1(t), (b) ei2(t), (c) ei3(t),i=1,2,3.
(a)
(b)
(c)The adaptive control gains of (47): (a) the adaptive gains εi,1≤i≤3, (b) the adaptive gains βi,1≤i≤3.
(a)
(b)Example 14.
Consider the following chaotic neural networks with mixed delays:(49)z˙(t)=Cz(t)+Af(z(t))+Bf(z(t-τ(t)))+D∫t-σ(t)t‍f(z(s))ds+I(t),
where z(t)=(z1(t),z2(t))T,τ(t)=1,σ(t)=0.3,f(z(t))=(tanh(z1(t),tanh(z2(t))T,
(50)C=[-1.200-1],A=[3-0.385],I=[02],B=[-1.40.10.3-8],D=[-1.20.1-2.8-1].
In the case that the initial condition is chosen asz1(t)=0.4, z2(t)=0.6, for  all t∈[-1,0], the chaotic attractor can be seen in Figure 5.
The perturbed system of (49) is
(51)z-˙(t)=Cz-(t)+Af(z-(t))+Bf(z-(t-τ(t)))+D∫t-σ(t)t‍f(z-(s))ds+I(t)+σ(t),
where σ(t)=(0.2z-1(t-1),0.2∫t-0.3t‍z-2(s)ds)T. The chaotic attractor of (51) can be seen in Figure 6 with z-1(t)=0.4, z-2(t)=0.6, for  all t∈[-1,0].
Now consider the following complex networks with each node as the previous neural networks with mixed delays (49), while the second node is disturbed with the previous σ(t). 							(52)x˙i(t)=Cxi(t)+Af(xi(t))+Bf(xi(t-τ(t)))+D∫t-θ(t)t‍f(xi(s))ds+I(t)+α∑j=110‍uijΦxj(t)+β∑j=110‍vijΥxj(t-τ(t))+γ∑j=110‍wijΛ∫t-θ(t)t‍xj(s)ds+σi(t)+Ri,i=0,1,…,10,
where α=3, β=γ=1, σ2(t)=σ(t), else σi(t)=0.
Figure7 depicts the WS Small-World networks [2] corresponding to nondelay (a), discrete delay, and distributed delay (b). The corresponding Laplacian matrices are shown as following:
(53)U=[-41100000111-51100001111-41100000011-41100000011-41100000011-41100000011-41100000011-41111000011-40110000010-3],(54)V=W=[-21000100001-21000000001-20000010000-11000000001-30100110000-10000000010-21000000001-21000100001-31000010001-2].
Take the first two nodes (corresponding to matrixU) to be controlled. According Theorem 8, the complex networks (52) can be synchronized with adaptive controllers (27).
The initial conditions of the numerical simulations are as follows:ω=2, step=0.0005, xi(0)=(-11+2i,-10+2i)T,i=1,2,…,10.εi(0)=βi(0)=pi=ξi=1,i=1,2. Figure 8 describes the synchronization errors eij(t)=xij(t)-zj(t),i=1,2,…,10,j=1,2. Figure 9 depicts the adaptive feedback gains. Numerical simulations verify the effectiveness of Theorem 8.Figure 5
Chaotic trajectory of (49).Figure 6
Chaotic trajectory of (51).WS Small-Worlds with 10 nodes. In (a) each node connects 4 nodes, and the rewire probability is 0.2; in (b) each node connects 2 nodes, and the rewire probability is 0.4.
(a)
(b)Synchronization errors of (52): (a) ei1, (b) ei2,1≤i≤10.
(a)
(b)The adaptive pinning control gains of (52): (a) the adaptive pinning control gains εi,i=1,2. (b) The adaptive pinning control gains βi,i=1,2.
(a)
(b)


## 6. Conclusions

External perturbations to networks are unavoidable in practice. On the other hand, many chaotic models have discrete delay and distributed delay. Therefore, in this paper, we introduced a class of hybrid coupled complex networks with mixed delays and unknown nonstochastic external perturbations. A simple robust adaptive controller is designed to synchronize the complex networks even without knowing a priori the bounds and the exact functions of the perturbations. It should be emphasized that we do not assume that the coupling matrix is symmetric or diagonal. The controller can enhance robustness and reduce fragility of complex networks; hence, it has great practical significance. Moreover, we also verify the effectiveness of the theoretical results by numerical simulations.



---

*Source: 625372-2013-03-21.xml*