Research Article | Open Access

# Global Synchronization in Complex Networks with Adaptive Coupling

**Academic Editor:**Dane Quinn

#### Abstract

Global synchronization in adaptive coupling networks is studied in this paper. A new simple adaptive controller is proposed based on a concept of asymptotically stable led by partial state variables. Under the proposed adaptive update law, the network can achieve global synchronization without calculating the eigenvalues of the outer coupling matrix. The update law is only dependent on partial state variables of individual oscillators. Numerical simulations are given to show the effectiveness of the proposed method, in which the unified chaotic system is chosen as the nodes of the network with different topologies.

#### 1. Introduction

Synchronization in complex networks of identical chaotic oscillators has been studied extensively and deeply in various fields of science and engineering in the last few years [1–18]. Some effective methods have been proposed to investigate the stability of the synchronous state of linearly coupled networks. In [2], Pecora and Carroll developed a useful approach, called the Master Stability Function, to the local synchronization for any linear coupling networks. Based on the calculation of the eigenvalues of the outer coupling matrix, this method has been widely used in local stability studies of synchronization in linearly coupled complex networks [3–6]. Global synchronization based on the eigenvalues of the outer coupling matrix was also obtained for undirected [1] and directed [7] networks. These studies show that both local and global synchronization mainly depend upon the eigenvalues of the outer coupling matrix. However, the eigenvalues can be calculated only for simple coupling schemes. For more complicated networks, it becomes a difficult task.

In [8–10], an alternate way is developed to achieve network synchronization, which does not depend on explicit knowledge of the eigenvalues of the outer coupling matrix. This approach combines the Lyapunov function approach with graph theoretical reasoning. It guarantees global synchronization, not just local stability, and is also valid for time-varying networks. In [11–18], adaptive control strategy is used to guarantee local and global synchronization in complex networks. Especially in [11], Zhang et al. present a concept of -leading asymptotically stable, and study the synchronization in complex networks with adaptive coupling. In [12], Huang studies the global synchronization in an adaptive weighted network, but the coupling strengths between two connected nodes are vector functions.

In [11], however, leading asymptotically stable is achieved by only one state variable. In actual fact, some systems are difficult to meet this condition. Those systems are asymptotically stable led by more than one state variable; moreover, the coupling strengths are not vector functions in practice. Inspired by the upper notions, this paper presents the concept of leading asymptotically stable which means that the system achieves asymptotically stable led by partial state variables and studies the global synchronization in an adaptive coupling network whose coupling strengths are not vector function. By using Lyapunov’s direct method, under a simple adaptive update law, such network can achieve global synchronization finally. The synchronization strategy is setting adaptive coupling strength between two connected nodes, and the adaptive update law of is only relation to partial state variables of connected nodes and . The regular star coupled network and ring coupled network are simulated, in which the unified chaotic system is chosen as the dynamical node in the network. The simulation results also show the effectiveness of the proposed adaptive method.

Another active research named consensus or agreement considers the information exchange between the connected agents [19–22]. The aim is to set consensus protocols or coupling scheme to reach agreement on graph and the network could have switching topology [20, 21]. Of course, the consensus state is usually time-invariant [20], such as, average-consensus, max-consensus, min-consensus, and so on. To some extent, consensus is the special case of synchronization but quite independently studied.

#### 2. Network Model and Preliminaries

Consider an undirected complex dynamical network consisting of identical coupled nodes. The dynamical behavior of the network can be described by the following ordinary differential equations: where is the state vector representing the state variables of node . is a smooth nonlinear vector-valued function. is the inner coupling matrix, where are some constants.

The outer coupling matrix represents not only the topological structure of the network, but also the weight strength, in which is defined as follows: if there is a connection between node and node , then ; otherwise, . Suppose network (2.1) is diffusively coupled, that is, the diagonal elements of matrix are defined by

Here the coupling strengths depend on the corresponding two nodes (i.e., depends on subscripts and ) and time . Simply speaking, our network is a weighted network. For convenience, we replace with in the following.

*Definition 2.1. *An equilibrium point of a dynamical system is leading asymptotically stable if the asymptotical stability of can lead the asymptotical stability of .

*Remark 2.2. * The -leading asymptotically stable in [11] is a special case of in our definition.

Letting , it is obvious that and the error system is

The coupled network (2.1) is said to achieve global synchronization if

from arbitrary initial values.

#### 3. Main Result

Now we can drive the following main result.

