- 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

Abstract and Applied Analysis

Volume 2013 (2013), Article ID 802859, 9 pages

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

## Generalized Outer Synchronization between Complex Networks with Unknown Parameters

^{1}School of Mathematics and Statistics, Wuhan University, Wuhan 430072, China^{2}School of Mathematics and Statistics, South-Central University for Nationalities, Wuhan 430074, China

Received 20 August 2013; Accepted 5 December 2013

Academic Editor: Massimo Furi

Copyright © 2013 Di Ning 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

As is well known, complex networks are ubiquitous in the real world. One network always behaves differently from but still coexists in balance with others. This phenomenon of harmonious coexistence between different networks can be termed as “generalized outer synchronization (GOS).” This paper investigates GOS between two different complex dynamical networks with unknown parameters according to two different methods. When the exact functional relations between the two networks are previously known, a sufficient criterion for GOS is derived based on Barbalat's lemma. If the functional relations are not known, the auxiliary-system method is employed and a sufficient criterion for GOS is derived. Numerical simulations are further provided to demonstrate the feasibility and effectiveness of the theoretical results.

#### 1. Introduction

The past decade has seen many important achievements in the research of synchronization of complex networks. Most of this research has been focused on the coherent behavior within a network, where all the nodes within a network arrive at the same steady state [1–7]. This kind of synchronization, which was termed as “inner synchronization” [8], has attracted wide attention. However, in many real-world complex networks, there exist other kinds of synchronization, such as “outer synchronization” between two networks [8, 9], where the “complete outer synchronization” was studied under the assumption that all individuals in two networks have exactly identical dynamics. However, this kind of assumption may seem impractical. Take the predator-prey interactions in ecological communities as an example, where predators and preys influence one another’s behaviors. Without preys there would not be predators, while too many predators would bring the preys into extinction. The networks of predators and preys will finally reach harmonious coexistence without any man-made sabotage. It is worth noting that inside the networks of predators or preys, one individual always behaves differently from another. Thus it is more practical to assume that the nodes have different dynamics. Furthermore, the interaction patterns of predators themselves usually differ from those of preys; that is to say, the topological structure of the predators community is different from that of the preys community. There are a great many examples about harmonious coexistence between different real-world networks.

This kind of coexistence between different dynamical networks is termed as “generalized outer synchronization” [10], which represents another degree of coherence. As is known, due to parameter variation, various dynamics, or random perturbations, one individual always behaves differently from but still coexists in balance with others. That is to say, generalized synchronization widely exists. Particularly, it plays an important role in engineering networks [11–13], biological systems [10], social activities, and many other fields. Therefore, it is necessary and significant to investigate this kind of relationships between different dynamical networks.

In general, the methods to achieve GS can be divided into two classes. One approach is to design control laws to force coupled systems to satisfy a prescribed functional relation. But this approach has the disadvantage that the designed controllers are usually quite complicated and thus difficult to implement in real applications. The other is the auxiliary-system approach, proposed by Abarbanel et al. [2], which makes an identical duplication of the response system that is driven by the same driving signal, as shown below: where are, respectively, the states of the drive, response, and auxiliary systems. GS between and occurs if for any initial conditions , that is, if the response system and the auxiliary system achieve complete synchronization (CS). This method has been widely used in many fields and also extended to the area of complex networks [14–16]. It is noticed that it fails to decide what kind of functional relations exists between each other when nodes of the network achieve GS. However, if the purpose is only to show that there exists GS on networks rather than the exact functional relations, this approach is efficient for investigation of GS on complex networks.

Some recent work [10, 17–23] has studied generalized outer synchronization (GOS) in complex networks or complex systems, where the node dynamics parameters are known in advance. Nevertheless, in many practical situations, it is common that some system parameters cannot be exactly known in prior, and the synchronization will be destroyed and broken by the effects of these uncertainties.

Motivated by the above discussions, generalized outer synchronization between two dynamical networks with unknown parameters is investigated, where nodes in the two networks may have identical or different dynamics and the topological structures are different. Since the functional relations may be previously known or unknown, two kinds of generalized synchronization are considered.

The paper is organized as follows. In Section 2, GOS between two networks with predefined functional relations is investigated and the theoretical result is presented. In Section 3, based on the auxiliary-system method, GOS with unknown functional relations is studied. In Section 4, various numerical simulations are provided to demonstrate the feasibility and effectiveness of the theoretical results. A brief conclusion is drawn in Section 5.

#### 2. GOS with Predefined Functional Relations

