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

Abstract and Applied Analysis

Volume 2013 (2013), Article ID 352826, 8 pages

http://dx.doi.org/10.1155/2013/352826

## Full Synchronization Studied by a Set of Partitions Connected Together

^{1}School of Science, Hangzhou Dianzi University, Hangzhou 310018, China^{2}School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004, China^{3}Department of Mathematics, Southeast University, Nanjing 210096, China^{4}Department of Mathematics, King Abdulaziz University, Jeddah 21589, Saudi Arabia

Received 9 July 2013; Accepted 22 August 2013

Academic Editor: Qiankun Song

Copyright © 2013 Jianbao Zhang et al. 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

A novel approach is brought forward for synchronization of a clustered network in this paper, the objective of which is twofold. The first one is to study cluster synchronization by analyzing the inner coupling matrices of the individual clusters instead of the one of the whole network. The other is to show that full synchronization can be ensured by several types of cluster synchronization, the partitions of which are connected together. Compared with the classical method for full synchronization, our approach reduces the network size to the cluster size and additionally obtains the thresholds for different types of cluster synchronization. As a numerical example, cluster and full synchronization in a special clustered network are investigated through our approach. It turns out that we obtain the same threshold for full synchronization as the one obtained by the classical method. Numerical simulations confirm the validity of our approach.

#### 1. Introduction

Collective behavior of complex networks has become a focal subject due to the important and extensive applications in various fields of science and technology. Full and cluster synchronization are two types of typical and fundamental collective behavior. The former means that all oscillators in a network acquire identical behavior, while the latter means that the coupled oscillators split into subgroups called clusters, and all the oscillators in the same cluster behave in the same fashion. Research on cluster and full synchronization has attracted increasing attention in the past decades.

Several effective methods have been applied to study full synchronization, which is also called complete synchronization. Pecora and Carroll proposed the famous master stability function method to study the local stability of the synchronous state [1], while Lyapunov function method was employed to study the global stability of the synchronous state [2–4]. With the help of the two classical methods mentioned above, a great deal of research has been carried out in recent years. By imposing constraints on the coupling strength, local stability of the synchronous states in arbitrarily coupled systems was ensured based on Gershörin disk theory [5]. By analyzing the characters of the network topology, connection graph stability method was put forward [2] and applied to study synchronization in a network with time-dependent on-off coupling, which is also called blinking model [3]. By decomposing the space into a direct sum of the synchronization manifold and the transverse space, criteria were obtained for both local and global stability of the synchronous state [4].

Cluster structures can be found to exist widely in real-world networks such as circles of friends or colleagues in social networks [6], compartments in food webs [7], groups of web pages sharing identical topics in the World Wide Web [8], and functional modules such as proteins having the same function in biological networks [9]. In those clustered networks, cluster synchronization usually occurs firstly before full synchronization occurs. Therefore, research on cluster and full synchronization in clustered networks has very obvious practical significance. Synchronization in a clustered network composed of two BA scale-free subnetworks has been studied in [10]. Control schemes were proposed for synchronization between two clusters, which is also called outer synchronization [11]. With the help of the method in [4], a criterion for cluster synchronization was obtained in [12]. Based on the criterion, cluster synchronization bifurcations are analyzed in a globally coupled network with a parameter [13].

However, to the best of our knowledge, most of the previous research on cluster and full synchronization focused on the topology of the whole network, which may be very complex. In this paper, the complexity of a clustered network is simplified by partitioning the whole network into clusters under a certain hypothesis. It is proved that cluster synchronization can be ensured by suitable inner couplings of the clusters, and sufficient conditions, which are independent of the outer couplings between different clusters, are obtained theoretically. Based on this result, a novel method for full synchronization is derived. If there exist two or several partitions connected together along some arrangement of all the oscillators, which imply that the intersection of the cluster synchronization manifolds corresponding to those partitions is equal to the full synchronization manifold, then full synchronization occurs if cluster synchronization corresponding to every partition is ensured. The method declares that both cluster and full synchronization can be studied by the inner topologies of the individual clusters. Obviously, the network size reduction provides convenience for the studies on synchronization in clustered networks with great mounts of oscillators.

The rest of the paper is organized as follows. Section 2 is devoted to introducing some concerned concepts such as partitions and cluster synchronization manifolds. Sufficient conditions independent of the outer couplings between different clusters are obtained for cluster synchronization in Section 3. The tedious proof of this result is carried out in the Appendix. The concept of partitions connected together along some arrangement is proposed and employed to study full synchronization in Section 4. In order to confirm the validity of the theoretical results, numerical experiments are carried out in Section 5. The final section is devoted to a brief discussion of the obtained results.

#### 2. Preliminaries

Consider a network composed of oscillators where is the state variable of the th oscillator, is a continuous time, is a continuous map, is the coupling strength, is a nonnegative matrix, is the coupling matrix with for , and for .

Suppose that the index set of the oscillators is divided into nonempty subsets called clusters. Let be its partition; that is, for and . The following denotations are introduced for every . Denote the cardinal number of cluster by , and denote the subscript of the cluster containing by ; that is, if . Suppose that all oscillators in the cluster are arranged adjacently; that is, , where , . Suppose that for and for . It can be seen that for any , synchronization of the oscillators corresponding to cluster always occurs for any since contains only one oscillator.

We will discuss sufficient conditions for the oscillators corresponding to to synchronize with each other, . Before that, the following sets should be introduced for every . The synchronization submanifold of the cluster is as follows: The cluster synchronization manifold of the partition is as follows: The transverse subspace for is as follows: The transverse space for is as follows:

In case , the synchronization manifold is called a full synchronization manifold. For simplicity, we denote the full synchronization manifold by and the corresponding transverse space by .

Definitions of cluster and full synchronization in the network (1) are listed as follows. The cluster synchronization manifold is said to be globally attractive for the network (1), or cluster synchronization of the partition occurs, if, for any initial condition , where denotes 2-norm of vectors. In case of , the full synchronization manifold is said to be globally attractive for the network (1); that is, full synchronization occurs.

#### 3. Result on Cluster Synchronization

Before the results on cluster synchronization are carried out, two common hypotheses in previous related research should be introduced.

At first, a synchronization manifold is always supposed to be an invariant manifold in order to discuss its attractiveness. The following lemma gives a sufficient and necessary condition for a cluster synchronization manifold being an invariant manifold.

Lemma 1 (see [12]). * Partition the coupling matrix according to partition as follows:
**
where ; the synchronization manifold is an invariant manifold of the network (1), if and only if every submatrix has equal-row-sum , . *

According to Lemma 1, we carry out the first hypothesis ().

Every submatrix in the partitioned matrix (7) has equal-row-sum ; that is, for every , there holds , . In addition, suppose that all the principal submatrices , , are irreducible.

In order to study the inner couplings of the cluster , we put forward the following matrix: where is an identity matrix. Then the elements of satisfy that for , and where , . We will study the dependence of cluster synchronization on the matrices , . Noticing the importance of the matrix , we call it a principal quasi-submatrix of the cluster since is a principal submatrix, .

The second crucial hypothesis is the individual oscillator dynamics satisfying condition as follows [12].

There exists a positive-definite diagonal matrix , with a diagonal matrix satisfying for and a constant , such that holds for any and all .

Hypothesis () means that the following two coupled oscillators: can synchronize when the coupling is made sufficiently large. Many chaotic oscillators have been proved to satisfy the hypothesis, such as Chua circuits [14], standard Hopfield neural networks [4], and -coupled [15, 16] or -coupled Lorenz systems [17] in an absorbing domain . However, many other systems are not the case such as a lattice of -coupled Rössler systems, in which the stability of synchronization regime is lost with the increasing of coupling [18].

Now, the preliminaries above, together with Lyapunov function method, bring us to the following theorem.

Theorem 2. *Suppose that hypotheses and hold and that
**
where is the second-largest eigenvalue of , , and the synchronization manifold is globally attractive for the network (1). *

For a rigorous proof of Theorem 2, the reader is referred to the Appendix.

As a special case, if all the row sums of are equal to zero, then also has zero row sums, and , . Therefore, condition (12) is equivalent to

#### 4. Result on Full Synchronization

Suppose that there are a set of partitions , , satisfying hypothesis . The following definition is put forward for the first time to study full synchronization.

