# Pinning Synchronization of Switched Complex Dynamical Networks

Authors: Liming Du; Feng Qiao; Fengying Wang
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

Network topology and node dynamics play a key role in forming synchronization of complex networks. Unfortunately there is no effective synchronization criterion for pinning synchronization of complex dynamical networks with switching topology. In this paper, pinning synchronization of complex dynamical networks with switching topology is studied. Two basic problems are considered: one is pinning synchronization of switched complex networks under arbitrary switching; the other is pinning synchronization of switched complex networks by design of switching when synchronization cannot achieved by using any individual connection topology alone. For the two problems, common Lyapunov function method and single Lyapunov function method are used respectively, some global synchronization criteria are proposed and the designed switching law is given. Finally, simulation results verify the validity of the results.


---

## Body

## 1. Introduction

A complex dynamical network is a set of coupled nodes interconnected by edges, in which each node is a dynamical system [1, 2]. Undoubtedly, many systems in nature can be described by models of complex networks, such as ecological networks, power grids, wireless communication networks, and World Wide Web. Over the last decade, the analysis and control of dynamical networks have become research focus in many fields, such as mathematics, physics, biology, and engineering.Synchronization, the most important collective behavior of complex dynamical networks, has received much of the focus [3–5]. The synchronization of complex dynamical networks has been extensively investigated and many synchronization criteria for complex networks have been proposed, such as the master stability function based criteria [6], Lyapunov function based criteria [7, 8], and graph stability method based criteria [9].As we know now, some complex network can be synchronized by itself, but the general case is that the whole network cannot synchronize by itself; from the perspective of control theory, designing controllers is an effective method, and one natural idea is to assign controllers to all nodes of the controlled complex dynamical network [10–12].However, complex networks in the real world normally have a large number of nodes. Therefore, it is usually difficult to control a complex network by adding the controllers to all nodes. To reduce the number of the controllers, a natural approach is to control a complex network by pinning part of nodes. This idea is actually adding the controllers to a small fraction of network nodes to achieve synchronization of the whole complex networks. In [13], Grigoriev et al. investigated the pinning control of spatiotemporal chaos. Subsequently, Parekh et al. studied the local and global control in coupled map lattices [14]. In [15, 16], Wang and Chen considered the problem of pinning a complex dynamical network to its equilibrium, and both specific and random pinning strategies were proposed. In [17], the controllability of a coupled complex network via pinning has been studied by means of a Master Stability Function approach. In [18], Chen et al. pointed out that a general complex network can be pinned by a single controller if the coupling strength is large enough. A network under a typical framework can realize synchronization subject to any linear feedback pinning scheme and the relationship between coupling strength and the number of pinning nodes for a general complex dynamical network through adaptive pinning [19, 20].Note that most investigations about synchronization of complex networks under pinning control are with the constant connection topology. Actually, constant connection is only a special case. It is well known that the interaction of two different nodes in the real world networks always evolves with time continuously, and the interaction between different nodes may change abruptly at some time instants, which results in switching topology, such as mobile agents [21] and power grids [22].The switched system theory provides an effective tool for studying complex networks with switching topology [23]. By using the common Lyapunov function method, the synchronization problem for complex dynamical networks with switching topology has been studied in [24]. In [25], the synchronization of switched complex dynamical networks was discussed from the view point of switched systems, under the assumptions that all the connection outer matrices are simultaneous triangularization, and several synchronization criteria have been established by means of constructing a common Lyapunov function and single Lyapunov and multiple Lyapunov functions, respectively. In [26], the synchronization problem was studied with switched coupling using the average dwell time method. A synchronization criterion for dynamical networks with nonidentical nodes and switching topology was given in [27]. However, to our knowledge, so far, none of the results of pinning synchronization of complex networks with switching topology have been reported. Motivated by the above discussions, in this paper, the pinning synchronization of complex dynamical networks is investigated with switching topology. First, we study the problem of pinning synchronization of switched complex network under arbitrary switching. Second, when pinning synchronization is impossible for each individual connection topology, the problem of synchronization via the design of switching signal of pregiven connection topology is studied. By using common Lyapunov function method and single Lyapunov function method, respectively, we design controllers and the switching laws to ensure the pinning synchronization. Without assuming that the coupling matrix is symmetric, we give some criteria for the global pinning synchronization of complex networks with switching topology.The remainder of the paper is organized as follows. Some preliminaries are described in Section2. Pinning synchronization criteria for arbitrary switching are derived in Section 3. In Section 4, pinning synchronization via design of switching is studied. In Section 5, several numerical examples are given. Conclusions are drawn in Section 6.