Consider the following complex dynamical network consisting of nonidentical nodes as the drive network, which is described by Here, is the state vector of the th node, represents the node dynamics, is the unknown parameter vector, is the inner-coupling matrix determining the interaction of variables, and is the coupling configuration matrix representing the coupling strength and the topological structure of the network, in which is defined as follows: if there is a connection from node to node , ; otherwise, . The diagonal elements of matrix are defined as

Consider another complex network which will be referred to as the response network with a different topological structure and nonidentical node dynamics as follows: where is the state vector of node , represents the node dynamics which contains the unknown parameter vector , are the controllers to be designed, and the other notations convey similar meanings as those in the drive network.

*Definition 1. *Let be continuously differentiable vector maps. The two networks (2) and (4) are said to achieve asymptotical generalized outer synchronization if

*Assumption 2 (global Lipschitz condition). *Suppose that there exist nonnegative constants , such that for any time-varying vectors , , one has
where denotes the 2-norm throughout the paper.

When the functional relations are known, one arrives at the following theorem with the network models given above.

Theorem 3. *Suppose that Assumption 2 holds. The dynamical networks (2) and (4) reach generalized outer synchronization as defined in Definition 1 with the following controllers:
**
and updating laws
**
where and are positive constants, and is the Jacobian matrix of the map .*

*Proof. *Define . From (2) and (4), one has
where .

Consider the following Lyapunov candidate function:
The derivative of along the trajectory of (9) is

Denote . Let , , , and let be the largest eigenvalue of the matrix. Thus one has

Let
one obtains

Obviously, , so is uniformly continuous. Furthermore, ; that is, exists, then is integrable on . According to Barbalat’s lemma, one gets , thus for . That is, networks (2) and (4) achieve generalized outer synchronization asymptotically. This completes the proof.

#### 3. GOS with Unknown Functional Relations

The preceding section focuses on GOS between networks (2) and (4) with previously known relations , . However, the functional relations are sometimes unknown. For this case, one has to refer to the auxiliary-system method proposed by Kocarev and Parlitz [24]. According to the method, one can make a replica for each system in the response network (4), which results in the following network: where . The drive network (2) and the response network (4) are said to achieve generalized outer synchronization; if the response network (4) and the auxiliary network (15) reach complete outer synchronization, that is, for any initial conditions .

*Assumption 4 (global Lipschitz condition). *Suppose that there exist nonnegative constants , such that
holds for any time-varying vectors , , where is the parameter vector.

Theorem 5. *Suppose that Assumptions 2 and 4 hold. Using the following controllers:
**
and updating laws
**
then the drive network (2) and the response network (4) reach generalized outer synchronization.*

*Proof. *According to the auxiliary-system method, networks (2) and (4) achieve generalized outer synchronization if networks (4) and (15) reach complete outer synchronization. Define the synchronization error between (4) and (15) for the th node as . Then the error dynamical systems can be described by

Let and . Then the error dynamical systems can be rewritten into
where .

Consider the following Lyapunov candidate function:
The derivative of along the trajectory of (20) is
where and .

Let , , , and have the same meaning as that in the proof of Theorem 3, then it turns out

Taking
one obtains

According to Barbalat’s lemma, networks (4) and (15) achieve complete outer synchronization; that is, networks (2) and (4) achieve generalized outer synchronization. This completes the proof.

#### 4. Numerical Simulations

In this section, numerical simulations are carried out on networks consisting of 20 nodes to verify the effectiveness of the control schemes obtained in the preceding sections. Watts-Strogatz (WS) [25] algorithm is employed here to generate a small-world network. Specifically, start from a ring-shaped network with 20 nodes, with each node connecting to its 4 nearest neighbors. Then, rewire each edge in such a way that the beginning end of the edge is kept but the other end is disconnected with probability and reconnected to another node randomly chosen from the network. In all the following simulations, a WS small-world network generated with rewiring probability , as shown in the left panel of Figure 1, is used as the topological structure for the drive network. Moreover, a directed ring network is employed as the structure of the response network, as shown in the right panel of Figure 1. The weight for every existent edge is supposed to be 0.01. For brevity, the inner-coupling matrices and are taken as identity matrices with proper dimensions.

##### 4.1. GOS with Known Functional Relations

###### 4.1.1. GOS with Identical Node Dynamics

In this subsection, it is supposed that nodes in the drive and response networks have the same dynamics described by the well-known Lorenz system [26]: where the parameter vector is unknown. Since Lorenz system is chaotic, it is easy to verify that it is bounded. Figure 2 displays a typical Lorenz chaotic attractor.