Theorem 3.1. *Suppose that system (2.3) satisfies the following conditions.**Nonlinear function satisfies the uniform Lipschitz condition, that is, for all , there exists a constant satisfying .**Equilibrium point is leading asymptotically stable.**The nonzero weight strength satisfy the following adaptive update law
Then network (2.1) with coupling strength (3.1) will achieve global synchronization as , where are some arbitrary constants, .*

*Proof. *Let the Lyapunov function be
where is a large positive constant. Obviously, it is positive definite about . The time derivative of along the trajectory of the system (2.1) with coupling strength (3.1) is given by

From condition (I), the first sum holds. And the second sum can be calculated as follows. Since we can see that
Renaming the summation index by in the second term and vice versa, the second term becomes identical to the first and we obtain
Using we get
Renaming by in the second term and vice versa, and using the symmetry of we obtain
Since and the symmetry of we get
So
Because of for large constant it holds that , where . So is negative definite about According to Lyapunov’s direct method, starting with arbitrary initial values, Since equilibrium point of system (2.3) is leading asymptotically stable, so network (2.1) can reach global synchronization as . This completes the proof.

*Remark 3.2. * Condition (I) is easily satisfied if () are bounded. And a number of chaotic systems satisfy this condition, such as Rössler system and unified chaotic system.

*Remark 3.3. * In practice, we can set and the adaptive update law is .

*Remark 3.4. * By (3.1), the nonzero coupling strength when the network achieves synchronization, where are some positive constants.

*Remark 3.5. * Our synchronization strategy is setting adaptive coupling strengths between two nodes to achieve global synchronization, and our adaptive update law of is only relation to partial state variables of connected nodes and .

#### 4. Illustrative Example

To demonstrate the theoretical result in Section 3, two regular networks with the unified chaotic system are chosen as simulation examples in this section.

The unified chaotic [23] system is described by

When , it has well-known chaotic behavior.

We consider , that is,

The error system is

In order to use our Theorem, we need the following Lemma.

Lemma 4.1. *For system (4.3) is leading asymptotically stable.*

*Proof. *If for all and choose the following Lyapunov function:
The derivative of along with the solution of (4.2) is
Similar to the calculation of , we can get and for all , . So it is said that .

If we set , the network (4.3) satisfies the conditions of the Theorem and will achieve global synchronization finally.

*Remark 4.2. * According to Remark 3.3, we choose
in our simulation, and .

We consider two types of regular network: star coupled network and ring coupled network. Note that our adaptive strategy is also valid for other type of complex networks.

Star coupled networkFigure 1 shows the synchronization errors () of the star coupled network when and , respectively. From Figure 1, we can see that the synchronization errors evolve and converge to zero. In Figure 2, we plot the curve of the weight strength of and . We can see that converges to some constants, respectively.

**(a)**

**(b)**

**(a)**

**(b)**

Figure 3 shows the synchronization errors () of the ring coupled network when and , respectively. It is said that the network achieves global synchronization finally. Figure 4 shows that the weight strength of and converges to some constants, respectively.

**(a)**

**(b)**

**(a)**

**(b)**

#### 5. Conclusion

In this paper, we presented a new concept of asymptotically stable led by partial state variables and designed a simple adaptive controller for global synchronization in weight complex dynamical networks. For this network, we proved by using Lyapunov’s direct method that the states of such complex network can achieve global synchronization finally under our adaptive update law. Our synchronization strategy is to set adaptive coupling strength, and our adaptive update law of is only relation to partial state variables of connected nodes and . The complex networks with star coupled and ring coupled are simulated, in which the unified chaotic system is chosen as the dynamical node of the network. The simulation results also show the effectiveness of our method.

#### Acknowledgments

The authors are grateful to the anonymous referees for constructive comments. This work is supported by the Foundation of Zhangzhou Normal University under Grants no. SK09017 and the Foundation for Supporting Universities in Fujian Province of China under Grant no. JK2009020.

#### References

- C. W. Wu,
*Synchronization in Coupled Chaotic Circuits and Systems*, World Scientific Series on Nonlinear Science. Series A: Monographs and Treatises, World Scientific, River Edge, NJ, USA, 2002. 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: Publisher Site | Google Scholar - X. F. Wang and G. Chen, “Synchronization in small-world dynamical networks,”
*International Journal of Bifurcation and Chaos*, vol. 12, no. 1, pp. 187–192, 2002. View at: Publisher Site | Google Scholar - J. Lü, X. Yu, and G. Chen, “Chaos synchronization of general complex dynamical networks,”
*Physica A*, vol. 334, no. 1, pp. 281–302, 2004. View at: Publisher Site | Google Scholar | MathSciNet - X. F. Wang and G. Chen, “Synchronization in scale-free dynamical networks: robustness and fragility,”
*IEEE Transactions on Circuits and Systems I*, vol. 49, no. 1, pp. 54–62, 2002. View at: Publisher Site | Google Scholar - X. F. Wang and G. Chen, “Synchronization in complex dynamical networks,”
*Journal of Systems Science and Complexity*, vol. 16, no. 3, pp. 358-–371, 2003. View at: Google Scholar | Zentralblatt MATH - C. W. Wu, “Synchronization in networks of nonlinear dynamical systems coupled via a directed graph,”
*Nonlinearity*, vol. 18, no. 3, pp. 1057–1064, 2005. View at: Publisher Site | Google Scholar | Zentralblatt MATH - V. N. Belykh, I. V. Belykh, and M. Hasler, “Connection graph stability method for synchronized coupled chaotic systems,”
*Physica D*, vol. 195, pp. 159–187, 2004. View at: Publisher Site | Google Scholar | Zentralblatt MATH - I. Belykh, M. Hasler, M. Lauret, and H. Nijmeijer, “Synchronization and graph topology,”
*International Journal of Bifurcation and Chaos*, vol. 15, no. 11, pp. 3423–3433, 2005. View at: Publisher Site | Google Scholar | Zentralblatt MATH - 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, pp. 188–206, 2004. View at: Publisher Site | Google Scholar | Zentralblatt MATH - R. Zhang, M. Hu, and Z. Xu, “Synchronization in complex networks with adaptive coupling,”
*Physics Letters A*, vol. 368, no. 3-4, pp. 276–280, 2007. View at: Publisher Site | Google Scholar - D. B. Huang, “Synchronization in adaptive weighted networks,”
*Physical Review E*, vol. 74, 2006. View at: Publisher Site | Google Scholar - Z. Li, L. Jiao, and J.-J. Lee, “Robust adaptive global synchronization of complex dynamical networks by adjusting time-varying coupling strength,”
*Physica A*, vol. 387, pp. 1369–1380, 2008. View at: Publisher Site | Google Scholar - J. Zhou, J.-A. 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 Site | Google Scholar - G. He and J. Yang, “Adaptive synchronization in nonlinearly coupled dynamical networks,”
*Chaos, Solitons & Fractals*, vol. 38, no. 5, pp. 1254–1259, 2008. View at: Publisher Site | Google Scholar | Zentralblatt MATH - X. Li and J. Cao, “Adaptive synchronization for delayed neural networks with stochastic perturbation,”
*Journal of the Franklin Institute*, vol. 345, no. 7, pp. 779–791, 2008. View at: Publisher Site | Google Scholar | Zentralblatt MATH - H. Tang, L. Chen, J.-A. 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 Site | Google Scholar - W. He and J. Cao, “Adaptive synchronization of a class of chaotic neural networks with known or unknown parameters,”
*Physics Letters A*, vol. 372, no. 4, pp. 408–416, 2008. View at: Publisher Site | Google Scholar - A. Jadbabaie, J. Lin, and A. S. Morse, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,”
*IEEE Transactions on Automatic Control*, vol. 48, no. 6, pp. 988–1001, 2003. View at: Publisher Site | Google Scholar - R. Olfati-Saber and R. M. Murray, “Consensus problems in networks of agents with switching topology and time-delays,”
*IEEE Transactions on Automatic Control*, vol. 49, no. 9, pp. 1520–1533, 2004. View at: Publisher Site | Google Scholar - R. Olfati-Saber, “Flocking for multi-agent dynamic systems: algorithms and theory,”
*IEEE Transactions on Automatic Control*, vol. 51, no. 3, pp. 401–420, 2006. View at: Publisher Site | Google Scholar - W. Ren, R. W. Beard, and E. M. Atkins, “A survey of consensus problems in multi-agent coordination,” in
*Proceedings of the American Control Conference (ACC '05)*, vol. 3, pp. 1859–1864, Portland, Ore, USA, 2005. View at: Google Scholar - J. Lü, G. Chen, D. Cheng, and S. Celikovsky, “Bridge the gap between the Lorenz system and the Chen system,”
*International Journal of Bifurcation and Chaos*, vol. 12, no. 12, pp. 2917–2926, 2002. View at: Publisher Site | Google Scholar | Zentralblatt MATH

#### Copyright

Copyright © 2010 Zhengzhong Yuan 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.