## 2. Preliminaries

Now consider a switched complex dynamical network withN identical nodes; the mathematics model of the system can be described as follows:(1)
x
˙
i
=
f
x
i
+
c
∑
j
=
1
N
a
i
j
σ
t
Γ
x
j
,
i
=
1,2
,
…
,
N
,where x
i
=
(
x
i
1
,
x
i
2
,
…
,
x
i
n
)
T
∈
R
n is the state vector of the ith node, Γ is the inner-coupling matrix between two connected nodes, f is a continuously differentiable vector function, c is the coupling strength, σ
:
[
0
,
∞
)
→
M
=
{
1,2
,
…
,
m
}, for each k
∈
M, A
k
=
{
a
i
j
k
}
∈
R
N
×
N is the outer-coupling matrix, assume a
i
i
k
=
∑
j
=
1
,
j
≠
i
N
a
i
j
k, and let s
(
t
) be a solution of each isolated node; that is, s
˙
(
t
)
=
f
(
s
(
t
)
).Normally, a complex dynamical network has a large number of nodes, so it is difficult to add the controllers to all nodes. By pinning control methods, the controllers are to be added to part of nodes, and the other nodes need not be controlled; without loss of generality, let the firstl nodes be controlled; then (1) can be expressed as (2)
x
˙
i
=
f
x
i
+
c
∑
j
=
1
N
a
i
j
σ
t
Γ
x
j
+
u
i
σ
t
,
i
=
1,2
,
…
,
l
,
x
˙
i
=
f
x
i
+
c
∑
j
=
1
N
a
i
j
σ
t
Γ
x
j
,
i
=
l
+
1
,
l
+
2
,
…
,
N
,where u
i
k are the given controller, which can be described as(3)
u
i
k
=
-
c
q
i
k
Γ
x
i
-
s
,
i
=
1,2
,
…
,
l
,
q
i
k
>
0
.It is easy to see that the systems (2) are pinned to synchronization if l
i
m
t
→
∞
x
i
(
t
)
-
s
(
t
)
=
0. Next, define e
i
=
x
i
-
s; then the error system can be described as(4)
e
˙
i
=
f
x
i
-
f
s
+
c
∑
j
=
1
N
a
i
j
σ
t
Γ
e
j
-
c
q
i
σ
t
Γ
e
i
,
i
=
1,2
,
…
,
l
,
e
˙
i
=
f
x
i
-
f
s
+
c
∑
j
=
1
N
a
i
j
σ
t
Γ
e
j
,
i
=
l
+
1
,
l
+
2
,
…
,
N
,and it should be noted that only the first l nodes have controllers, so the last term of the second line of (4) is zero. Now, the synchronization problem of system (2) turns into the stability of system (4); throughout this paper, we need the following assumption.Assumption 1.
Assume that there is a positive defined matrixP and a constant matrix K, such that f satisfies the following inequality:(5)
x
-
y
T
P
f
x
-
f
y
≤
x
-
y
T
K
Γ
x
-
y
,
∀
x
,
y
∈
R
n
.Note that Assumption1 is very mild; many systems satisfy this condition, such as Lorenz system, Liu system, and Chen system. In the following section, we will investigate the problems of pinning synchronization by common Lyapunov function method and single Lyapunov function method, respectively.


