RESUMO
This paper proposes an approach for identifying unknown switching topology in a complex dynamical network. The setup is divided into two components: a primary drive network and a specialized response network equipped with switched topology observers. Each class of observers is dedicated to tracking a specific topology structure. The updating law for these observers is dynamically adjusted based on the operational status of the corresponding topology in the drive network-active if engaged and dormant if not. The sufficient conditions for successful identification are obtained by employing adaptive synchronization control and the Lyapunov function method. In particular, this paper abandons the generally used assumption of linear independence and adopts an easily verifiable condition for accurate identification. The result shows that the proposed identification method is applicable for any finite switching periods. By employing the chaotic Lü system and the Lorenz system as the local dynamics of the networks, numerical examples demonstrate the effectiveness of the proposed topology identification method.
RESUMO
In nature and human society, successive lag synchronization (SLS) is an important synchronization phenomenon. Compared with other synchronization patterns, the control theory of SLS is very lacking. To this end, we first introduce a complex dynamical network model with distributed delayed couplings, and design both the linear feedback pinning control and adaptive feedback pinning control to push SLS to the desired trajectories. Second, we obtain a series of sufficient conditions to achieve SLS to a desired trajectory with global stability. What is more, the control flow of SLS is given to show how to pick the pinned nodes accurately and set the feedback gains as well. Finally, since time-varying delay is common, we extend the constant time delay in SLS to be time varying. We find that the proposed pinning control schemes are still feasible if the coupling terms are appropriately adjusted. The theoretical results are verified on a neural network and the coupled Chua's circuits.
Assuntos
Algoritmos , Redes Neurais de Computação , Retroalimentação , HumanosRESUMO
Vaccination is an effective method to prevent the spread of infectious diseases. In this paper, we develop an SIVS epidemic model with degree-related transmission rates and imperfect vaccination on scale-free networks. Firstly, we derive two threshold parameters and existence conditions of multiple endemic equilibria. Secondly, not only the global asymptotical stability of disease-free equilibrium and the persistence of the disease are derived, but also the global attractivity of the unique endemic equilibrium is proved using the monotone iterative technique. Thirdly, the effects of various immunization schemes including uniform immunization, targeted immunization and acquaintance immunization are studied, and the optimal vaccination strategy is analyzed by Pontryagin's maximum principle. Finally, we perform numerical simulations to verify these theoretical results.
RESUMO
Many real-world networks exhibit community structure: the connections within each community are dense, while connections between communities are sparser. Moreover, there is a common but non-negligible phenomenon, collective behaviors, during the outbreak of epidemics, are induced by the emergence of epidemics and in turn influence the process of epidemic spread. In this paper, we explore the interaction between epidemic spread and collective behavior in scale-free networks with community structure, by constructing a mathematical model that embeds community structure, behavioral evolution and epidemic transmission. In view of the differences among individuals' responses in different communities to epidemics, we use nonidentical functions to describe the inherent dynamics of individuals. In practice, with the progress of epidemics, individual behaviors in different communities may tend to cluster synchronization, which is indicated by the analysis of our model. By using comparison principle and GersËgorin theorem, we investigate the epidemic threshold of the model. By constructing an appropriate Lyapunov function, we present the stability analysis of behavioral evolution and epidemic dynamics. Some numerical simulations are performed to illustrate and complement our theoretical results. It is expected that our work can deepen the understanding of interaction between cluster synchronization and epidemic dynamics in scale-free community networks.
Assuntos
Epidemias , Modelos Teóricos , Comportamento , Doenças Transmissíveis/transmissão , Humanos , Características de ResidênciaRESUMO
We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.
RESUMO
For many epidemic networks some connections between nodes are treated as deterministic, while the remainder are random and have different connection probabilities. By applying spectral analysis to several constructed models, we find that one can estimate the epidemic thresholds of these networks by investigating information from only the deterministic connections. Nonetheless, in these models, generic nonuniform stochastic connections and heterogeneous community structure are also considered. The estimation of epidemic thresholds is achieved via inequalities with upper and lower bounds, which are found to be in very good agreement with numerical simulations. Since these deterministic connections are easier to detect than those stochastic connections, this work provides a feasible and effective method to estimate the epidemic thresholds in real epidemic networks.
RESUMO
There are certain correlations between collective behavior and spreading dynamics on some real complex networks. Based on the dynamical characteristics and traditional physical models, we construct several new bidirectional network models of spreading phenomena. By theoretical and numerical analysis of these models, we find that the collective behavior can inhibit spreading behavior, but, conversely, this spreading behavior can accelerate collective behavior. The spread threshold of spreading network is obtained by using the Lyapunov function method. The results show that an effective spreading control method is to enhance the individual awareness to collective behavior. Many real-world complex networks can be thought of in terms of both collective behavior and spreading dynamics and therefore to better understand and control such complex networks systems, our work may provide a basic framework.
RESUMO
Many realistic epidemic networks display statistically synchronous behavior which we will refer to as epidemic synchronization. However, to the best of our knowledge, there has been no theoretical study of epidemic synchronization. In fact, in many cases, synchronization and epidemic behavior can arise simultaneously and interplay adaptively. In this paper, we first construct mathematical models of epidemic synchronization, based on traditional dynamical models on complex networks, by applying the adaptive mechanisms observed in real networks. Then, we study the relationship between the epidemic rate and synchronization stability of these models and, in particular, obtain the conditions of local and global stability for epidemic synchronization. Finally, we perform numerical analysis to verify our theoretical results. This work is the first to draw a theoretical bridge between epidemic transmission and synchronization dynamics and will be beneficial to the study of control and the analysis of the epidemics on complex networks.
Assuntos
Doenças Transmissíveis/epidemiologia , Doenças Transmissíveis/transmissão , Epidemias/estatística & dados numéricos , Modelos Biológicos , Animais , Simulação por Computador , Epidemias/prevenção & controle , Humanos , PrevalênciaRESUMO
During the process of adding links, we find that the synchronizability of the classical Barabási-Albert (BA) scale-free or Watts-Strogatz (WS) small-world networks can be statistically quantified by three essentially structural quantities of these networks, i.e., the eccentricity, variance of the degree distribution, and clustering coefficients. The results indicate that both the eccentricity and clustering coefficient are positively linearly correlated with synchronizability, while the variance is negatively linearly correlated. Moreover, the efficiency of some particular strategies of adding links to change the synchronizability is also investigated. This information can be used to guide us to design corresponding strategies of structure-evolving processes to manipulate the synchronizability of a given network.
RESUMO
In this paper dynamical networks with community structure and nonidentical nodes and with identical local dynamics for all individual nodes in each community are considered. The cluster synchronization of these networks with or without time delay is studied by using some feedback control schemes. Several sufficient conditions for achieving cluster synchronization are obtained analytically and are further verified numerically by some examples with chaotic or nonchaotic nodes. In addition, an essential relation between synchronization dynamics and local dynamics is found by detailed analysis of dynamical networks without delay through the stage detection of cluster synchronization.
RESUMO
We consider discrete dynamical networks, and analytically demonstrate the relation between transverse stability in the Milnor sense and contraction stability, the stability for synchronous manifolds obtained via the partial contraction principle. By contraction for a system, we mean that initial conditions or temporary disturbances are forgotten exponentially fast, so that all trajectories of this system converge to a unique trajectory. In addition, synchronization of star-shaped complex networks is investigated via the partial contraction principle. This example further verifies the interrelation between contraction and transverse stability.