#### Abstract

A partial synchronization problem in an oscillator network is considered. The concept on a principal quasi-submatrix corresponding to the topology of a cluster is proposed for the first time to study partial synchronization. It is shown that partial synchronization can be realized under the condition depending on the principal quasi-submatrix, but not distinctly depending on the intercluster couplings. Obviously, the dimension of any principal quasi-submatrix is usually far less than the one of the network topology matrix. Therefore, our criterion provides us a novel index of partial synchronizability, which reduces the network size when the network is composed of a great mount of nodes. Numerical simulations are carried out to confirm the validity of the method.

#### 1. Introduction

Since the pioneering work of Pecora and Carroll [1], extensive researches on chaos synchronization have been carried out due to their potential applications in various disciplines such as physics, engineering, and biology [2–5]. For example, wireless sensor networks are widely researched due to the important applications in the real scenarios. One of the biggest challenges in investigating wireless sensor networks is how to obtain higher synchronization accuracy with minimal overhead [6]. And many other network-induced phenomena have also been discussed extensively in engineering [7].

Up to date, there have been many synchronization types being proposed and discussed, including complete synchronization [8, 9], partial synchronization [10], and inner and outer synchronization [11]. Generally speaking, there exists an intimate relationship between the phenomena of synchronization and invariant manifolds of coupled systems [9–12]. Thus, when we carry out researches on partial synchronization of coupled systems, it is always supposed that the corresponding full or partial synchronization manifolds are invariant manifolds. The established tools for the stability of invariant synchronization manifolds mainly consist of local linearization method and Lyapunov function method. One of the prominent results of the former is the master stability function method [9]. The method has obtained two significant factors determining the local stability of the synchronous state, that is, the maximum Lyapunov exponent of the node dynamics and the eigenvalues of the topology matrix. One of the prominent results of the latter is the study of the global attractiveness of the synchronization manifold. A crucial requirement for the method is the condition of the node dynamics satisfying[10]. In some sense, the condition means that the system can synchronize when the coupling is made sufficiently large. Recently, some new conditions have been obtained for synchronization of networks without Lipschitz condition or QUAD condition [12].

The type of synchronization concerned in this paper is partial synchronization. It means that the coupled oscillators split into subgroups called clusters, and all the oscillators in the same cluster behave in the same fashion. Many relative studies have been carried out [13–18]. By using pinning control strategy, partial synchronization of coupled stochastic delayed neural networks was discussed in [14]. Similar control strategy is also proposed to select controlled communities by analyzing the information of each community such as in-degrees and out-degrees [15]. Afterwards, some simple intermittent pinning controls and centralized adaptive intermittent controls are proposed [16]. However, a suitable control law must be presented in order to use pinning control strategy. Some other researches focused on partial synchronization induced by the coupling configuration. An arbitrarily selected partial synchronization manifold was constructed for a network with cooperative and competitive couplings [17]. Recently, a sufficient and necessary condition for partial synchronization manifolds being invariant manifolds was obtained in networks coupled linearly and symmetrically [10]. More significantly, some sufficient conditions for the global attractiveness of the partial synchronization manifold were derived by decomposing the whole space into a direct sum of the synchronization manifold and the transverse space. The results are meaningful and interesting. Based on the method in [10], partial synchronization bifurcations [19] were analyzed for a globally coupled network with a parameter, which topology is not complex. Nevertheless, all the eigenvalues of the topology matrix are essential for that method, which needs a large quantity of computation when the network size is very large.