## 3. Arbitrary Switching

In this section, we study the pinning synchronization of complex dynamical networks under arbitrary switching topology. A network with switching topology may not realize synchronization by pinning controller, even if pinning synchronization is achieved by using each individual connection topology alone. Therefore, seeking for pinning synchronization criteria for arbitrary switching topology is not trivial. By using common Lyapunov function method, a criterion is derived to ensure the global synchronization under arbitrary switching.Theorem 2.
Suppose that Assumption1 holds, the pinning controlled complex dynamical system in (2) achieves global synchronization under arbitrary switching if there exist a positive definite matrix P such that the condition (6)
I
N
⊗
K
Γ
+
c
A
k
-
Q
k
⊗
P
Γ
<
0
,
k
=
1,2
,
…
,
m
,holds, where ⊗ is Kronecker product, I
N is an N-dimensional identity matrix, and Q
k
=
d
i
a
g
{
q
1
k
,
q
2
k
,
…
,
q
l
k
,
0
,
…
,
0
}
∈
R
N
×
N.Proof.
Construct the common Lyapunov function as the form of(7)
V
t
=
1
2
∑
i
=
1
N
e
i
T
P
e
i
.The derivative of V
(
t
) along the trajectories of each subsystem of (4) gives(8)
V
˙
t
=
∑
i
=
1
N
e
i
T
P
e
˙
i
=
∑
i
=
1
N
e
i
T
P
f
x
i
-
f
s
+
c
∑
j
=
1
N
a
i
j
k
Γ
e
i
-
c
∑
i
=
1
l
q
i
k
e
i
T
P
Γ
e
i
≤
∑
i
=
1
N
e
i
T
K
Γ
e
i
+
c
P
∑
j
=
1
N
a
i
j
k
Γ
e
i
-
c
∑
i
=
1
l
q
i
k
e
i
T
P
Γ
e
i
=
e
T
I
N
⊗
K
Γ
+
c
I
N
⊗
P
A
k
⊗
Γ
-
c
Q
k
⊗
P
Γ
e
=
e
T
I
N
⊗
K
Γ
+
c
A
k
⊗
P
Γ
-
c
Q
k
⊗
P
Γ
e
,where e
=
(
e
1
T
,
e
2
T
,
…
,
e
N
T
)
T. From (6), it is easy to see that (9)
V
˙
t
<
0
,the switched complex network in (2) achieves global synchronization with the pinning controller (3) under arbitrary switching, which completes the proof.Remark 3.
For the special case is thatP
=
I and let the network has only one connection topology; then the synchronization condition (6) degenerates into(10)
I
N
⊗
K
Γ
+
c
A
-
Q
⊗
Γ
<
0
,which is expressed in [20].Remark 4.
IfΓ is a positive definite matrix and P is replaced with I, then the conditions (6) in Theorem 2 can be simplified as (11)
θ
I
N
+
c
A
k
-
Q
k
<
0
,
k
=
1,2
,
…
,
m
,where θ
=
K.


## 4. Switching Design

