Pinning synchronization of directed networks with disconnected switching topology via averaging method

This paper mainly focuses on pinning synchronization of directed networks under disconnected switching topology. Firstly, by introducing the uniformly directed spanning tree on average (UDSTA) for a time-varying digraph and designing a switching pinning controller, the asymptotic synchronization of complex networks with large number of switching topologies is investigated, in which strong connectivity and structural balance for switching topology are no longer required. Furthermore, a class of almost-period (AP) switching mode is introduced. By means of matrix decomposition, the pinning synchronization criteria of complex networks under AP switching topology are derived and the pinning nodes are selected according to maximal strongly connected root-subgraphs (MSCRSs) of average topology. Finally, a type of coupled neural networks with numerical simulations is introduced to illustrate the theoretical results.     

Pinning impulsive synchronization of complex dynamical networks with various time-varying delay sizes

This paper studies the pinning impulsive synchronization problem for a class of complex dynamical networks with time-varying delay. By applying the Lyapunov stability theory and mathematical analysis technique, sufficient verifiable criterion for the synchronization of delayed complex dynamical networks with small delay is derived analytically. It is shown that synchronization can be achieved by only impulsively controlling a small fraction of network nodes. Moreover, a novel sufficient condition is constructed to relax the restrictions on the size of time-delay and guarantee the synchronization of concerned networks with large delay. Two numerical examples are presented to illustrate the effectiveness of the obtained results.     

Cluster mixed synchronization via pinning control and adaptive coupling strength in community networks with nonidentical nodes

In this paper, complex networks with community structure and nonidentical nodes are investigated. The cluster mixed synchronization of these networks is studied by using some linear pinning control schemes. Only the nodes in one community which have direct connections to the nodes in other communities are controlled. Adaptive coupling strength method is adopted to achieve the synchronization as well. According to Lyapunov stability theory, several sufficient conditions for the network to achieve cluster mixed synchronization are derived. Numerical simulations are provided to verify the correctness and the effectiveness of the theoretical results.     

Adaptive cluster synchronization in networks with time-varying and distributed coupling delays

This paper studies the adaptive cluster synchronization of a generalized linearly coupled network with time-varying delay and distributed delays. This network includes nonidentical nodes displaying different local dynamical behaviors, while for each cluster of that network the internal dynamics is uniform (such as chaotic, periodic, or stable behavior). In particular, the generalized coupling matrix of this network can be asymmetric and weighted. Two different adaptive laws of time-varying coupling strength and a linear feedback control are designed to achieve the cluster synchronization of this network. Some sufficient conditions to ensure the cluster synchronization are obtained by using the invariant principle of functional differential equations and linear matrix inequality (LMI). Numerical simulations verify the efficiency of our proposed adaptive control method.     

Guaranteed cost synchronization of a complex dynamical network via dynamic feedback control

In this paper, the problem of guaranteed cost synchronization for a complex network is investigated. In order to achieve the synchronization, two types of guaranteed cost dynamic feedback controller are designed. Based on Lyapunov stability theory, a linear matrix inequality (LMI) convex optimization problem is formulated to find the controller which guarantees the asymptotic stability and minimizes the upper bound of a given quadratic cost function. Finally, a numerical example is given to illustrate the proposed method.     

Generalized synchronization between two different complex networks

In this paper, generalized synchronization (GS) between two coupled complex networks is theoretically and numerically studied, where the node vectors in different networks are not the same, and the numbers of nodes of both networks are not necessarily equal. First, a sufficient criterion for GS, one kind of outer synchronizations, of two coupled networks is established based on the auxiliary system method and the Lyapunov stability theory. Numerical examples are also included which coincide with the theoretical analysis.     

Group synchronization in complex dynamical networks with different types of oscillators and adaptive coupling schemes

This paper focus on schemes and corresponding criteria for group synchronization in complex dynamical networks consisted of different group of chaotic oscillators. The global asymptotically stable criteria for a linearly or adaptively coupled network are derived to ensure each group of oscillators synchronize to the same behavior. Theoretical analysis and numerical simulation results show that the group synchronization can be guaranteed by enhancing the external coupling strength whenever there are connections or not within the groups under the “same input” condition. All of the results are proved rigorously. Finally, a network with three groups, a scale-free sub-network, a small-world sub-network and a ring sub-network, is illustrated, and the corresponding numerical simulations verify the theoretical analysis.     

Lag projective synchronization of a class of complex network constituted nodes with chaotic behavior

In this paper, a method of the lag projective synchronization of a class of complex network constituted nodes with chaotic behavior is proposed. Discrete chaotic systems are taken as nodes to constitute a complex network and the topological structure of the network can be arbitrary. Considering that the lag effect between network node and chaos signal of target system, the control input of the network and the identification law of adjustment parameters are designed based on Lyapunov theorem. The synchronization criteria are easily verified.     

Finite-time stochastic synchronization of complex networks

In this paper, we study the finite-time stochastic synchronization problem for complex networks with stochastic noise perturbations. By using finite-time stability theorem, inequality techniques, the properties of Weiner process and adding suitable controllers, sufficient conditions are obtained to ensure finite-time stochastic synchronization for the complex networks. The effects of control parameters on synchronization speed and time are also analyzed. The results of this paper are applicable to both directed and undirected weighted networks while do not need to know any information about eigenvalues of coupling matrix. Since finite-time synchronization means the optimality in convergence time and has better robustness and disturbance rejection properties, the results of this paper are important. A numerical example shows the effectiveness of our new results.     

Guaranteed cost synchronization of complex networks with uncertainties and time‐Varying delays

This article focuses on the problem of Guaranteed cost synchronization of complex networks with uncertainties and time‐Varying delays. Sufficient conditions for the existence of the optimal guaranteed cost control laws are introduced in the light of linear matrix inequalities via the Lyapunov–Krasovskii stability theory. The time‐varying node delays and time‐varying coupling delays are simultaneously regarded in the complex network. The node uncertainties and coupling uncertainties are simultaneously considered as well. Numerical simulations are provided to account for the effectiveness and robustness of the proposed method. The results in this article generalize and improve the corresponding results of the recent works. © 2015 Wiley Periodicals, Inc. Complexity 21: 381–395, 2016     

Adaptive lag synchronization for uncertain complex dynamical network with delayed coupling

This paper proposes an adaptive control method to achieve the lag synchronization between uncertain complex dynamical network having delayed coupling and a non-identical reference node. Unknown parameters of both the network and reference node are estimated by adaptive laws obtained by Lyapunov stability theory. With the estimated parameters, the proposed method guarantees the globally asymptotical synchronization of the network in spite of unknown bounded disturbances. The effectiveness of our work is verified through a numerical example and simulation.     

Module-phase synchronization in complex dynamic system

The concept of module-phase synchronization was proposed. The chaos synchronization between drive system and response system was achieved in module space and phase space respectively (module-phase synchronization). Different from the evolutions in real space, there is no pseudorandom behavior in phase space when module-phase synchronization achieve. All the phases of complex state variables switched between two fixed values which are determined by initial values of drive system. And the modules varied within a bounded field. The theoretical analysis and the simulations were also given.     

An intriguing hybrid synchronization phenomenon of two coupled complex networks

This paper investigates the hybrid synchronization problem of two coupled complex networks. Employing the linear feedback and the adaptive feedback control methods which are simple, efficient, and easy to implement in practical applications, we obtain some useful criteria of the hybrid synchronization of two coupled networks based on the Lyapunov stability theory and Lasalle’s invariance principle. It shows that under suitable conditions, two coupled complex networks can realize an intriguing hybrid synchronization: the outer anti-synchronization between the driving network and the response network, and the inner complete synchronization in the driving network and the response network, respectively. Numerical simulations demonstrate the effectiveness of the proposed hybrid synchronization scheme.     

On pinning control of some typical discrete-time dynamical networks

Recently, the pinning control of complex dynamical networks to their homogeneous states has been studied by many researchers, most of the dynamical networks are continuous-time ones, i.e., their dynamical behavior can be described by ODEs. An interesting result is that, for a continuous-time network, its desired (homogeneous) state can be achieved by pinning some nodes with relatively large degrees (also called the specifically pinning scheme [Wang XF, Chen GR. Pinning control of scale-free dynamical networks. Physica A 2002;310:521–31]). Is this specifically pinning scheme also effective for the discrete-time dynamical networks? In this paper, we demonstrate that the pinning control for a discrete-time dynamical network is difficult, and sometimes it is impossible to achieve the desired state just by controlling the nodes with larger degrees. In order to control the discrete-time dynamical networks successfully, we may need to control all the nodes. Finally, we also consider how to extend the interval for the feedback gain d for successful control.     

Optimal synchronization of two different in‐commensurate fractional‐order chaotic systems with fractional cost function

This article investigates the optimal synchronization of two different fractional‐order chaotic systems with two kinds of cost function. We use calculus of variations for minimizing cost function subject to synchronization error dynamics. We introduce optimal control problem to solve fractional Euler–Lagrange equations. Optimal control signal and minimum time of synchronization are obtained by proposed method. Examples show the optimal synchronization of two different systems with two different cost functions. First, we use an ordinary integer cost function then we use a fractional‐order cost function and comparing the results. Finally, we suggest a cost function which has the optimal solution of this problem, and we can extend this solution to solve other synchronization problems. © 2016 Wiley Periodicals, Inc. Complexity 21: 401–416, 2016     

Adaptive cluster synchronization in directed networks with nonidentical nonlinear dynamics

In this article, the problem of cluster synchronization in the complex networks with nonidentical nonlinear dynamics is considered. By Lyapunov functional and M‐matrix theory, some sufficient conditions for cluster synchronization are obtained. Moreover, the least number of nodes which should be pinned is given. It is shown that when the root nodes of all the clusters are pinning‐controlled, cluster synchronization with adaptive coupling strength can be achieved. Different from the constraints of many literatures, the assumption is that each row sum for all diagonal submatrices of the Laplacian matrix is equal to zero. Finally, a numerical simulation in the network with three scale‐free subnetwork is provided to demonstrate the effectiveness of the theoretical results. © 2016 Wiley Periodicals, Inc. Complexity 21: 380–387, 2016     

Observer-based lag synchronization between two different complex networks

In this paper, some new criteria for lag synchronization between two or more complex networks are proposed based on the theory of state observer. Some adaptive controllers are designed to make the drive and response systems achieve lag synchronization, no matter whether the nodes in the two systems are with the same dynamical character or the coupling configuration matrices are nonidentical. In addition, based on the output coupling, the amount of coupling variables between two connected nodes is flexible, which can save a lot of channel resources, simplify the network topology and has more significant meanings in engineering applications. At last, the effects of the lag synchronization criteria are verified through some simulation experiments.     

Exponential synchronization of stochastic perturbed complex networks with time-varying delays via periodically intermittent pinning

In this paper, the exponential synchronization is investigated for stochastic complex networks with time-varying delays via periodically intermittent pinning control. By utilizing the Lyapunov stability theory, stochastic analysis theory as well as linear matrix inequalities (LMI), the sufficient conditions are derived to guarantee the exponential synchronization. Furthermore, the complex networks considered in this paper are more general than the models in previous works. Therefore, the application scope is enlarged. And the result is computationally efficient for the obtained condition. The numerical simulation is provided to show the effectiveness of the theoretical results.     

Exponential synchronization of stochastic coupled oscillators networks with delays

This paper investigates the exponential synchronization problem of coupled oscillators networks with disturbances and time-varying delays. On basis of graph theory and stochastic analysis theory, a feedback control law is designed to achieve exponential synchronization. By constructing a global Lyapunov function for error network, both pth moment exponential synchronization and almost sure exponential synchronization of drive-response networks are obtained. Finally, a numerical example is given to show the effectiveness of the proposed criteria.