- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Discrete Dynamics in Nature and Society

Volume 2014 (2014), Article ID 835867, 9 pages

http://dx.doi.org/10.1155/2014/835867

## Cluster Synchronization of Stochastic Complex Networks with Markovian Switching and Time-Varying Delay via Impulsive Pinning Control

Industrial Training Center, Shenzhen Polytechnic, Shenzhen 518000, China

Received 4 April 2014; Revised 4 June 2014; Accepted 4 June 2014; Published 26 June 2014

Academic Editor: Luca Guerrini

Copyright © 2014 Xuan Zhou and Kui Luo. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

This paper studies the cluster synchronization of a kind of complex networks by means of impulsive pinning control scheme. These networks are subject to stochastic noise perturbations and Markovian switching, as well as internal and outer time-varying delays. Using the Lyapunov-Krasovskii functional, Itö’s formula, and some linear matrix inequalities (LMI), several novel sufficient conditions are obtained to guarantee the desired cluster synchronization. At the end of this writing, a numerical simulation is given to demonstrate the effectiveness of those theoretical results.

#### 1. Introduction and Model Description

Complex networks can be used to describe properly many biological, social, and communication systems and are made up of a great number of nodes representing individuals or organizations and links that are employed to mimic the interactions among them [1]. In particular, interesting examples are the spatiotemporal chaos [2], the Internet [3, 4], spiral waves [5], and the World Wide Web [6]. Synchronization is a universal phenomenon in nature, has potential applications significantly in real-world dynamical systems, and can be understood as the adjustment of coherence or rhythms of all states through interaction [7, 8]. Hitherto, a lot of different synchronization patterns have been investigated such as complete synchronization [9], phase synchronization [10], partial synchronization [11], and cluster synchronization [12]. Actually, the synchronization patterns can be nearly contained by a uniform definition.

In brief, the cluster synchronization can be understood as the dynamical nodes synchronize each other in each group, while there is no synchronization between any two different groups. A large number of real-world networks exhibit community structure, for example, communication engineering and biological science [13]. Cluster synchronization in two-dimensional and three-dimensional lattices of diffusively coupled chaotic oscillators was discussed in [14]. Cluster synchronization in a kind of strictly semipassive complex networks by means of diffusive coupling was focused on in [15]. In [16], Ma et al., under the help of a special coupling matrix for some connected chaotic networks, expressed that the randomly selected cluster synchronization manifolds could be stabilized. A novel and effective approach was provided to reach cluster synchronization of complex network and ensure their stability for a given nearest neighborhood network with zero-flux or periodic boundary conditions. In a few words, cluster synchronization, due to its significant practical implications, was considered widely and deeply by many researchers from various fields.

Moreover, owning to uncertain interferences caused by man-made and particularly natural factors, perturbation is a very universal and vital property in many real systems. There are lots of previous works contributing to studying stochastic phenomena of complex networks. For instance, in [17], the authors considered the case where only a single node was affected by stochastic perturbations. Reference [18] talked over an array of networks with scalar Wiener processes, which implied that each node is influenced by the same noise. Apparently, this assumption might be a little unrealistic for the real-world networks which were commonly influenced by different multidimensional perturbations. In [19], the writers discussed a class of coupled neural networks with stochastic noise and intermittent control. Also, their Wiener processes were of a vector form that can be viewed as an improvement of [18]. Consequently, the complex networks should be and must be brought in stochastic perturbations.

Recently, more and more researchers turn their attention to switched system in control theory domain. Generally speaking, a switched system includes two basic elements at least: one is several dynamical subsystems and the other one is a switching law used to specify some active subsystem at each instant of time. In view of different characteristics of complex networks, switching law also has several distinct patterns. For example, [20] probed into a blinking network whose switching couplings were according to certain probability. The writing pointed out that this kind of networks could synchronize for nearly all instances of the fast random switching process. As a matter of fact, from the mathematical point of view, switching signals between different network models can be governed by a Markovian chain. Recurring to linear matrix inequality, [21] considered the synchronization of a class of complex networks with Markovian jumping parameters whose coupling configuration was not dependent on mode switching. In addition, the synchronization issue in an array of neural networks with mixed delays and stochastic hybrid jumping couplings was investigated in [22] by adaptive control scheme. Nevertheless, if all nodes placed restriction on sharing common time-delay in a Markovian chain, this will lead to unpractical results. However, as far as I am concerned, the result on synchronization of stochastic networks with Markovian switching and time-varying delay coupling is seldom.