In this section, we will study the case that none of subnetworks can bring pinning synchronization if each individual connection topology is put in use alone. So pinning synchronization of switched networks under arbitrary switching is impossible to be achieved for this case. But pinning synchronization may still be achieved by switching between connection topologies, so we discuss how to realize synchronization by the suitable design of switching ruler between connection topologies and give a convex combination based method.LetA
-
=
∑
k
=
1
m
ε
k
A
k with ε
k
≥
0 and ∑
k
=
1
m
ε
k
=
1; then the convex combination of system (2) and the convex combination of error system (3) can be described as (12)
x
˙
i
=
f
x
i
+
c
∑
j
=
1
N
a
-
i
j
Γ
x
j
+
u
-
i
,
i
=
1,2
,
…
,
l
,
x
˙
i
=
f
x
i
+
c
∑
j
=
1
N
a
-
i
j
Γ
x
j
,
i
=
l
+
1
,
l
+
2
,
…
,
N
,
(13)
e
˙
i
=
f
x
i
-
f
s
+
c
∑
j
=
1
N
a
-
i
j
Γ
e
j
-
c
q
-
i
Γ
e
i
,
i
=
1,2
,
…
,
l
,
e
˙
i
=
f
x
i
-
f
s
+
c
∑
j
=
1
N
a
-
i
j
Γ
e
j
,
i
=
l
+
1
,
l
+
2
,
…
,
N
,where a
-
i
j
=
∑
k
=
1
m
ε
k
a
i
j, u
-
i
=
∑
k
=
1
m
ε
k
u
i, q
-
i
=
∑
k
=
1
m
ε
k
q
i, and ∑
k
=
1
m
ε
k
=
1.Theorem 5.
Suppose that Assumption1 holds, and there exist a positive definite matrix P, and some convex combination coefficients ε
i, which satisfies the following condition:(14)
I
N
⊗
K
Γ
+
c
∑
k
=
1
m
ε
k
A
k
-
Q
k
⊗
P
Γ
<
0
,
k
=
1,2
,
…
,
m
,
∑
k
=
1
m
ε
k
=
1
,where ⊗ is Kronecker product, I
N is an N-dimensional identity matrix, and Q
k
=
d
i
a
g
{
q
1
k
,
q
2
k
,
…
,
q
l
k
,
0
,
…
,
0
}
∈
R
N
×
N; then the controlled complex dynamical system in (13) achieves global pinning synchronization under the following switching laws:(15)
σ
t
=
i
i
f
σ
t
-
=
i
,
e
∈
Ω
i
t
,
σ
t
=
j
i
f
σ
t
-
=
i
,
e
∈
∂
Ω
i
t
∩
Ω
j
t
,with(16)
Ω
i
t
=
e
∣
e
T
I
N
⊗
K
Γ
+
c
A
i
⊗
P
Γ
-
c
Q
i
⊗
P
Γ
e
<
0
,
Ω
j
t
=
e
∣
e
T
I
N
⊗
K
Γ
+
c
A
j
⊗
P
Γ
-
c
Q
j
⊗
P
Γ
e
<
0
,
∂
Ω
i
t
=
e
∣
e
T
I
N
⊗
K
Γ
+
c
A
i
⊗
P
Γ
-
c
Q
i
⊗
P
Γ
e
=
0
,where i
,
j
∈
{
1,2
,
…
,
m
}.Proof.
Construct the Lyapunov function as the form of(17)
V
t
=
1
2
∑
i
=
1
N
e
i
T
P
e
i
.The derivative of V
(
t
) along the trajectories of system (12) gives(18)
V
˙
t
=
∑
i
=
1
N
e
i
T
P
e
˙
i
=
∑
i
=
1
N
e
i
T
P
f
x
i
-
f
s
+
c
∑
j
=
1
N
a
-
i
j
Γ
e
i
-
c
∑
i
=
1
l
q
-
i
e
i
T
P
Γ
e
i
≤
∑
i
=
1
N
e
i
T
K
Γ
e
i
+
c
P
∑
j
=
1
N
a
-
i
j
Γ
e
i
-
c
∑
i
=
1
l
q
-
i
e
i
T
P
Γ
e
i
=
e
T
I
N
⊗
K
Γ
+
c
I
N
⊗
P
A
-
⊗
Γ
-
c
Q
-
⊗
P
Γ
e
=
e
T
I
N
⊗
K
Γ
+
c
A
-
⊗
P
Γ
-
c
Q
-
⊗
P
Γ
e
,where e
=
(
e
1
T
,
e
2
T
,
…
,
e
N
T
)
T, A
-
=
∑
k
=
1
m
ε
k
A
k, and Q
-
=
∑
k
=
1
m
ε
k
Q
k. If the condition in (14) is satisfied, then the sets Ω
i
(
t
) in (16) will make a partition of R
N
n by the convex combination technique [23]; that is, ∪
i
=
1
m
Ω
i
=
R
N
n. According to the switching laws (16), if the kth subsystem is activated, then the kth subsystem is described as(19)
e
˙
i
=
f
x
i
-
f
s
+
c
∑
j
=
1
N
a
i
j
k
Γ
x
j
-
c
q
i
k
Γ
e
i
,
i
=
1,2
,
…
,
l
,
e
˙
i
=
f
x
i
-
f
s
+
c
∑
j
=
1
N
a
i
j
k
Γ
x
j
,
i
=
l
+
1
,
l
+
2
,
…
,
N
.The derivative of V
(
t
) along the trajectories of system (19) is(20)
V
˙
t
=
∑
i
=
1
N
e
i
T
P
e
˙
i
=
∑
i
=
1
N
e
i
T
P
f
x
i
-
f
s
+
c
∑
j
=
1
N
a
i
j
k
Γ
e
i
-
c
∑
i
=
1
l
q
i
k
e
i
T
P
Γ
e
i
≤
∑
i
=
1
N
e
i
T
K
Γ
e
i
+
c
P
∑
j
=
1
N
a
i
j
k
Γ
e
i
-
c
∑
i
=
1
l
q
i
k
e
i
T
P
Γ
e
i
=
e
T
I
N
⊗
K
Γ
+
c
I
N
⊗
P
A
k
⊗
Γ
-
c
Q
k
⊗
P
Γ
e
=
e
T
I
N
⊗
K
Γ
+
c
A
k
⊗
P
Γ
-
c
Q
k
⊗
P
Γ
e
<
0
.From single Lyapunov function method [23], the complex networks in (2) achieve global pinning synchronization under the switching law (15), which completes the proof.Remark 6.
Similar to Remark4, if Γ is a positive definite matrix and P is replaced with I, then the conditions (14) in Theorem 5 can be simplified as (21)
θ
I
N
+
c
∑
k
=
1
m
ε
k
A
k
-
Q
k
<
0
,
∑
k
=
1
m
ε
k
=
1
,where θ
=
K.Remark 7.
Although (7) and (17) are the same expression, these equations have different meanings. Equation (7) has been used as common Lyapunov function, which needs V
˙
(
t
)
<
0 for all the subnetworks. It means that each pinning controlled subnetwork can achieve synchronization. However, (17) has been used as single Lyapunov function, compared with common Lyapunov function; it only needs V
˙
(
t
)
<
0 for the time period when the subnetwork is activated; it is easy to see that single Lyapunov function method can deal with more general case of switched complex networks.Remark 8.
Compared with [25], there are three distinct features. First of all, we investigated the pinning synchronization problems of switched complex networks, including pinning controller and switching laws design, however, [25] only considering the synchronization problems of complex networks from the switched system point of view, and it does not deal with the design of controller. So far, no synchronization criteria have been reported for dynamical networks with switching topology via pinning controller, so the research topic is significant. Secondly, the assumptions in the two papers are different. The results of [25] are under the assumptions that all the connection outer matrices are simultaneous triangularization, and these assumptions are not easily satisfied. Compared with it, this paper does not need these assumptions. Therefore, the results of this paper cover more general cases of the dynamical networks in the real world. Thirdly, compared with [25], the result of this paper is more simpler and is easy to be verified, which is conducive to engineering applications.