*Definition 3. *Rearrange the numbers as . A set of partitions , are connected together along the arrangement , if, for every , there exists a subset such that .

For example, the set has two partitions as follows: Since and form a set of partitions connected together along the arrangement .

From the definition above, we obtain the following lemma.

Lemma 4. *A set of partitions , are connected together along some arrangement , if and only if the cluster synchronization manifolds of those partitions satisfy that
*

The proof of Lemma 4 is straightforward and will not be given here.

Now, we are in a position to carry out the following theorem on full synchronization of the network (1).

Theorem 5. *There are a set of partitions , , connected together along some arrangement and satisfying hypothesis . Then under hypothesis , the full synchronization manifold is globally attractive for the network (1) if
**
where is the second-largest eigenvalue of , , . *

The proof of Theorem 5 can be completed by combining Theorem 2 and Lemma 4, and so it is omitted here.

As a special case, if all the row-sums of are equal to zero, condition (17) is equivalent to

#### 5. Numerical Examples

Consider the system (1) composed of neural networks where , , , , and With the help of matlab LMI Control Toolbox, hypothesis can be satisfied by taking and , where [4].

Define the coupling matrix as follows: The topology structure corresponding to the matrix (21) is shown in Figure 1. It is easy to show that the following partitions satisfy : the principal quasi-submatrices of which are respectively. Further calculations give rise to the eigenvalues sets of the principal quasi-submatrices mentioned above as follows:

Obviously, partitions and are connected together along the arrangement . According to Theorems 2 and 5, one concludes the following. (1)If , cluster synchronization of partition occurs. (2)If , cluster synchronization of partition occurs. (3)If , full synchronization occurs.

These results can be seen more clearly in Figure 2, the red solid lines in which are threshold lines of for full synchronization.

In order to be compared with the previous classical results on full (complete) synchronization, the second-largest eigenvalue of should be obtained, and the threshold for full synchronization should be [1, 4]. In fact, the eigenvalues set of is Therefore, . Obviously, there is a good agreement between our result and the previous classical results.

Define the following cluster errors: where . Take and let increase from to step by step. Figure 3(a) shows that the cluster error reaches zero firstly, while and reach zero at the same value of . While fixing at , Figure 3(b) shows that reaches zero firstly, while and reach zero at the same value of .

In fact, these results can be forecasted in Figure 2. If the parameter is fixed in and if increases gradually, synchronization of the partition will firstly occur, and then synchronization of and full synchronization occur at the same value of since . Therefore, the effectiveness of the theoretical results is confirmed.

#### 6. Conclusions

This paper has investigated cluster and full synchronization in a clustered network. In order to study cluster synchronization, we propose the concept of principal quasi-submatrices corresponding to the individual clusters, which represent the inner couplings of the individual clusters. Theoretically, sufficient conditions independent of the outer couplings between different clusters are obtained for cluster synchronization. In order to study full synchronization, we propose the concept of partitions connected together along some arrangement. If all types of cluster synchronization of those partitions are ensured, it is proved that full synchronization occurs. The results are more advantageous than the classical results. Firstly, it allows us to divide a network composed of great amounts of oscillators into some smaller subnetworks. The network size reduction provides convenience to reduce the great amounts of calculations. Secondly, our approach can be applied to study cluster synchronization corresponding to any possible partitions. In summary, this paper has proposed a novel, convenient, and double purpose approach for both cluster and full synchronization in clustered networks.

#### Appendix

Denoting , we define the following cluster errors for : , , ;, , ;, , .*Proof. * Denote and rewrite the network (1) as follows:
Therefore,
where
Noticing that and
we have
Let ; it can be seen that is independent of .

In order to utilize the QUAD condition, a Lyapunov function is defined as follows,
The derivative of with respect to time is as follows:
Noticing that , we have
which together with hypothesis leads to
Noticing the equality (8), that is, , where , we have
The proof will be completed by showing that and as follows.

As we know, the symmetric matrix has the famous decomposition , where satisfying , and is a unitary matrix; that is, . The th column of is the eigenvector of corresponding to the eigenvalue . By the substitutions of variables , , we have
Noticing that the matrices , , , and are all diagonal matrices, we obtain
where , , . It is well known that the first column of is ; then one can conclude from the inverse substitutions of variables that , , . Therefore, condition (12) is sufficient for .

