# Cluster Projective Synchronization of Fractional-Order Complex Network via Pinning Control

Authors: Li-xin Yang; Wan-sheng He; Fan-di Zhang; Jin-ping Jia
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

Synchronization is the strongest form of collective phenomena in complex systems of interacting components. In this paper, the problem of cluster projective synchronization of complex networks with fractional-order nodes based on the fractional-order differential equation stability theory is investigated. Only the nodes in one community which have direct connections to the nodes in other communities are controlled. Some sufficient synchronization conditions are derived via pinning control. Numerical simulations are provided to show the effectiveness of the theoretical results.


---

## Body

## 1. Introduction

In the past few decades, complex networks behaviors have attracted a great deal of attention in a variety of fields due to their wide and potential applications. Typical complex networks include the Internet, the World Wide Web, neural networks, and so on [1–5]. Synchronization, as a typical collective dynamical behavior of coupled dynamical systems, has been widely studied. Until now, several types of synchronization have been investigated, such as complete synchronization [6], phase synchronization [7], and generalized synchronization [8]. Projective synchronization (PS) [9], which was first proposed by Mainieri and Rehacek that the drive state vector and the response state vectors synchronize up to a constant scaling factor. The proportional feature of PS can be employed to extend binary digital to M-nary communication for achieving fast communication. Recently, Li and Chen [10] discussed projective synchronization of the random networks. After that, the authors studied the projective synchronization of time-delayed chaotic systems in a driven-response complex network. In [11], they investigated the projective and lag synchronization between general complex networks via impulsive control.In particular, in many social and biological networks, which can be divided naturally into communities, nodes in the same community often have the same type of function. Cluster synchronization is an exact phrase that describes this important phenomenon [12]. Cluster synchronization is achieved when the dynamical nodes reach complete synchronization in each subgroup called cluster but no synchronization among the different clusters. Many results have been available for cluster synchronization of complex networks. For example, Ayati and Khaki-Sedigh studied cluster synchronization of a connected chaotic network and a star-like complex network in [13]. Wang and Song [14] investigated the cluster synchronization problem for linearly coupled networks. More recently, Hu et al. [15] studied the cluster synchronization for directed complex dynamical networks via pinning control. In [16, 17], cluster synchronization in community networks is studied with integer-order system nodes, and several sufficient conditions for synchronization are obtained analytically.On the other hand, as we know, the well-studied integer-order complex networks are the special cases of the fractional-order ones. It has been revealed that, in interdisciplinary fields, various systems have been found to exhibit fractional dynamics. For example, viscoelasticity, dielectric polarization, quantum evolution of complex system, fractional kinetics, and anomalous attenuation can be described by fractional differential equations. To the best of our knowledge, most studies to date have been concerned with integer-order complex networks, and the corresponding research on fractional-order complex networks has received very little attention despite its practical significance [18–23]. Therefore, it is of great interest to investigate the synchronization in complex colored networks consisting of nodes with fractional-order dynamics.Motivated by the above discussions, the cluster projective synchronization in complex dynamical networks with fractional-order dynamical nodes by pinning control is investigated in this paper. This method decreases the control cost to some extent by reducing the number of nodes. The pinning controllers are designed according to the nodes property, respectively. We derive some simple and useful criteria for cluster synchronization for any initial values through an effective control scheme.This paper is organized as follows. In Section2, the network model of fractional-order network and mathematical preliminaries is introduced. Section 3 is devoted to investigating the cluster projective synchronization of the complex coupled networks. In Section 4, illustrative examples are shown to support the theory results. Conclusions are drawn in Section 5.


## 2. Mathematical Preliminaries and Model for Community Networks

### 2.1. Fractional-Order Derivative

Fractional calculus is a generalization of integration and differentiation to a noninteger-order integrodifferential operatorD
t
q
a which is defined by
(1)
D
t
q
a
=
{
d
q
d
t
q
R
(
q
)
>
0
1
R
(
q
)
=
0
∫
a
t
(
d
τ
)
-
q
R
(
q
)
<
0
,
where q is the fractional order which can be a complex number and R
(
q
) is the real part of q. The numbers a and t are the limits of the operator. There are many definitions for fractional differential equations. Three most frequently used definitions for general fractional differential equations are the Grunwald-Letnikov definition, the Riemann-Liouville definition, and the Caputo definitions.The Grunwald-Letnikov definition (GL) derivative with fractional-orderq is described by
(2)
D
t
q
a
GL
f
(
t
)
=
lim
⁡
h
→
0
f
h
(
q
)
∑
j
=
0
[
(
t
-
a
)
/
h
]
(
-
1
)
j
[
q
j
]
f
(
t
-
j
h
)
,
where the symbol [
·
] means the integer part.The Riemann-Liouville (RL) definition of fractional derivatives is given by(3)
D
t
q
a
GL
f
(
t
)
=
1
Γ
(
n
-
q
)
×
∫
a
t
f
(
n
)
(
τ
)
(
t
-
τ
)
q
-
n
+
1
d
τ
,
n
-
1
<
q
<
n
,
where Γ
(
·
) is the gamma function.The Caputo(
C
) fractional derivative is defined as follows:
(4)
D
t
a
a
C
f
(
t
)
=
1
Γ
(
n
-
q
)
∫
a
t
f
(
n
)
(
τ
)
(
t
-
τ
)
q
-
n
+
1
d
τ
,
n
-
1
<
q
<
n
.
It is well known that the initial conditions for the fractional differential equations with Caputo derivatives take on the same form as those for the integer-order ones, which is very suitable for practical problems. Therefore, we will use the Caputo definition for the fractional derivatives in this paper.


### 2.2. Model Description for Community Networks

Consider that the complex networks considered in this paper consist ofN nodes and m communities, where 2
≤
m
≤
N. Let {
C
1
,
C
2
,
…
,
C
m
} denote m communities of complex networks and ∪
i
=
1
m
C
i
=
{
1,2
,
…
,
N
}. Without loss of generality, let C
1
=
{
1,2
,
…
,
r
1
}, C
1
=
{
r
1
+
1
,
…
,
r
1
+
r
2
}
,
…
,
C
m
=
{
r
1
+
⋯
+
r
m
-
1
+
1
,
…
,
r
1
+
⋯
+
r
m
-
1
+
r
m
} with r
+
⋯
+
r
m
-
1
+
r
m
=
N. If node i belongs to the j
th community then let δ
i
=
j. Denote by U
δ
i the set of all nodes in the δ
i
th cluster. U
~
δ
i represents all the nodes in the δ
i cluster, which have direct connections with the nodes in other communities.A complex network consisting ofN coupled identical nodes, with each node being a n-dimensional fractional-order dynamical system, can be described by
(5)
D
*
q
x
i
(
t
)
=
f
(
x
i
(
t
)
)
+
ε
∑
i
=
1
N
c
i
j
Γ
x
j
(
t
)
i
=
1,2
,
…
,
N
,
where 0
<
q
<
1 and x
i
=
(
x
i
1
,
x
i
2
,
…
,
x
i
n
)
T
∈
R
n is the state variable of the node i. f
:
R
n
→
R
n describes the dynamics of nodes and is differential and capable of performing abundant dynamical behaviors. ε
>
0 is the coupling strength and Γ
=
diag
⁡
(
β
1
,
β
2
,
…
,
β
n
) is the inner-coupling matrix. The matrix C
=
(
c
i
j
)
N
×
N is the coupling configuration diffusive matrix, which is defined as follows: if there is a connection between nodes i and j is connected, then c
i
j
=
c
j
i
>
0
(
i
≠
j
); otherwise c
i
j
=
c
j
i
=
0
(
i
≠
j
); let c
i
i
=
-
∑
j
=
1
,
i
≠
j
N
c
i
j. Further, assume that there are no isolated clusters in the network and the network is connected, so the coupling configuration C is symmetrical and irreducible. u
i
∈
R
n are controllers to be designed later. For simplicity of further discussion, decompose the function f
(
x
i
(
t
)
) into two parts, A
(
x
i
(
t
)
)
+
F
(
x
i
(
t
)
), where A is an n
×
n constant matrix and F
:
R
n
→
R
n are nonlinear vector-valued functions.Then the controlled network can be rewritten as(6)
D
*
q
x
i
(
t
)
=
A
(
x
i
(
t
)
)
+
F
(
x
i
(
t
)
)
+
ε
∑
j
=
1
N
c
i
j
Γ
x
j
(
t
)
+
u
i
s
d
f
s
d
f
s
d
f
s
d
f
s
d
f
s
d
f
s
d
f
i
=
1,2
,
…
,
N
.Definition 1.
Let{
1,2
,
…
,
N
} be the N nodes of the networks and let {
C
1
,
C
2
,
…
,
C
m
} be the m communities, respectively. A network with m communities is said to realize cluster projective synchronization if
(7)
lim
⁡
t
→
∞
∥
x
i
-
M
x
j
∥
=
0
,
∀
i
,
j
∈
C
n
,
n
=
1,2
,
…
,
m
,
lim
⁡
t
→
∞
∥
x
i
-
M
x
j
∥
≠
0
,
i
∈
C
n
1
,
j
∈
C
n
2
,
n
1
≠
n
2
=
1,2
,
…
,
m
.
Define the error variables
(8)
e
i
(
t
)
=
x
i
(
t
)
-
M
S
δ
i
(
i
=
1,2
,
…
,
N
)
,
where M
=
diag
⁡
(
λ
,
λ
,
…
,
λ
) is the scaling matrix and S
δ
i
(
t
) is a solution of an isolated node in the δ
i
th community; we assume that the smooth goal dynamics can be described by
(9)
D
*
q
S
δ
i
(
t
)
=
B
S
δ
i
(
t
)
+
g
(
S
δ
i
(
t
)
)
,
where S
δ
i
(
t
) may be an equilibrium point, a periodic orbit, or even a chaotic orbit. Where B
∈
R
n
×
n is a constant matrix, g
(
s
(
t
)
) is the nonlinear part of the isolated reference node dynamics, respectively.Remark 2.
It is easy to see that the definition of the cluster projective synchronization encompasses the cluster synchronization and cluster antisynchronization when the scaling matrix is selected to take the corresponding specific values, respectively.
Throughout this paper, the following assumption and lemma are needed to prove our main results.Lemma 3 (see [22]).
For a given autonomous fractional-order linear system(10)
D
*
q
x
=
A
x
,
w
i
t
h
x
(
0
)
=
x
0
,
where x
∈
R
n is the state vector, A
∈
R
n
×
n is a constant matrix with eigenvalues λ
1
,
λ
2
,
…
,
λ
n, the fractional order q
∈
(
0,1
), and system (9) is asymptotically stable if and only if |
arg
(
λ
i
)
|
>
q
π
/
2, i
=
1,2
,
…
,
n.Lemma 4 (see [24]).
AssumeA
∈
R
N
×
N satisfies the following conditions:(1)
a
i
j
≥
0
(
i
≠
j
), a
i
i
=
-
∑
j
=
1
,
j
≠
i
N
a
i
j,i
,
j
,
…
,
N,
(2)
A is irreducible.Then (i) real parts of the eigenvalues of A are all negatives except an eigenvalue 0 with multiplicity 1; (ii) A has the right eigenvector (
1,1
,
…
,
1
)
Tcorresponding to the eigenvalue 0; (iii) let ξ
=
(
ξ
1
,
ξ
2
,
…
,
ξ
N
)
T be the left eigenvector of A corresponding to the eigenvalue 0; then we can let ξ
i
>
0 hold for all i
=
1,2
,
…
,
N.Lemma 5 (see [24]).
If the matrixC is defined as in Lemma 4 and diagonal matrix K
=
diag
⁡
(
k
1
,
k
2
,
…
,
k
n
) with k
i
≥
0
(
i
=
1,2
,
…
,
N
), then all eigenvalues of the matrix C
-
K are negative.


## 2.1. Fractional-Order Derivative

Fractional calculus is a generalization of integration and differentiation to a noninteger-order integrodifferential operatorD
t
q
a which is defined by
(1)
D
t
q
a
=
{
d
q
d
t
q
R
(
q
)
>
0
1
R
(
q
)
=
0
∫
a
t
(
d
τ
)
-
q
R
(
q
)
<
0
,
where q is the fractional order which can be a complex number and R
(
q
) is the real part of q. The numbers a and t are the limits of the operator. There are many definitions for fractional differential equations. Three most frequently used definitions for general fractional differential equations are the Grunwald-Letnikov definition, the Riemann-Liouville definition, and the Caputo definitions.The Grunwald-Letnikov definition (GL) derivative with fractional-orderq is described by
(2)
D
t
q
a
GL
f
(
t
)
=
lim
⁡
h
→
0
f
h
(
q
)
∑
j
=
0
[
(
t
-
a
)
/
h
]
(
-
1
)
j
[
q
j
]
f
(
t
-
j
h
)
,
where the symbol [
·
] means the integer part.The Riemann-Liouville (RL) definition of fractional derivatives is given by(3)
D
t
q
a
GL
f
(
t
)
=
1
Γ
(
n
-
q
)
×
∫
a
t
f
(
n
)
(
τ
)
(
t
-
τ
)
q
-
n
+
1
d
τ
,
n
-
1
<
q
<
n
,
where Γ
(
·
) is the gamma function.The Caputo(
C
) fractional derivative is defined as follows:
(4)
D
t
a
a
C
f
(
t
)
=
1
Γ
(
n
-
q
)
∫
a
t
f
(
n
)
(
τ
)
(
t
-
τ
)
q
-
n
+
1
d
τ
,
n
-
1
<
q
<
n
.
It is well known that the initial conditions for the fractional differential equations with Caputo derivatives take on the same form as those for the integer-order ones, which is very suitable for practical problems. Therefore, we will use the Caputo definition for the fractional derivatives in this paper.


## 2.2. Model Description for Community Networks

Consider that the complex networks considered in this paper consist ofN nodes and m communities, where 2
≤
m
≤
N. Let {
C
1
,
C
2
,
…
,
C
m
} denote m communities of complex networks and ∪
i
=
1
m
C
i
=
{
1,2
,
…
,
N
}. Without loss of generality, let C
1
=
{
1,2
,
…
,
r
1
}, C
1
=
{
r
1
+
1
,
…
,
r
1
+
r
2
}
,
…
,
C
m
=
{
r
1
+
⋯
+
r
m
-
1
+
1
,
…
,
r
1
+
⋯
+
r
m
-
1
+
r
m
} with r
+
⋯
+
r
m
-
1
+
r
m
=
N. If node i belongs to the j
th community then let δ
i
=
j. Denote by U
δ
i the set of all nodes in the δ
i
th cluster. U
~
δ
i represents all the nodes in the δ
i cluster, which have direct connections with the nodes in other communities.A complex network consisting ofN coupled identical nodes, with each node being a n-dimensional fractional-order dynamical system, can be described by
(5)
D
*
q
x
i
(
t
)
=
f
(
x
i
(
t
)
)
+
ε
∑
i
=
1
N
c
i
j
Γ
x
j
(
t
)
i
=
1,2
,
…
,
N
,
where 0
<
q
<
1 and x
i
=
(
x
i
1
,
x
i
2
,
…
,
x
i
n
)
T
∈
R
n is the state variable of the node i. f
:
R
n
→
R
n describes the dynamics of nodes and is differential and capable of performing abundant dynamical behaviors. ε
>
0 is the coupling strength and Γ
=
diag
⁡
(
β
1
,
β
2
,
…
,
β
n
) is the inner-coupling matrix. The matrix C
=
(
c
i
j
)
N
×
N is the coupling configuration diffusive matrix, which is defined as follows: if there is a connection between nodes i and j is connected, then c
i
j
=
c
j
i
>
0
(
i
≠
j
); otherwise c
i
j
=
c
j
i
=
0
(
i
≠
j
); let c
i
i
=
-
∑
j
=
1
,
i
≠
j
N
c
i
j. Further, assume that there are no isolated clusters in the network and the network is connected, so the coupling configuration C is symmetrical and irreducible. u
i
∈
R
n are controllers to be designed later. For simplicity of further discussion, decompose the function f
(
x
i
(
t
)
) into two parts, A
(
x
i
(
t
)
)
+
F
(
x
i
(
t
)
), where A is an n
×
n constant matrix and F
:
R
n
→
R
n are nonlinear vector-valued functions.Then the controlled network can be rewritten as(6)
D
*
q
x
i
(
t
)
=
A
(
x
i
(
t
)
)
+
F
(
x
i
(
t
)
)
+
ε
∑
j
=
1
N
c
i
j
Γ
x
j
(
t
)
+
u
i
s
d
f
s
d
f
s
d
f
s
d
f
s
d
f
s
d
f
s
d
f
i
=
1,2
,
…
,
N
.Definition 1.
Let{
1,2
,
…
,
N
} be the N nodes of the networks and let {
C
1
,
C
2
,
…
,
C
m
} be the m communities, respectively. A network with m communities is said to realize cluster projective synchronization if
(7)
lim
⁡
t
→
∞
∥
x
i
-
M
x
j
∥
=
0
,
∀
i
,
j
∈
C
n
,
n
=
1,2
,
…
,
m
,
lim
⁡
t
→
∞
∥
x
i
-
M
x
j
∥
≠
0
,
i
∈
C
n
1
,
j
∈
C
n
2
,
n
1
≠
n
2
=
1,2
,
…
,
m
.
Define the error variables
(8)
e
i
(
t
)
=
x
i
(
t
)
-
M
S
δ
i
(
i
=
1,2
,
…
,
N
)
,
where M
=
diag
⁡
(
λ
,
λ
,
…
,
λ
) is the scaling matrix and S
δ
i
(
t
) is a solution of an isolated node in the δ
i
th community; we assume that the smooth goal dynamics can be described by
(9)
D
*
q
S
δ
i
(
t
)
=
B
S
δ
i
(
t
)
+
g
(
S
δ
i
(
t
)
)
,
where S
δ
i
(
t
) may be an equilibrium point, a periodic orbit, or even a chaotic orbit. Where B
∈
R
n
×
n is a constant matrix, g
(
s
(
t
)
) is the nonlinear part of the isolated reference node dynamics, respectively.Remark 2.
It is easy to see that the definition of the cluster projective synchronization encompasses the cluster synchronization and cluster antisynchronization when the scaling matrix is selected to take the corresponding specific values, respectively.
Throughout this paper, the following assumption and lemma are needed to prove our main results.Lemma 3 (see [22]).
For a given autonomous fractional-order linear system(10)
D
*
q
x
=
A
x
,
w
i
t
h
x
(
0
)
=
x
0
,
where x
∈
R
n is the state vector, A
∈
R
n
×
n is a constant matrix with eigenvalues λ
1
,
λ
2
,
…
,
λ
n, the fractional order q
∈
(
0,1
), and system (9) is asymptotically stable if and only if |
arg
(
λ
i
)
|
>
q
π
/
2, i
=
1,2
,
…
,
n.Lemma 4 (see [24]).
AssumeA
∈
R
N
×
N satisfies the following conditions:(1)
a
i
j
≥
0
(
i
≠
j
), a
i
i
=
-
∑
j
=
1
,
j
≠
i
N
a
i
j,i
,
j
,
…
,
N,
(2)
A is irreducible.Then (i) real parts of the eigenvalues of A are all negatives except an eigenvalue 0 with multiplicity 1; (ii) A has the right eigenvector (
1,1
,
…
,
1
)
Tcorresponding to the eigenvalue 0; (iii) let ξ
=
(
ξ
1
,
ξ
2
,
…
,
ξ
N
)
T be the left eigenvector of A corresponding to the eigenvalue 0; then we can let ξ
i
>
0 hold for all i
=
1,2
,
…
,
N.Lemma 5 (see [24]).
If the matrixC is defined as in Lemma 4 and diagonal matrix K
=
diag
⁡
(
k
1
,
k
2
,
…
,
k
n
) with k
i
≥
0
(
i
=
1,2
,
…
,
N
), then all eigenvalues of the matrix C
-
K are negative.


## 3. Main Results

In this section, we present a scheme to make a complex network achieve cluster projective synchronization. First of all, we propose the concept of interlink and intralink nodes. Nodei is said to be the interlink node if i belongs to U
~
δ
i, while i is said to be the intralink node if i belongs to U
δ
i
-
U
~
δ
i.According to the diffusive coupling condition of matrixA, we have
(11)
ε
∑
j
=
1
N
c
i
j
Γ
S
δ
i
(
t
)
=
0
,
U
δ
i
-
U
~
δ
i
.So the error dynamical system is described as follows:(12)
D
*
q
e
i
(
t
)
=
A
e
i
(
t
)
+
F
(
x
i
(
t
)
)
+
M
(
A
-
B
)
S
δ
i
(
t
)
-
M
g
(
S
δ
i
(
t
)
)
+
ε
∑
j
=
1
N
c
i
j
Γ
e
j
(
t
)
+
u
i
(
t
)
.
In order to make the network achieve cluster synchronization, the control input u
i is designed as follows:
(13)
u
i
=
{
-
F
(
x
i
(
t
)
)
-
M
(
A
-
B
)
S
δ
i
+
M
g
(
S
δ
i
(
t
)
)
-
k
i
e
i
(
t
)
f
d
s
f
d
f
d
s
f
s
d
f
s
d
f
s
d
f
d
s
f
d
d
f
d
f
d
f
d
f
k
i
∈
U
~
δ
i
,
0
sdfdffdfdfdfdsfsdfdsfdsfsdffdfffffdfd
i
∈
U
δ
i
-
U
~
δ
i
,
where k
i
>
0 is the feedback control gain, which can adjust the synchronization speed.Theorem 6.
For a certain fractional-orderq, the fractional-order complex network (6) can achieve the cluster projective synchronization with controller (13) if
(14)
|
arg
(
A
+
λ
i
ε
Γ
)
|
>
q
π
2
,
i
=
1,2
,
…
,
N
.Proof.
Combining (6) and (13), one has
(15)
D
*
q
e
i
(
t
)
=
(
A
e
i
(
t
)
)
+
ε
∑
i
=
1
N
c
i
j
Γ
e
j
(
t
)
-
k
i
e
i
(
t
)
,
1
≤
i
≤
N
.
Denote K
=
diag
⁡
(
k
1
,
k
2
,
,
…
,
k
N
) with k
i
=
0 for all U
δ
i
-
U
~
δ
i, e
(
t
)
=
(
e
1
(
t
)
,
e
2
(
t
)
,
…
,
e
N
(
t
)
)
∈
R
n
×
N; thus one can obtain the following equation:
(16)
D
*
q
e
(
t
)
=
A
e
(
t
)
+
ε
(
C
-
K
)
e
(
t
)
Γ
.
Since C is an irreducible matrix and K
=
diag
⁡
(
k
1
,
k
2
,
…
,
k
N
) with k
i
≥
0
(
i
=
1,2
,
…
,
N
), according to Lemmas 4 and 5, there exists unitary ξ
=
(
ξ
1
,
ξ
2
,
…
,
ξ
N
) such that
(17)
(
C
-
K
)
ξ
=
ξ
Λ
,
where Λ
=
diag
⁡
(
λ
1
,
λ
2
,
…
,
λ
N
) and λ
i is the eigenvalue of matrix C
-
Kand satisfies 0
>
λ
1
≥
λ
2
≥
⋯
≥
λ
N
=
λ
min
⁡
(
C
-
K
).
It follows from (16) and (17) that
(18)
D
*
q
e
(
t
)
=
(
A
e
(
t
)
)
ξ
+
ε
Γ
e
(
t
)
ξ
Λ
.
Denote β
(
t
)
=
e
(
t
)
ξ, β
(
t
)
=
(
β
1
(
t
)
,
β
2
(
t
)
,
…
,
β
N
(
t
)
); thus
(19)
D
*
q
β
(
t
)
=
A
β
(
t
)
+
ε
Γ
β
(
t
)
Λ
;
that is,
(20)
D
*
q
β
i
(
t
)
=
(
A
+
λ
i
ε
Γ
)
β
i
(
t
)
,
i
=
1,2
,
…
,
N
.
According to Lemma 3, system (19) is asymptotically stable if and only if all the eigenvalues of A
+
λ
i
ε
Γ satisfy |
arg
(
A
+
λ
i
ε
Γ
)
|
>
q
π
/
2, which implies that system (6) can achieve the cluster projective synchronization.Based on Theorem6, a corollary can be easily derived as follows.Corollary 7.
If matrixC
-
K is irreducible, for a certain fractional-order q, the fractional-order complex network (6) can achieve cluster projective synchronization via controller (13) if
(21)
|
arg
(
λ
-
i
k
(
A
+
λ
i
ε
Γ
)
)
|
>
q
π
2
,
k
=
1,2
,
…
,
n
,
s
d
f
s
f
d
s
f
s
d
f
s
d
f
s
d
f
s
d
f
f
d
s
k
i
=
1,2
,
…
,
N
,
where λ
i
k
(
·
) is the eigenvalue of the i
t
h node matrix A
+
λ
i
ε
Γ.


## 4. Numerical Example

In what follows, we take a representative example to demonstrate the effectiveness of the proposed approach for cluster projective synchronization.Example 1.
We arbitrarily set the network size asN
=
16. Suppose this network consists of three communities. The size of three communities is N
1
=
5, N
2
=
5, and N
3
=
6. The local dynamics of nodes are described by Lorenz system. The fractional-order Lorenz system is given by
(22)
D
*
q
x
1
=
a
(
x
2
-
x
1
)
,
D
*
q
x
2
=
b
x
1
-
x
2
-
x
1
x
3
,
D
*
q
x
3
=
x
1
x
2
-
c
x
3
,
where a
=
10,b
=
28,c
=
8
/
3, parameters for which the system exhibits chaotic behavior. The chaotic attractor is depicted by Figure 1.Figure 1
The chaotic orbit of the Lorenz system.Without loss of generality, we suppose thatC
1
=
{
1,2
,
3,4
,
5
}, C
2
=
{
6,7
,
8,9
,
10
}, and C
3
=
{
11,12,13,14,15,16
}.In the following simulations, inner-coupling matrixΓ is chosen as identity matrix. The following quantities are used to investigate the process of cluster projective synchronization:
(23)
E
(
t
)
=
∑
i
=
1
N
∥
x
i
(
t
)
-
M
S
δ
i
(
t
)
∥
,
E
12
(
t
)
=
∑
i
=
1
N
∥
x
u
(
t
)
-
x
v
(
t
)
∥
,
u
∈
C
1
,
v
∈
C
2
,
E
13
(
t
)
=
∥
x
u
(
t
)
-
x
v
(
t
)
∥
,
u
∈
C
1
,
v
∈
C
3
,
E
23
(
t
)
=
∥
x
u
(
t
)
-
x
v
(
t
)
∥
,
u
∈
C
2
,
v
∈
C
3
,
where E
(
t
) is the total error of cluster projective synchronization for all communities and E
12
(
t
),E
13
(
t
),E
23
(
t
) are the errors between two different communities. S is the states of Lorenz system. All the initial conditions are chosen randomly in [
0,2
]. The results of simulation can be seen in Figures 2 and 3.Figure 2
Time evolution of synchronization errorE
(
t
).Figure 3
Time evolution of synchronization errorE
(
t
).As can be seen from Figure2, the synchronization errors E
(
t
) converge to zero. Figure 3 shows that the synchronization errors E
12
(
t
),E
13
(
t
),E
23
(
t
) do not converge to zero as t
→
∞. That is to say that the nodes in the same cluster reach synchronization and there is no synchronization among the different clusters, which implies that the desired cluster projective synchronization is achieved.


## 5. Conclusions

In this paper, we have investigated the cluster projective synchronization of complex networks with community structure. Based on the stability theory of the fractional-order differential system, the controllers are designed differently for the nodes in one community, which have direct connections to the nodes in the other communities and the nodes without direct connections to the nodes in the other communities. Several sufficient conditions for the network to achieve cluster projective synchronization are derived. Finally, a representative numerical example is provided to illustrate the effectiveness of the derived theoretical results.



---

*Source: 314742-2014-05-12.xml*