## 5. Examples

In this section, two simple examples are used to explain the effectiveness of the proposed network synchronization criteria.Example 1.
Consider the network(22)
x
˙
i
=
f
x
i
+
c
∑
j
=
1
N
a
i
j
k
Γ
x
j
+
u
i
k
,
i
=
1,2
,
…
,
l
,
k
=
1,2
x
˙
i
=
f
x
i
+
c
∑
j
=
1
N
a
i
j
k
Γ
x
j
,
i
=
l
+
1
,
l
+
2
,
…
,
N
,
k
=
1,2
,where(23)
f
x
i
=
x
˙
i
1
=
10
x
i
2
-
x
i
1
,
x
˙
i
2
=
40
x
i
1
-
25
x
i
1
x
i
3
,
x
˙
i
3
=
-
x
i
3
+
4
x
i
1
2
.Let T
=
d
i
a
g
(
1,2
,
1
), c
=
6; herein we assume that the network structure of (21) obeys the scale-free distribution of the BA model [27]; the first subsystem’s parameters are given by N
=
30, m
0
=
m
=
3, and the second subsystem’s parameters are given by N
=
30, m
0
=
m
=
5, and, without loss of generality, the pinning controllers are added to the first node. Let q
1
1
=
q
1
2
=
20; the conditions of Theorem 2 are satisfied. The states of error e
i
(
i
=
1,2
,
…
,
30
) are illustrated in Figures 1, 2, and 3 with switching signal in Figure 4, which show that the controlled network is globally asymptotically stable under arbitrary switching by the pinning controller (3).Figure 1
The synchronization errorse
i
1 of complex dynamical system (22).Figure 2
The synchronization errorse
i
2 of complex dynamical system (22).Figure 3
The synchronization errorse
i
3 of complex dynamical system (22).Figure 4
The switching signal of system (22).Example 2.
Letf and Γ be the same as (21), and the pinning controllers are added to the first node. The outer-coupling matrices A
1 and A
2 are pregiven; let q
1
1
=
q
1
2
=
90; then the states of error e
i
(
i
=
1,2
,
…
,
30
) are illustrated in Figures 5, 6, 7, 8, 9, and 10.Figure 5
The synchronization errorse
i
1 of the subnetwork 1 of Example 2.Figure 6
The synchronization errorse
i
2 of the subnetwork 1 of Example 2.Figure 7
The synchronization errorse
i
3 of the subnetwork 1 in Example 2.Figure 8
The synchronization errorse
i
1 of the subnetwork 2 of Example 2.Figure 9
The synchronization errorse
i
2 of the subnetwork 2 of Example 2.Figure 10
The synchronization errorse
i
3 of the subnetwork 2 of Example 2.From Figures5 to 10, it is easy to see that two pinning controlled subnetworks cannot achieve synchronization. Applying Theorem 5, we can get synchronization via the designed switching law:(24)
σ
t
=
1
,
i
f
e
T
θ
I
30
⊗
Γ
+
c
A
1
⊗
P
Γ