For a response network (4) consisting of identical Lorenz systems, one has and the unknown parameter vector is .

First consider complete outer synchronization between the drive and response networks; that is, the functional relations are The feedback gain in the controllers is taken as 10, and the gains , in the updating laws (8) are taken as 10. The left panel of Figure 3 displays the GOS error between the drive and response networks, where and means averaging over all the nodes. One can see from the panel that complete outer synchronization is quickly achieved by employing the control method proposed in Theorem 3. The right panel of Figure 3 shows the estimated evolution of unknown parameters in the drive and response networks. It is obtained that all the estimated parameters evolving with the updating laws (8) tend to some certain constants, which is consistent to the proof of Theorem 3.

Next, consider the following nonlinear functional relations: then

The GOS error between the drive and response networks is displayed in Figure 4. It is obvious that the two networks reach generalized outer synchronization with the proposed controller and updating laws (8). The phase diagrams of node in both networks are displayed in Figure 5. Some corresponding subvariables of node 3 are also depicted in Figure 6, where transients are discarded. The relationships between dynamics of corresponding nodes in the two networks can be clearly observed.

###### 4.1.2. GOS with Different Node Dynamics

In this subsection, the classical Lorenz system is still taken as the node dynamics in the drive network. Chen system [27] is taken as the node dynamics in the response network, which is described by where the parameter vector is supposed to be unknown. A typical Chen attractor is shown in Figure 7.

Let the functional relations be Thus

Figure 8 displays the GOS error between the two different networks, with , . It is obvious that tends to zero after a short transient period. Figure 9 shows the dynamics of node 3 in the drive and response networks, where projections on different planes are displayed.

##### 4.2. GOS with Unknown Functional Relations

Take the node dynamics in the drive network to be Lorenz system with three unknown parameters and that in the response network to be the classical Chen system with two unknown parameters, as described by

Thus in the auxiliary network, the node dynamics is

Let in the controllers (17), and in the updating laws (18). Figure 10 displays the synchronization error between the response and auxiliary networks, where . One can see that when the control is imposed, the synchronization error quickly tends to zero, which means the existence of generalized outer synchronization between the drive and response networks. Figure 11 plots the dynamics of node 3 in the drive and response networks.

#### 5. Conclusions

Research on generalized outer synchronization between complex networks has attracted wide attention in the past few years. To the best of our knowledge, few works focused on the case that the node dynamics parameters are unknown. In this paper, the generalized outer synchronization between two complex dynamical networks with unknown parameters has been investigated, with previously known or unknown functional relations. The feasibility and applicability of the theoretical findings have been validated by numerical simulations.

#### Acknowledgments

This work was supported in part by the National Natural Science Foundations of China (Grant nos. 61174028, 11172215, and 91130022) and in part by the Fundamental Research Funds for the Central Universities (Grant no. CZQ11010).

#### References