In view of the preceding discussion, this paper will focus on the issue of the synchronization of stochastic complex networks with Markovian switching and time-varying delay coupling by impulsive pinning control method. By the aid of the Lyapunov-Krasovskii functional method and some common linear matrix inequality in this field, several valid sufficient conditions will be obtained to ensure the cluster synchronization.

This paper is organized as follows. In Section 2, we introduce the generally considered model for a stochastic complex network. Moreover, some preliminary definitions and theorems needed for the rest of the paper are also provided. Section 3 shows some synchronization criteria for the discussed complex networks by logic and pleasing proof. In Section 4, three numerical simulations are given to illustrate our theoretical results. Ultimately, the paper concludes in Section 5.

*Notations*. In this paper, the superscript will denote the transpose of a matrix or a vector. will denote the -dimensional Euclidean space and the set of all real matrices. , and is an -dimensional identity matrix. stands for the trace of the corresponding matrix. For square matrix , the notation (<0) will mean that is a positive-definite (negative-definite) matrix. and will denote the greatest and least eigenvalues of a symmetric matrix, respectively, and , .

#### 2. Preliminaries

Let be a complete probability space with a filtration that is right continuous with including all the -null sets. will denote the family of continuous functions from to with the uniform norm . And denote the family of all measurable, -valued stochastic variables such that , where stands for the correspondent expectation operator with respect to the given probability measure .

As follows, some definitions, lemmas, and notations are revealed which will be used throughout this paper.

*Definition 1. *If is an irreducible matrix such that for all and for all , one says that .

*Definition 2 (see [16, 23]). *Let
be an symmetric matrix such that , . If each block is a zero-row-sum matrix, one says that . Furthermore, if , , one says that . It also follows from the symmetry of that , are zero-row-sum matrices and is a zero-column-sum matrix.

*Remark 3. *Definition 2 defines a diffusively coupled matrix; if for , then the coupling between and is called cooperative coupling; if for , then the coupling between and is called competitive coupling [16].

Before discussing the synchronization of the considered complex networks, we will introduce the mathematical definition of cluster synchronization.

*Definition 4 (see [24]). *Let , , be a partition of the set for , , and . Moreover for every , let be the counting index of the subset in which the number is ; that is, . A network with nodes is said to realize cluster synchronization with partition , if the state variables of the nodes satisfy for and for for all initial values.

The state equation of the switched network consisting of identical nodes without delay and time-varying delay coupling and Markovian jumping are given as follows: where is the state vector of the th node of the network, is a continuous vector-valued function, and are the continuous-time Markov processes that describe the evolution of the modes at time . is an inner coupling matrix of the networks that satisfies , . Here, and are the outer coupling matrices of the network at time . is the inner time-varying delay satisfying and is the coupling time-varying delay satisfying . Finally, , , , and is a bounded vector-form Wiener process, satisfying Suppose that is a right-continuous Markov chain on a probability space that takes on values in a finite space whose generator is given by for some , where is the transition speed from to if and . By the way, this writing requires that is irreducible.

The following are some initial conditions for (2) described by where , with the norm .

In this paper, we will make use of the impulse pinning controllers as follows: where are constants and .

It is worth noting that system (2) achieves synchronization, that is, , which implies that we have the following synchronized state equation:

Let () be the synchronization errors. Then, the error system according to controller (6) can be written as

*Definition 5. *The complex network (2) is said to reach cluster synchronization when the trivial solution of system (8) satisfies the inequality
for some positive constants and under any initial data .

*Definition 6 (see [21, 25]). *A continuous function is said to belong to the function class QUAD. denoted by , for some given matrix , if there exist a positive-definite diagonal matrix , a diagonal matrix , and constants , such that satisfies the condition
for all .

*Remark 7 (see [25]). *The function class QUAD includes almost all the well-known chaotic systems with or without delays such as the Lorenz system, the Rössler system, the Chen system, the delayed Chua circuit, the logistic delayed differential system, the delayed Hopfield neural network, and the delayed CNNs.

The following assumptions will be used to establish the synchronization conditions.(H1) and are bounded and continuously differentiable functions such that , , , and . Let .(H2)Suppose that , , , , . Thereby, there are some positive-definite constant matrices , , and for and such that

Lemma 8 (see [26]). *Consider a stochastic delayed differential equation with Markovian switching expressed as
**
on with initial value , where
**
Let be the family of all the nonnegative functions on which are twice continuously differentiable in and once differentiable in . Let . Define an operator from to by
**
where , , and . If , then
**
for all as long as the expectations of the integrals exist.*

#### 3. Main Result

This section will show our main results with rigorous proof.

Theorem 9. *Suppose that (H1) and (H2) are true and . If there are some positive constants , , and such that
*

*where*