-

c
Q
1
⊗
P
Γ
e

≤

0
,
2
,
i
f
e
T
θ
I
30
⊗
Γ
+
c
A
2
⊗
P
Γ

-

c
Q
2
⊗
P
Γ
e

≤

0
.The simulations are shown in Figures11, 12, 13, and 14.Figure 11
The synchronization errorse
i
1 of the switched networks in Example 2.Figure 12
The synchronization errorse
i
2 of the switched networks in Example 2.Figure 13
The synchronization errorse
i
3 of the switched networks in Example 2.Figure 14
Switching signal of Example2.Form Figures11 to 13, it is easy to see that the states of error systems are very large at the initial time, but after a while, it converges to zero quickly, so the switched complex networks achieved synchronization under the designed switching laws, which verify the validity of Theorem 5. In Figure 14, the value of σ
(
t
) denotes the activated subsystem; it means that if σ
(
t
)
=
1, the first subnetwork is activated, and if σ
(
t
)
=
2, the second subnetwork is activated.


## 6. Conclusion

The pining synchronization problem of a complex network with switching topology is investigated in this paper. Employing common Lyapunov function method and single Lyapunov function method, some criteria are given to ensure the controlled complex networks achieve global pinning synchronization under arbitrary switching and some designed switching law, respectively. The criteria are simple and easy to verified, but this paper only discussed the pinning synchronization problem of switched dynamical networks by common Lyapunov function and single Lyapunov function method. How to solve this problem by multiple Lyapunov function method is a challenging problem which deserves future study.



---

*Source: 545827-2015-06-28.xml*