Finally, some techniques in [2, page 164] are employed to show that as follows:
where and is the th column of . Substituting and by (9), we have
The proof is completed.

#### Acknowledgments

This project was supported the by the National Natural Science Foundation of China (Grant nos. 11162004 and 60964006), Zhejiang Provincial Natural Science Foundation of China (no. LQ12a01003), the Science Foundation of Guangxi Province (no. 2013GXNSFAA019006), and the Deanship of Scientific Research (DSR), King Abdulaziz University, under Grant no. 3-130/1434/HiCi. The authors, therefore, acknowledge the technical and financial support of KAU.

#### References

- L. M. Pecora and T. L. Carroll, “Master stability functions for synchronized coupled systems,”
*Physical Review Letters*, vol. 80, no. 10, pp. 2109–2112, 1998. View at Scopus - V. N. Belykh, I. V. Belykh, and M. Hasler, “Connection graph stability method for synchronized coupled chaotic systems,”
*Physica D*, vol. 195, no. 1-2, pp. 159–187, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - 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 - W. Lu and T. Chen, “New approach to synchronization analysis of linearly coupled ordinary differential systems,”
*Physica D*, vol. 213, no. 2, pp. 214–230, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. H. Chen, G. Rangarajan, and M. Z. Ding, “Stability analysis of synchronized dynamics in coupled systems,”
*Physical Review E*, vol. 67, Article ID 026209, 4 pages, 2003. - M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,”
*Proceedings of the National Academy of Sciences of the United States of America*, vol. 99, no. 12, pp. 7821–7826, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. E. Krause, K. A. Frank, D. M. Mason, R. E. Ulanowicz, and W. W. Taylor, “Compartments revealed in food-web structure,”
*Nature*, vol. 426, no. 6964, pp. 282–285, 2003. View at Publisher · View at Google Scholar · View at Scopus - G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee, “Self-organization of the web and identification of communities,”
*IEEE Computer*, vol. 35, no. 3, pp. 66–70, 2002. - A. W. Rives and T. Galitski, “Modular organization of cellular networks,”
*Proceedings of the National Academy of Sciences of the United States of America*, vol. 100, no. 3, pp. 1128–1133, 2003. View at Publisher · View at Google Scholar · View at Scopus - C. Feng, Y. L. Zou, and F. Q. Wei, “Synchronization processes in clustered networks with different inter-cluster couplings,”
*Acta Physica Sinica*, vol. 62, no. 7, Article ID 070506, 7 pages, 2013. - X. Wu, W. X. Zheng, and J. Zhou, “Generalized outer synchronization between complex dynamical networks,”
*Chaos*, vol. 19, no. 1, article 013109, 9 pages, 2009. View at Publisher · View at Google Scholar · View at MathSciNet - W. Wu and T. Chen, “Partial synchronization in linearly and symmetrically coupled ordinary differential systems,”
*Physica D*, vol. 238, no. 4, pp. 355–364, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Z. J. Ma, S. Z. Zhang, and G. R. Jiang, “Effect of the coupling matrix with a weight parameter on synchronization pattern in a globally coupled network,”
*Nonlinear Dynamics*, 2013. View at Publisher · View at Google Scholar - C. W. Wu and L. O. Chua, “Synchronization in an array of linearly coupled dynamical systems,”
*IEEE Transactions on Circuits and Systems. I*, vol. 42, no. 8, pp. 430–447, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - 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 - Z. Ma, Z. Liu, and G. Zhang, “A new method to realize cluster synchronization in connected chaotic networks,”
*Chaos*, vol. 16, no. 2, aricle 023103, 9 pages, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - X. Liu and T. Chen, “Boundedness and synchronization of $y$-coupled Lorenz systems with or without controllers,”
*Physica D*, vol. 237, no. 5, pp. 630–639, 2008. View at Publisher · View at Google Scholar · View at MathSciNet - J. F. Heagy, L. M. Pecora, and T. L. Carroll, “Short wavelength bifurcations and size instabilities in coupled oscillator systems,”
*Physical Review Letters*, vol. 74, no. 21, pp. 4185–4188, 1995. View at Publisher · View at Google Scholar · View at Scopus