*then the global and exponential synchronization of the stochastic complex network (8) can be achieved.*

*Proof. *Inequality (19) indicates that there is a sufficiently small constant such that
Let . Thus
namely,
For , define the Lyapunov-Krasovskii function
and let , . By Lemma 8, for any , , we have
Set
And then we have
and (23) deduces that
Define
By the aid of (28), we will deal with the operator
The generalized Itô formula shows that
for any . Hence we have
Let ; we have
Similarly, it can be obtained that
Substituting (33) and (34) into (32) can result in
With help of Gronwall inequality, the following inequality can be achieved:

On the other hand, in view of the construction of , we have
where .

Let ; according to (36) and (37), for any , one has

Let ; we have

By means of condition (18) in Theorem 9, there is a number such that . Consequently, . The proof of Theorem 9 is completed.

When the time-varying delays are constant (i.e., , ), we obtain the following corollary.

Corollary 10. *Suppose that (H1) and (H2) are true and . If there are some positive constants , , and such that
**
where
**
then the global and exponential synchronization of the stochastic complex network (8) can be achieved.*

When and are symmetric matrices, for , and , we can get the following corollary.

Corollary 11. *Suppose that (H1) and (H2) are true and . If there are some positive constants , , and such that
**
where
**
then the global and exponential synchronization of the stochastic complex network (8) can be achieved.*

#### 4. Numerical Simulation

This section will employ some numerical examples to illustrate the effectiveness of the previous theoretical results.

Consider the following stochastic delayed neural network: where , , , Set , , and let , ensure that condition (10) is satisfied. And then

We here consider a network that has 7 nodes divided into 2 clusters as shown in Figure 1. Some computations result in , , , , for . Thus, the solutions of inequalities can be obtained as follows (16)–(19): , , , , and ; , , , , and .

In this simulation, the initial conditions, for , , are all constants. Figure 2 provides the trajectories of the impulse pinning control gains. By Figure 3, we show the time evolution of the cluster synchronization errors with impulse control.

#### 5. Conclusion

In this writing, we focused on the cluster synchronization issue of an array of stochastic complex networks with Markovian switching and time-varying delayed couplings. By means of an impulsive pinning control method imposed on a small fraction of the nodes, the desired cluster synchronization was reached, while a novel sufficient condition was derived to ensure the stability of the considered stochastic networks. At the end of this paper, a numerical simulation was given to show the validity of the theoretical analysis.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This work was supported by the Basic Research Project Fund (2213K3170015 and 2213K3170021) of Shenzhen Polytechnic, Shenzhen. The authors are very grateful to the reviewers and editor for their valuable comments and suggestions to improve the presentation of the paper.

#### References

- L. A. N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley, “Classes of small-world networks,”
*Proceedings of the National Academy of Sciences of the United States of America*, vol. 97, pp. 11149–11152, 2000. View at Publisher · View at Google Scholar - A. Zheleznyak and L. O. Chua, “coexistence of low- and high-dimensional spatiotemporal chaos in a chain of dissipatively coupled chua’s circuits,”
*International Journal of Bifurcation and Chaos*, vol. 4, pp. 639–674, 1994. View at Publisher · View at Google Scholar - M. Faloutsos, P. Faloutsos, and C. Faioutsos, “On power-law relationships of the internet topology,” in
*Proceedings of the ACM SIGCOMM Conference Applications, Technologies, Architectures, and Protocols for Computer Communication*, pp. 251–261, September 1999. View at Scopus - A. Medina, I. Matt, and J. Byers, “On the origin of power laws in internet topologies,”
*Computer Communication Review*, vol. 30, pp. 18–28, 2000. View at Publisher · View at Google Scholar - A. Perez-Munuzuri, V. Perez-Munuzuri, V. Perez-Villar, and L. O. Chua, “Synchronization in an array of linearly coupled dynamical systems,”
*IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications*, vol. 42, no. 8, pp. 430–447, 1995. View at Publisher · View at Google Scholar - R. Albert, H. Jeong, and A. L. Barabási, “Diameter of the world-wide web,”
*Nature*, vol. 401, no. 6749, pp. 130–131, 1999. View at Publisher · View at Google Scholar · View at Scopus - S. H. Wang, J. Y. Kuang, J. H. Li, and Y. L. Luo, “Chaos-based secure communications in a large community,”
*Physical Review E*, vol. 66, Article ID 065202, 2002. View at Publisher · View at Google Scholar - B. Rakshit, A. R. Chowdhury, and P. Saha, “Parameter estimation of a delay dynamical system using synchronization in presence of noise,”
*Chaos, Solitons and Fractals*, vol. 32, no. 4, pp. 1278–1284, 2007. View at Publisher · View at Google Scholar · View at Scopus - Z. G. Zheng and G. Hu, “Generalized synchronization versus phase synchronization,”
*Physical Review E*, vol. 62, article 7882, 2000. View at Publisher · View at Google Scholar - M. G. Earl and S. H. Strogatz, “Synchronization in oscillator networks with delayed coupling: A stability criterion,”
*Physical Review E*, vol. 67, no. 3, Article ID 036204, 2003. View at Google Scholar · View at Scopus - E. G. de Oliveira and T. Braun, “Partial synchronization on a network with different classes of oscillators,”
*Physical Review E*, vol. 76, Article ID 067201, 2007. View at Publisher · View at Google Scholar - K. Wang, X. Fu, and K. Li, “Cluster synchronization in community networks with nonidentical nodes,”
*Chaos. An Interdisciplinary Journal of Nonlinear Science*, vol. 19, no. 2, Article ID 023106, 2009. View at Publisher · View at Google Scholar · View at MathSciNet - K. Kaneko, “Relevance of dynamic clustering to biological networks,”
*Physica D: Nonlinear Phenomena*, vol. 75, no. 1–3, pp. 55–73, 1994. View at Google Scholar · View at Scopus - I. Belykh, V. Belykh, K. Nevidin, and M. Hasler, “Persistent clusters in lattices of coupled nonidentical chaotic systems,”
*Chaos*, vol. 13, no. 1, pp. 165–178, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Pogromsky, G. Santoboni, and H. Nijmeijer, “Partial synchronization: from symmetry towards stability,”
*Physica D*, vol. 172, no. 1–4, pp. 65–87, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Z. Ma, Z. Liu, and G. Zhang, “A new method to realize cluster synchronization in connected chaotic networks,”
*Chaos*, vol. 16, no. 2, Article ID 023103, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Sun, J. Cao, and Z. Wang, “Exponential synchronization of stochastic perturbed chaotic delayed neural networks,”
*Neurocomputing*, vol. 70, no. 13–15, pp. 2465–2477, 2007. View at Publisher · View at Google Scholar · View at Scopus - J. Cao, Z. Wang, and Y. Sun, “Synchronization in an array of linearly stochastically coupled networks with time delays,”
*Physica A*, vol. 385, no. 2, pp. 718–728, 2007. View at Publisher · View at Google Scholar · View at MathSciNet - X. Yang and J. Cao, “Stochastic synchronization of coupled neural networks with intermittent control,”
*Physics Letters A*, vol. 373, no. 36, pp. 3259–3272, 2009. View at Publisher · View at Google Scholar · View at Scopus - I. V. Belykh, V. N. Belykh, and M. Hasler, “Blinking model and synchronization in small-world networks with a time-varying coupling,”
*Physica D*, vol. 195, no. 1-2, pp. 188–206, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Wang, C. Xu, J. Feng, M. K. Kwong, and F. Austin, “Mean-square exponential synchronization of markovian switching stochastic complex networks with time-varying delays by pinning control,”
*Abstract and Applied Analysis*, vol. 2012, Article ID 298095, 2012. View at Publisher · View at Google Scholar - Y. Tang and J.-a. Fang, “Adaptive synchronization in an array of chaotic neural networks with mixed delays and jumping stochastically hybrid coupling,”
*Communications in Nonlinear Science and Numerical Simulation*, vol. 14, no. 9-10, pp. 3615–3628, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - W. Wu, W. Zhou, and T. Chen, “Cluster synchronization of linearly coupled complex networks under pinning control,”
*IEEE Transactions on Circuits and Systems. I. Regular Papers*, vol. 56, no. 4, pp. 829–839, 2009. View at Publisher · View at Google Scholar · View at MathSciNet - J. Wang, J. Feng, C. Xu, and Y. Zhao, “Cluster synchronization of nonlinearly-coupled complex networks with nonidentical nodes and asymmetrical coupling matrix,”
*Nonlinear Dynamics*, vol. 67, no. 2, pp. 1635–1646, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Wang, J. Feng, C. Xu, and Y. Zhao, “Exponential synchronization of stochastic perturbed complex networks with time-varying delays via periodically intermittent pinning,”
*Communications in Nonlinear Science and Numerical Simulation*, vol. 18, no. 11, pp. 3146–3157, 2013. View at Publisher · View at Google Scholar · View at MathSciNet - C. Yuan and X. Mao, “Robust stability and controllability of stochastic differential delay equations with Markovian switching,”
*Automatica*, vol. 40, no. 3, pp. 343–354, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet