Research Article | Open Access
Yangling Wang, Jinde Cao, "Pinning Synchronization of Delayed Neural Networks with Nonlinear Inner-Coupling", Discrete Dynamics in Nature and Society, vol. 2011, Article ID 901085, 12 pages, 2011. https://doi.org/10.1155/2011/901085
Pinning Synchronization of Delayed Neural Networks with Nonlinear Inner-Coupling
Without assuming the symmetry and irreducibility of the outer-coupling weight configuration matrices, we investigate the pinning synchronization of delayed neural networks with nonlinear inner-coupling. Some delay-dependent controlled stability criteria in terms of linear matrix inequality (LMI) are obtained. An example is presented to show the application of the criteria obtained in this paper.
1. Introduction and Model Description
In the past few decades, the problem of control and synchronization in complex networks has attracted increasing attention. There are attempts to control the dynamics of a complex network and guide it to a desired state, such as an equilibrium point or a periodic orbit of the network. Since a complex network has a large number of nodes, it is difficult to control it by adding controllers to all nodes. To reduce the number of the controllers, Wang and Chen investigated pinning control for complex networks . Pinning control applies local feedback injections to a small fraction of nodes on a large-size network, thereby achieving some intended global performances over the entire network.
In , Wang and Chen showed that, due to the extremely inhomogeneous connectivity distribution of scale-free networks, it is much effective to pin some most-highly connected nodes than to pin randomly selected nodes. In , Li et al. further investigated the control of complete random networks and scale-free networks via virtual control and showed that the control actions applied to the pinned nodes can be propagated to the rest of network nodes through the couplings in the network and eventually result in the synchronization of the whole network. In , Chen et al. proved that, if the coupling strength is large enough, then even one single pinning controller is able to control network. In the sequel, [4–9] also studied the global pinning controllability of complex networks and some sufficient pinning conditions were established. The common feature of the work in [1–9] is that there are no coupling delays in the network. However, due to the limited speeds of transmission and spreading as well as traffic congestion, signals traveling through a network are often associated with time delays, which are very common in biological and physical networks. Therefore, time delays should be modeled in order to simulate more realistic networks. In [10–13], the pinning synchronization of complex networks with homogeneous time delay is studied. In , Xiang et al. considered the pinning control of complex networks with heterogeneous delays via linearized method.
The previous researches on pinning control of complex dynamical networks have mainly focused on such networks with some specific coupling schemes. That is, there is a common outer-coupling strength for all connections and the inner-coupling is linear. Moreover, most of the existed studies assume the coupling configuration matrices are symmetric. In a real neural network, however, this is not always the case. Many real neural networks are direct graphs, such as the WWW, whose coupling configuration matrix is not symmetric. Additionally, as pointed in [15–17], synchronization is influenced not only by the topology, but also by the strength of the connections. So, we should consider nonuniform coupling strength while studying complex dynamical networks. Xiang et al.  considered the pinning control of complex networks with nonuniform coupling strength. In , Zhou et al. investigated the pinning adaptive synchronization of complex network with nonuniform coupling strength as well as time delay under the assumption of the symmetry of the nondelayed and delayed outer-coupling weight configuration matrices, they introduced some specific pinning control technique.
Motivated by the above discussion, we consider a general complex dynamical network described by  where denotes the state vector of the th node, represents the activity of an individual subsystem, and are the inner-coupling and delayed inner-coupling vector functions, and is the coupling delay function. and are the nondelayed and delayed outer-coupling strength, respectively. If there is a link from node to node , then and ; otherwise, , and , , . We will give some synchronization criteria by adding nonlinear and adaptive feedback controllers to a small fraction of nodes of network (1.1).
Let be the Banach space of continuous functions mapping into with the norm , where . For the complex network (1.1), its initial conditions are given by . We always assume that (1.1) has a unique solution with respect to initial conditions.
In this section, we present some lemmas and assumptions required throughout this paper.
Lemma 2.1 (see  (Schur Complement)). The following linear matrix inequality (LMI) where , is equivalent to the following condition:
Lemma 2.2 (see ). Assume that is a diagonal matrix whose th diagonal elements are and the others are 0, where is a constant. Then, for a symmetric matrix which has the same dimension with , is equivalent to when is large enough, where denotes the minor matrix of the matrix by removing all the th row-column pairs of .
Assumption 1. Suppose that the delay function is differentiable and satisfies , where is a constant.
Assumption 2 (see ). Assume that there is a positive definite diagonal matrix and a diagonal matrix , such that satisfies the following inequality: for some , all , , and .
Assumption 3. Assume that there exist positive constants and such that for all .
Assumption 4. Assume that there exists a positive constant satisfying for all .
Remark 2.3. In , the delayed inner-coupling vector function was required to satisfy for all , , where and are positive constants. Obviously, our assumption is weaker than that.
3. Synchronization Criteria of Directed Networks
The objective in this section is to stabilize network (1.1) onto a homogeneous trajectory satisfying , where is a solution of an isolate node. To achieve this goal, we first add feedback pinning controllers to a small fraction of nodes in the network. The pinning controlled network is described as follows: with nonlinear feedback controllers given by where the feedback gain satisfies for and for .
For the convenience of later use, we introduce some notations employed through this section. We let for all ; ; , , , , ; , , , , , , for all .
Theorem 3.1. Under the Assumptions 1–4, the pinning controlled directed network (3.1) is globally asymptotically stable at the homogenous trajectory if there exist positive diagonal matrices and , such that for .
Proof. From Lemma 2.1, conditions (3.3) are equivalent to We consider a Lyapunov function as Differentiating the function along the trajectories of (3.1), one obtains From Assumption 3, one can obtain Similar to (3.7), we can get It follows from (3.7) and (3.8), and combining with Assumptions 1-2, we can derive From Assumption 4, one can obtain Similar to (3.10), from Assumption 3, we can derive From (3.7)–(3.11), we can get From Lyapunov stability theory, the controlled system (3.1) is globally asymptotically stable at . This completes the proof.
Remark 3.2. It is hard to compare our results with existing ones, because the issues are different. However, from the aspect of the network model, network (1.1) contains the models studied in [1–13], moreover, because the coupling configuration matrices and are assumed to be asymmetric, which are more consistent with the real-world network.
In the coupled system (3.1), if , are defined as where are positive constants, then the controller is said to be adaptive pinning controller. In the following, we will prove that under some conditions the system (3.1) would get global synchronization with nonlinear adaptive pinning controllers.
Theorem 3.3. Under the Assumptions 1–4, the controlled directed network (3.1) is globally asymptotically stable with adaptive pinning controllers (3.13) if there exist positive diagonal matrices and , such that for .
Proof. Construct the Lyapunov function as
where is a sufficiently large positive constant to be determined. From Lemma 2.2, when is large enough,
is equivalent to
Differentiating the function along the trajectories of (3.1), and combining with (3.8), one can obtain The remaining part of the proof is similar to that of Theorem 3.1, hence we omit it.
To make Theorem 3.3 more applicable, we let , then we can easily obtain the following corollary.
Corollary 3.4. Under the Assumptions 1–4, the pinning controlled directed network (3.1) is globally asymptotically stable at the homogenous trajectory if the following conditions are satisfied: where .
Remark 3.5. According to this corollary, we can rearrange network nodes in ascending order based on their in-degrees  and choose the first network nodes as pinned candidates to satisfy the first pinning condition of this corollary.
4. Numerical Simulation
In this section, a simple example is used to explain the effectiveness of the proposed network synchronization criteria.
Example 4.1. We consider a directed network consisting of three identical Hindmarsh-Rose (HR) neuron systems , which is described by
where is the state variable of the th node,
According to the discussion in , and are realistically specified as and , so we can select and , then we can easily drive that , . We let and , , , , , . In this case, and the bound of the first variable in the HR equation is 0.5. If we let , , then we have Note that It follows that So, we can select . Moreover, if we let , , then, by simple computation, we can get for . So, according to Theorem 3.3, when the first two neurons are pinned, the directed network (4.1) with adaptive pinning controllers is globally asymptotically stable at the homogenous trajectory . Figure 1 shows the state variables of network (4.1) with initial values as , without control. Figure 2 shows the synchronization errors for pinning the first two neurons. From Figure 2, it is easy to see that the errors between the synchronized states converge to zero under the given conditions.
Remark 4.2. Since the nondelayed and delayed coupling matrices and are asymmetric, the theorem in  fails to conclude whether the dynamical system (4.1) can be synchronized. However, one can obtain the global synchronization using our results.
In this paper, on the basis of the previous work, we investigated the stabilization problem of delayed complex dynamical networks with nonlinear inner-coupling by pinning a small fraction of nodes. By using Lyapunov stability theory and linear matrix inequality (LMI) approach, some sufficient conditions ensuring the pinning synchronization are obtained. A comparison between our results and the previous results implies that our results establish a new set of pinning synchronization criteria for delayed complex dynamical networks with nonlinear inner-coupling. As an example, a network consisting of 3 identical Hindmarsh-Rose neuron systems is studied.
This work was jointly supported by the National Natural Science Foundation of China under Grant nos. 60874088 and 11072059 and the Natural Science Foundation of Jiangsu Province of China under Grant no. BK2009271.
- X. F. Wang and G. Chen, “Pinning control of scale-free dynamical networks,” Physica A. Statistical Mechanics and Its Applications, vol. 310, no. 3-4, pp. 521–531, 2002.
- X. Li, X. Wang, and G. Chen, “Pinning a complex dynamical network to its equilibrium,” IEEE Transactions on Circuits and Systems. I. Regular Papers, vol. 51, no. 10, pp. 2074–2087, 2004.
- T. Chen, X. Liu, and W. Lu, “Pinning complex networks by a single controller,” IEEE Transactions on Circuits and Systems. I. Regular Papers, vol. 54, no. 6, pp. 1317–1326, 2007.
- L. Y. Xiang, Z. X. Liu, Z. Q. Chen, F. Chen, and Z. Z. Yuan, “Pinning control of complex dynamical networks with general topology,” Physica A: Statistical Mechanics and Its Applications, vol. 379, no. 1, pp. 298–306, 2007.
- J. Zhao, J. Lu, and X. Wu, “Pinning control of general complex dynamical networks with optimization,” Science China. Information Sciences, vol. 53, no. 4, pp. 813–822, 2010.
- W. Yu, G. Chen, and J. Lü, “On pinning synchronization of complex dynamical networks,” Automatica, vol. 45, no. 2, pp. 429–435, 2009.
- Q. Song and J. Cao, “On pinning synchronization of directed and undirected complex dynamical networks,” IEEE Transactions on Circuits and Systems. I. Regular Papers, vol. 57, no. 3, pp. 672–680, 2010.
- F. Sorrentino, M. D. Bernardo, F. Garafalo, and G. R. Chen, “Controllability of complex networks via pinning,” Physical Review E, vol. 75, no. 4, Article ID 046103, 6 pages, 2007.
- J. Zhou, J.-A. Lu, and J. Lü, “Pinning adaptive synchronization of a general complex dynamical network,” Automatica, vol. 44, no. 4, pp. 996–1003, 2008.
- W. Guo, F. Austin, S. Chen, and W. Sun, “Pinning synchronization of the complex networks with non-delayed and delayed coupling,” Physics Letters A, vol. 373, no. 17, pp. 1565–1572, 2009.
- J. Zhao, J.-A. Lu, and Q. Zhang, “Pinning a complex delayed dynamical network to a homogenous trajectory,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 56, no. 6, pp. 514–518, 2009.
- L. I. Changpin, W. Sun, and X. U. Daolin, “Synchronization of complex dynamical networks with nonlinear inner-coupling functions and time delays,” Progress of Theoretical Physics, vol. 114, no. 4, pp. 749–761, 2005.
- Z. X. Liu, Z. Q. Chen, and Z. Z. Yuan, “Pinning control of weighted general complex dynamical networks with time delay,” Physica A: Statistical Mechanics and Its Applications, vol. 375, no. 1, pp. 345–354, 2007.
- L. Y. Xiang, Z. Q. Chen, Z. X. Liu, F. Chen, and Z. Z. Yuan, “Pinning control of complex dynamical networks with heterogeneous delays,” Computers & Mathematics with Applications, vol. 56, no. 5, pp. 1423–1433, 2008.
- A. E. Motter, C. S. Zhou, and J. Kurths, “Enhancing complex-network synchronization,” Europhysics Letters, vol. 69, no. 3, pp. 334–340, 2005.
- A. E. Motter, C. Zhou, and J. Kurths, “Network synchronization, diffusion, and the paradox of heterogeneity,” Physical Review E, vol. 71, no. 1, Article ID 016116, 9 pages, 2005.
- C. Zhou, A. E. Motter, and J. Kurths, “Universality in the synchronization of weighted random networks,” Physical Review Letters, vol. 96, no. 3, Article ID 034101, 4 pages, 2006.
- J. Zhou, X. Wu, W. Yu, M. Small, and J.-A. Lu, “Pinning synchronization of delayed neural networks,” Chaos, vol. 18, no. 4, Article ID 043111, pp. 9–9, 2008.
- S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, vol. 15 of SIAM Studies in Applied Mathematics, SIAM, Philadelphia, Pa, USA, 1994.
Copyright © 2011 Yangling Wang and Jinde Cao. 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.