- L. M. Pecora and T. L. Carroll, “Synchronization in chaotic systems,”
*Physical Review Letters*, vol. 64, no. 8, pp. 821–824, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - 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 - M. Barahona and L. M. Pecora, “Synchronization in small-world systems,”
*Physical Review Letters*, vol. 89, no. 5, Article ID 054101, 4 pages, 2002. View at Publisher · View at Google Scholar · View at Scopus - Y. Chen, G. Rangarajan, and M. Ding, “General stability analysis of synchronized dynamics in coupled systems,”
*Physical Review E*, vol. 67, no. 2, Article ID 026209, 4 pages, 2003. View at Scopus - 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 - J. Lü and G. Chen, “A time-varying complex dynamical network model and its controlled synchronization criteria,”
*IEEE Transactions on Automatic Control*, vol. 50, no. 6, pp. 841–846, 2005. View at Publisher · View at Google Scholar · View at MathSciNet - J. Zhou, J. Lu, and J. Lü, “Adaptive synchronization of an uncertain complex dynamical network,”
*IEEE Transactions on Automatic Control*, vol. 51, no. 4, pp. 652–656, 2006. View at Publisher · View at Google Scholar · View at MathSciNet - C. Li, W. Sun, and J. Kurths, “Synchronization between two coupled complex networks,”
*Physical Review E*, vol. 76, no. 4, Article ID 046204, 6 pages, 2007. View at Publisher · View at Google Scholar · View at Scopus - H. Tang, L. Chen, J. Lu, and C. K. Tse, “Adaptive synchronization between two complex networks with nonidentical topological structures,”
*Physica A*, vol. 387, no. 22, pp. 5623–5630, 2008. View at Publisher · View at Google Scholar · View at Scopus - X. Wu, W. X. Zheng, and J. Zhou, “Generalized outer synchronization between complex dynamical networks,”
*Chaos*, vol. 19, no. 1, Article ID 013109, 9 pages, 2009. View at Publisher · View at Google Scholar · View at MathSciNet - N. F. Rulkov, M. M. Sushchik, L. S. Tsimring, and H. D. I. Abarbanel, “Generalized synchronization of chaos in directionally coupled chaotic systems,”
*Physical Review E*, vol. 51, no. 2, pp. 980–994, 1995. View at Publisher · View at Google Scholar · View at Scopus - H. Suetani, Y. Iba, and K. Aihara, “Detecting generalized synchronization between chaotic signals: a kernel-based approach,”
*Journal of Physics A*, vol. 39, no. 34, pp. 10723–10742, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. D. I. Abarbanel, N. F. Rulkov, and M. M. Sushchik, “Generalized synchronization of chaos: the auxiliary system approach,”
*Physical Review E*, vol. 53, no. 5, pp. 4528–4535, 1996. View at Scopus - Y. Hung, Y. Huang, M. Ho, and C. Hu, “Paths to globally generalized synchronization in scale-free networks,”
*Physical Review E*, vol. 77, no. 1, Article ID 016202, 8 pages, 2008. View at Publisher · View at Google Scholar · View at Scopus - S. Guan, X. Wang, X. Gong, K. Li, and C. Lai, “The development of generalized synchronization on complex networks,”
*Chaos*, vol. 19, no. 1, Article ID 013130, 2009. View at Publisher · View at Google Scholar · View at Scopus - X. Xu, Z. Chen, G. Si, X. Hu, and P. Luo, “A novel definition of generalized synchronization on networks and a numerical simulation example,”
*Computers & Mathematics with Applications*, vol. 56, no. 11, pp. 2789–2794, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Chen, J. Lu, X. Wu, and W. X. Zheng, “Generalized synchronization of complex dynamical networks via impulsive control,”
*Chaos*, vol. 19, no. 4, Article ID 043119, 2009. View at Publisher · View at Google Scholar · View at Scopus - H. Liu, J. Chen, J. Lu, and M. Cao, “Generalized synchronization in complex dynamical networks via adaptive couplings,”
*Physica A*, vol. 389, no. 8, pp. 1759–1770, 2010. View at Publisher · View at Google Scholar · View at Scopus - Y. Sun, W. Li, and J. Ruan, “Generalized outer synchronization between complex dynamical networks with time delay and noise perturbation,”
*Communications in Nonlinear Science and Numerical Simulation*, vol. 18, no. 4, pp. 989–998, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Wu, C. Li, Y. Wu, and J. Kurths, “Generalized synchronization between two different complex networks,”
*Communications in Nonlinear Science and Numerical Simulation*, vol. 17, no. 1, pp. 349–355, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - N. Jia and T. Wang, “Generation and modified projective synchronization for a class of new hyperchaotic systems,”
*Abstract and Applied Analysis*, vol. 2013, Article ID 804964, 11 pages, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - W. He and J. Cao, “Generalized synchronization of chaotic systems: an auxiliary system approach via matrix measure,”
*Chaos*, vol. 19, no. 1, 10 pages, 2009. View at Publisher · View at Google Scholar · View at MathSciNet - G. Peng, Y. Jiang, and F. Chen, “Generalized projective synchronization of fractional order chaotic systems,”
*Physica A*, vol. 387, no. 14, pp. 3738–3746, 2008. View at Publisher · View at Google Scholar · View at Scopus - L. Kocarev and U. Parlitz, “Generalized synchronization, predictability, and equivalence of unidirectionally coupled dynamical systems,”
*Physical Review Letters*, vol. 76, no. 11, pp. 1816–1819, 1996. View at Scopus - D. Watts and S. Strogatz, “Collective dynamics of “small-world” networks,”
*Nature*, vol. 393, no. 4, pp. 440–442, 1998. View at Publisher · View at Google Scholar - E. N. Lorenz, “Deterministic nonperiodic flow,”
*Journal of the Atmospheric Sciences*, vol. 20, no. 2, pp. 130–141, 1963. View at Publisher · View at Google Scholar - G. Chen and T. Ueta, “Yet another chaotic attractor,”
*International Journal of Bifurcation and Chaos*, vol. 9, no. 7, pp. 1465–1466, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet