11 December 2018 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
19 May 2020 in IEEE Transactions on Automatic Control
This article addresses the bounded synchronization of heterogeneous complex dynamical networks. Different from most existing criteria which deal with only global bounded synchronization, a general theorem is established for analyzing both the local and global bounded synchronization of a class of heterogeneous networks in a unified approach. By developing a joint-diagonalization-like technique, several easy-to-use bounded synchronization criteria with low-dimensional linear matrix inequalities are derived based on the general theorem. Particularly, an estimate of the synchronization error and the admissible initial values are given. Examples are provided to verify the theoretical results.
8 September 2020 in IEEE Transactions on Automatic Control
Finite-time synchronization (FTS) of dynamical networks has received much attention in recent years, as it has fast convergence rate and good robustness. Most existing results rely heavily on some global condition such as the Lipschitz condition, which has limitations in describing the strong nonlinearity of most real systems. Dealing with strong nonlinearity in the field of FTS is still a challenging problem. In this article, the FTS problem of impulsive dynamical networks with general nonlinearity (especially strong nonlinearity) is considered. In virtue of the concept of nonlinearity strength that quantizes the network nonlinearity, local FTS criteria are established, where the range of the admissible initial values and the settling time are solved. For the networks with weak nonlinearity, global FTS criteria that unify synchronizing, inactive, and desynchronizing impulses are derived. Differing from most existing studies on FTS, the node system here does not have to satisfy the global Lipschitz condition, therefore covering more situations that are practical. Finally, numerical examples are provided to demonstrate our theoretical results.
1 June 2020 in International Journal of Infectious Diseases
COVID-19 is spreading quickly all over the world. Publicly released data for 1212 COVID-19 patients in Henan of China was analyzed in this paper. Various statistical and network analysis methods were employed. We found that COVID-19 patients show gender (55% vs 45%) and age (81% aged between 21 and 60) preferences, possible causes were explored; The estimated average, mode and median incubation periods are 7.4, 4 and 7 days; Incubation periods of 92% patients were no more than 14 days; The epidemic in Henan has undergone three stages and showed high correlations with the numbers of patients recently return from Wuhan; Network analysis revealed that 208 cases were clustering infected and various people's Hospitals are the main force in treating COVID-19. The incubation period was statistical estimated and the proposed state transition diagram can well explore the epidemic stages of emerging infectious disease. We suggest that though the quarantine measures are gradually at work, strong measures might be still needed for a period of time, since ∼7.45% patients may have very long incubation periods. Migrant workers or college students are with high risk. State transition diagram can help us to recognize the time-phased nature of epidemic. Our investigations have implications for the prevention and control of COVID-19 in other regions of the world.
10 December 2018 in IEEE Transactions on Network Science and Engineering
This study focuses on topology identification in two-layer networks with peer-to-peer unidirectional couplings, where one layer (the response layer) receives information from the other layer (the drive layer). The goal is to construct a theoretical framework for identifying the topology of the response layer based on the dynamics observed in both layers. In particular, an auxiliary layer is constructed. Based on the LaSalle-type invariance principle, simple control inputs and updating laws are designed to enable nodes in the auxiliary layer to reach complete synchronization with their counterparts in the response layer. Simultaneously, the topology of the response layer is adaptively identified. Numerical simulations are conducted to illustrate the effectiveness of the method. The impact of the inter-layer information transmission speed on the identification performance is further investigated. It is revealed that neither too slow or too fast information transmission favors efficient identification, and there exists an optimal level of transmission speed. The duplex framework can model many real-world systems, such as communication-rumor spreading networks. Therefore, the method proposed in this study can spark attention and provide basic insights into further theoretical research and practical application of multilayer networks, including detecting spreading routes and locating sources of rumors or pseudo news.
21 January 2021 in IEEE Transactions on Cybernetics
Topology identification of complex networks is an important and meaningful research direction. In recent years, the topology identification method based on adaptive synchronization has been developed rapidly. However, a critical shortcoming of this method is that inner synchronization of a network breaks the precondition of linear independence and leads to the failure of topology identification. Hence, how to identify the network topology when possible inner synchronization occurs within the network has been a challenging research issue. To solve this problem, this article proposes improved topology identification methods by regulating the original network to synchronize with an auxiliary network composed of isolated chaotic exosystems. The proposed methods do not require the sophisticated assumption of linear independence. The topology identification observers incorporating a series of isolated chaotic exosignals can accurately identify the network structure. Finally, numerical simulations show that the proposed methods are effective to identify the structure of a network even with large weights of edges and abundant connections between nodes.