In this paper, a novel criterion on partial synchronization is proposed through the analysis of principal quasi-submatrices corresponding to the clusters. Previous researches have obtained several criteria on partial synchronization [10]. However, these criteria depend heavily on the topology matrix of the whole network. For many complex networks in real world, it is tedious to obtain the eigenvalues and eigenvectors of the topology matrix of the whole network. Therefore, this paper aims to propose a novel criterion, which is not distinctly dependent on the intercluster couplings and the topology matrix of the whole network. Instead, it is sufficient for partial synchronization to verify that the conditions on the intracluster couplings are satisfied. Therefore, it will be advantageous to discuss partial synchronization in the complex network with a large number of nodes because the dimension of any principal quasi-submatrix is usually far less than the one of the network topology matrix. At first, the tedious work of solving the eigenvectors corresponding to the second-largest eigenvalue is avoided. Secondly, partial synchronization is studied by the inner topologies of the individual clusters. Obviously, the network size reduction provides convenience for the study of partial synchronization in networks with great mounts of oscillators. In order to confirm its effectiveness, some numerical simulations are carried out to study partial synchronization in a star-global network. The numerical simulations are in good agreement with the theoretical analysis.

The present paper is built up as follows. Some concerned concepts and a lemma for the invariance of the partial synchronization manifold are introduced in Section 2. Principal quasi-submatrices corresponding to the clusters are proposed, and our main results are then established in Section 3. Numerical examples are presented to confirm the effectiveness of the results in Section 4. Finally, a brief discussion of the obtained results is given in Section 5.

#### 2. Preliminaries

In this section, we introduce some basic concepts of invariant synchronization manifolds and a related lemma, which are required throughout the paper.

In past years, many studies [9, 10, 12] of synchronization phenomena focused on oscillator networks coupled linearly and symmetrically. The system can be described by the following ordinary differential equations: whereis the-dimensional state variable of theth oscillator,is the network size, is a continuous time,is a continuous map,is the coupling strength, andis a nonnegative matrix determining the interaction of variables. The coupling weight matrixis assumed to satisfy that, for, andfor.

In order to study partial synchronization of the system (1), the set of nodesis divided intononempty subsets (clusters). Letbe the partition, and denote, whereis the cardinal number of the cluster,. Without loss of generality, suppose thatBased on the partition, we rewrite the coupling matrixas a block matrix, where .

We will discuss sufficient conditions for thenodes in the clusterto synchronize with each other,. Before that, the concepts of partial synchronization manifolds and transverse spaces introduced in the following [10]: where , are called a partial synchronization manifold. We also call where a transverse space for.

In case, the four sets mentioned above are denoted by , , , and , respectively. In case, the synchronization manifoldis called a full synchronization manifold. For simplicity, we denote the full synchronization manifold by , and the corresponding transverse space by . Sometimes, the manifoldis also denoted byto emphasize its partition.

*Definition 1. *The synchronization manifoldis said to be globally attractive for the system (1), or the system (1) is said to realize partial synchronization with the partitionif, for any initial condition,
wheredenotes 2-norm of vectors. In case of, the system (1) is said to realize full synchronization, if the full synchronization manifold is globally attractive.

Synchronization manifolds are always supposed to be invariant in order to discuss the attractiveness. Therefore, it is necessary to recall the definition of an invariant manifold [20] for the ordinary differential equations, Denote as the manifold of codimensiondefined by a vector equation, , . is called an invariant manifold of the system (8) if which implies that the vector field (8) is tangent to . For more details of the existence of invariant manifolds, one can refer to the papers by Golubitsky and coworkers [21, 22]. The following lemma gives a sufficient and necessary condition for a partial synchronization manifold being an invariant manifold.

Lemma 2 (see [10]). *Let. The synchronization manifold is an invariant manifold of the system (1) if and only if the coupling matrixhas the form (2) with everybeing equal row sum.*

*Remark 3. *Based on Lemma 2, we can find all invariant synchronization manifolds for a given coupling matrix. As we know, each diagonal block reveals the intracluster information communication, and each nondiagonal block represents the information communication among different clusters. By the condition that everyis equal row sum, we mean that every node in the same cluster receive an equal amount of information communication from every other cluster.

#### 3. Main Results

Noticing the sufficient and necessary condition in Lemma 2, we assume that every submatrixis an equal row sum matrix with row sum,. Sinceis an equal row sum matrix, that is, , where the denotationrepresents, for all, we define the matrices as whereis the identity matrix,. It is easy to conclude from (10) that and Noticing thatis a principal submatrix of, we call the matrixa principal quasi-submatrix corresponding to the cluster,.

Now, we are now in a position to carry out the following theorem with the help of Lyapunov function method.

Theorem 4. *Let,be a positive-definite diagonal matrix, and letbe a diagonal matrix. Supposeif, where. Then under the following three conditions. *(i)*Every submatrixin the block matrix (2) has equal row sum, and every principal submatrixis irreducible.*(ii)*There exists a constantsuch that, for any and all ,
*(iii)*For all, , the matricesare negative semidefinite in the transverse space, that is,
**or, in particular,
**
where is the second-largest eigenvalue of.**The synchronization manifoldis globally attractive for the system (1).*

For convenience of the proof, the following notations are introduced. where.

Then any vectorcan be decomposed into Therefore, the attractiveness of the invariant synchronization manifoldis equivalent towhen; that is, the dynamical flow in the transverse subspaceconverges to zero.

*Proof. *Noticing the condition (i), one gets
Therefore,
where

In order to utilize the condition, a Lyapunov function is defined as follows:
One can conclude fromthat
and then,

Denote the second term in the right hand of (22) asfor convenience; then,
Sinceholds for the first term in the right hand above, replacingwithaccording to (11) gives rise to that
As a result of the condition (13), one obtains that
Since, the sumcan be decomposed into
Renaming in the second termby,by, and vice versa [23] and utilizing the symmetry of , or , one gets

Therefore, one obtains thatand
which implies that the partial synchronization manifoldis globally attractive for the system (1).

The remainder of the proof is to show that condition (14) is also sufficient for.

It is well known that a symmetric matrixhas the decomposition, whereis a real diagonal matrix andis an unitary matrix,. The diagonal elements ofare the eigenvalues ofsatisfying. Theth column ofis the eigenvector ofcorresponding to the eigenvalue. By changes of variables, the quadratic form (25) can be diagonalized as follows:
Noticing that the first column ofis, one can conclude fromandthat. Therefore, condition (14) is sufficient for.

The proof is completed.

Compared with the previous results [10], the conditions in Theorem 4 are not dependent on the intercluster couplings, which are eliminated in the proof through a set of mathematical skills in inequalities (25) and (27). The obtained results greatly reduce the network sizes theoretically. However, another question arises naturally: how to implement the proposed condition in reality? The following remarks might answer these questions.

*Remark 5. *In case that the network size is not very large and the coupling matrix is given, it is easy to verify all the conditions in Theorem 4. In case that the network consists of great mounts of oscillators, it should still be full of challenges to implement though our result reduces the network size greatly. And it might be hard to implement.

In order to make clear the implications of Theorem 4, several remarks on the conditions are given as follows.

*Remark 6. *Many chaotic oscillators have been proved to satisfy condition (ii), such as Chua circuits [24] and standard Hopfield neural networks [25]. 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 [26].

Providing that the trajectories of the uncoupled systems,are eventually dissipative, that is, the trajectories will be in the absorbing domain eventually, it has been proved that each trajectory of the coupled system (1) is also eventually dissipative and will be in the absorbing domain[17] eventually. Therefore, condition (ii) holds when the timeis large enough. For example, the uncoupled Lorenz system
is eventually dissipative, where
It has been proved that-coupled [27] or -coupled Lorenz systems [28] satisfy condition (ii) when the timeis large enough.

If there exists a such that , which implies that the subset contains only one element, which does not synchronize with any other node. Without loss of generality, suppose thatfor. In this case, the corresponding principal quasi-submatrix and the constantcan be regarded as the single eigenvalue ofsincefor any. Therefore, the second-largest eigenvaluedoes not exist. But notice the definition of partial synchronization in Section 2, synchronization in the clusteralways occurs, and conditions (13) and (14) should be regarded to hold for any,.

Sinceis irreducible and diffusive, the largest eigenvalue ofis zero, which is simple. Therefore, the largest eigenvalue ofis, and it is simple also. In case, it can be seen thatand condition (14) is equivalent to
Condition (14) provides us a novel index of partial synchronizability.

#### 4. Numerical Examples

Consider the system (1) with-coupled Lorenz systems wheredefined by the system (30),. Let, and, and thein (27) has been proved to satisfy condition (ii) when the timeis large enough. Through translating time, the network system (27) satisfies condition (ii) in Theorem 4.

##### 4.1. A Star-Global Network

Design the following topology matrix of the system (33) as whereis the coupling weight parameter of couplings between the two clusters, and the identity matriximplies that theth () oscillator in the first cluster is coupled with theth oscillator in the second cluster. As a special case, the submatricesandare taken as follows: Obviously,andare the topology matrices of a globally coupled network and a star-coupled network, respectively. Therefore, we call the network a star-global (coupled) network.

##### 4.2. Numerical Simulations

As an example, the topology structure of a star-global network with is shown in Figure 1. Due to the specific topological structure of the network, the following partitions satisfy condition ,

*Remark 7. *According to the criterion in the previous researches [10], we should firstly find the eigenvalues and the corresponding eigenvectors of thematrix . As we know, it should be of a vast amount of calculations. However, based on Theorem 4, it is enough for partial synchronization with the partition if we can find the eigenvalues of two (matrices). Obviously, Theorem 4 reduces the calculations greatly.

The principal quasi-submatrices corresponding to the clusters in the partitionsor, areorand, respectively. And denote the ones in the partitionasand. Further analysis gives rise to the eigenvalues sets of the quasi-submatrices, where,. Therefore, partial synchronization with the partitionoccurs if; partial synchronization with the partitionoccurs if; and full synchronization with the partitionoccurs if. These are seen much more clearly in Figure 2.

By fixingand increasinggradually, partial synchronization with the partitionwill firstly occur; then, the one withand full synchronization occurs at the same time. Figure 2 also implies that the threshold for partial synchronization with the partitionis sufficient for full synchronization.

In order to validate the effectiveness of Figure 2 numerically, the following average cluster errors of the system (33) are defined to measure partial synchronization with partitions, and, respectively,

Choose the initial conditions, and randomly on, and pick. Fix the coupling weight at , and; the dependence of the cluster errors onis shown, respectively, in Figure 3. As can be seen, there is a good agreement between Figures 3 and 2.

(a) |

(b) |

#### 5. Conclusions

In summary, this paper introduced a novel index of partial synchronizability of a network. It is shown that partial synchronization can be ensured by the conditions merely on the quasi-submatrices corresponding to the clusters. If a network is composed of a great mount of nodes, the enormous amount of calculation can be reduced by replacing the coupling matrix with several quasi-submatrices. Numerically, different types of partial synchronization occur in a star-global network when the coupling strength is increased, the order of which is forecasted accurately by our result. It should be a meaningful and effective method to study partial synchronization with different partitions.

In the past decades, the networked control systems have attracted much attention due to their applications covering a wide range of industries. And the network-induced phenomena under consideration in engineering have been discussed widely, including missing measurements [29], fading measurements [30], and probabilistic sensor delays [31]. Therefore, the obtained approach for partial synchronization in this paper might be applicable to the complex networks with networked induced phenomena. The related studies should be one of the future research topics.

#### Conflict of Interests

The authors declare that they have no conflict of interests regarding the publication of this paper.

#### Acknowledgments

The authors gratefully acknowledge the support of the Natural Science Foundation of Zhejiang Province (no. LQ12A01003), the Natural Science Foundation of Hebei Province in China (no. A2014205152), the Natural Science Foundation of Guangxi Province (no. 2013GXNSFAA019006), and the National Natural Science Foundation of China (nos. 11162004 and 11171084).