Influencer identification of dynamical networks based on an information entropy dimension reduction method

Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control.Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure.However, these algorithms do not consider network state changes.We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity.By using mean field theory and information entropy to calculate node activity,we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance.We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the C.elegans neural network.We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.

Spontaneous Recovery in Directed Dynamical Networks

Complex networked systems,which range from biological systems in the natural world to infrastructure systems in the human-made world,can exhibit spontaneous recovery after a failure;for example,a brain may spontaneously return to normal after a seizure,and traffic flow can become smooth again after a jam.Previous studies on the spontaneous recovery of dynamical networks have been limited to undirected networks.However,most real-world networks are directed.To fill this gap,we build a model in which nodes may alternately fail and recover,and we develop a theoretical tool to analyze the recovery properties of directed dynamical networks.We find that the tool can accurately predict the final fraction of active nodes,and the prediction accuracy decreases as the fraction of bidirectional links in the network increases,which emphasizes the importance of directionality in network dynamics.Due to different initial states,directed dynamical networks may show alternative stable states under the same control parameter,exhibiting hysteresis behavior.In addition,for networks with finite sizes,the fraction of active nodes may jump back and forth between high and low states,mimicking repetitive failure-recovery processes.These findings could help clarify the system recovery mechanism and enable better design of networked systems with high resilience.

Target layer state estimation in multi-layer complex dynamical networks considering nonlinear node dynamics

In many engineering networks, only a part of target state variables are required to be estimated.On the other hand,multi-layer complex network exists widely in practical situations.In this paper, the state estimation of target state variables in multi-layer complex dynamical networks with nonlinear node dynamics is studied.A suitable functional state observer is constructed with the limited measurement.The parameters of the designed functional observer are obtained from the algebraic method and the stability of the functional observer is proven by the Lyapunov theorem.Some necessary conditions that need to be satisfied for the design of the functional state observer are obtained.Different from previous studies, in the multi-layer complex dynamical network with nonlinear node dynamics, the proposed method can estimate the state of target variables on some layers directly instead of estimating all the individual states.Thus, it can greatly reduce the placement of observers and computational cost.Numerical simulations with the three-layer complex dynamical network composed of three-dimensional nonlinear dynamical nodes are developed to verify the effectiveness of the method.

SYNCHRONIZATION OF MASTER-SLAVE MARKOVIAN SWITCHING COMPLEX DYNAMICAL NETWORKS WITH TIME-VARYING DELAYS IN NONLINEAR FUNCTION VIA SLIDING MODE CONTROL

In this article, a synchronization problem for master-slave Markovian switching complex dynamical networks with time-varying delays in nonlinear function via sliding mode control is investigated. On the basis of the appropriate Lyapunov-Krasovskii functional, introducing some free weighting matrices, new synchronization criteria are derived in terms of linear matrix inequalities （LMIs）. Then, an integral sliding surface is designed to guarantee synchronization of master-slave Markovian switching complex dynamical networks, and the suitable controller is synthesized to ensure that the trajectory of the closed-loop error system can be driven onto the prescribed sliding mode surface. By using Dynkin＇s formula, we established the stochastic stablity of master-slave system. Finally, numerical example is provided to demonstrate the effectiveness of the obtained theoretical results.

Topology identification for a class of complex dynamical networks using output variables

A problem of topology identification for complex dynamical networks is investigated in this paper. An adaptive observer is proposed to identify the topology of a complex dynamical networks based on the Lyapunov stability theory. Here the output of the network and the states of the observer are used to construct the updating law of the topology such that the communication resources from the network to its observer are saved. Some convergent criteria of the adaptive observer are derived in the form of linear inequality matrices. Several numerical examples are shown to demonstrate the effectiveness of the proposed observer.

Fault diagnosis of time-delay complex dynamical networks using output signals

This paper proposes a novel approach for fault diagnosis of a time-delay complex dynamical network. Unlike the other methods, assuming that the dynamics of the network can be described by a linear stochastic model, or using the state variables of nodes in the network to design an adaptive observer, it only uses the output variable of the nodes to design an observer and an adaptive law of topology matrix in the observer of a complex network, leading to simple design of the observer and easy realisation of topology monitoring for the complex networks in real engineering. The proposed scheme can monitor any changes of the topology structure of a time-delay complex network. The effectiveness of this method is successfully demonstrated by virtue of a complex networks with Lorenz model.

Stochastic synchronization for time-varying complex dynamical networks

This paper studies the stochastic synchronization problem for time-varying complex dynamical networks. This model is totally different from some existing network models. Based on the Lyapunov stability theory, inequality techniques, and the properties of the Weiner process, some controllers and adaptive laws are designed to ensure achieving stochastic synchronization of a complex dynamical network model. A sufficient synchronization condition is given to ensure that the proposed network model is mean-square stable. Theoretical analysis and numerical simulation fully verify the main results.

Exponential Synchronization of Uncertain Complex Dynamical Networks with Delay Coupling

This paper studies the global exponential synchronization of uncertain complex delayed dynamical networks. The network model considered is general dynamical delay networks with unknown network structure and unknown coupling functions but bounded. Novel delay-dependent linear controllers are designed via the Lyapunov stability theory. Especially, it is shown that the controlled networks are globally exponentially synchronized with a given convergence rate. An example of typical dynamical network of this class, having the Lorenz system at each node, has been used to demonstrate and verify the novel design proposed. And, the numerical simulation results show the effectiveness of proposed synchronization approaches.

Hash function construction using weighted complex dynamical networks

A novel scheme to construct a hash function based on a weighted complex dynamical network （WCDN） generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then, each block is divided into components, and the nodes and weighted edges are well defined from these components and their relations. Namely, the WCDN closely related to the original message is established. Furthermore, the node dynamics of the WCDN are chosen as a chaotic map. After chaotic iterations, quantization and exclusive-or operations, the fixed-length hash value is obtained. This scheme has the property that any tiny change in message can be diffused rapidly through the WCDN, leading to very different hash values. Analysis and simulation show that the scheme possesses good statistical properties, excellent confusion and diffusion, strong collision resistance and high efficiency.

IMPULSIVE EXPONENTIAL SYNCHRONIZATION OF FRACTIONAL-ORDER COMPLEX DYNAMICAL NETWORKS WITH DERIVATIVE COUPLINGS VIA FEEDBACK CONTROL BASED ON DISCRETE TIME STATE OBSERVATIONS

This article aims to address the global exponential synchronization problem for fractional-order complex dynamical networks(FCDNs)with derivative couplings and impulse effects via designing an appropriate feedback control based on discrete time state observations.In contrast to the existing works on integer-order derivative couplings,fractional derivative couplings are introduced into FCDNs.First,a useful lemma with respect to the relationship between the discrete time observations term and a continuous term is developed.Second,by utilizing an inequality technique and auxiliary functions,the rigorous global exponential synchronization analysis is given and synchronization criterions are achieved in terms of linear matrix inequalities(LMIs).Finally,two examples are provided to illustrate the correctness of the obtained results.

Synchronization and Bifurcation of General Complex Dynamical Networks

In the present paper, synchronization and bifurcation of general complex dynamical networks are investigated. We mainly focus on networks with a somewhat general coupling matrix, i.e., the sum of each row equals a nonzero constant u. We derive a result that the networks can reach a new synchronous state, which is not the asymptotic limit set determined by the node equation. At the synchronous state, the networks appear bifurcation if we regard the constant u as a bifurcation parameter. Numerical examples are given to illustrate our derived conclusions.

Impulsive Synchronization of Nonlinear Stochastic Dynamical Networks with Time-Varying Delays

In this paper, an impulsive control strategy is proposed for a class of nonlinear stochastic dynamical networks with time-varying delay. Using the Lyapunov stability theory, a sufficient verifiable criterion for the exponential synchronization is derived analytically. Finally, a numerical simulation example is provided to verify the effectiveness of the proposed approach.

Synchronization of complex switched delay dynamical networks with simultaneously diagonalizable coupling matrices

This paper studies local exponential synchronization of complex delayed networks with switching topology via switched system stability theory. First, by a common unitary matrix, the problem of synchronization is transformed into the stability analysis of some linear switched delay systems. Then, when all subnetworks are synchronizable, a delay-dependent sufficient condition is given in terms of linear matrix inequalities （LMIs） which guarantees the solvability of the synchronization problem under an average dwell time scheme. We extend this result to the case that not all subnetworks are synchronizable. It is shown that in addition to average dwell time, if the ratio of the total activation time of synchronizable and non-synchronizable subnetworks satisfy an extra condition, then the problem is also solvable. Two numerical examples of delayed dynamical networks with switching topology are given, which demonstrate the effectiveness of obtained results.

Disturbance rejection and H_∞ pinning control of linear complex dynamical networks

This paper concerns the disturbance rejection problem of a linear complex dynamical network subject to external disturbances. A dynamical network is said to be robust to disturbance, if the H∞ norm of its transfer function matrix from the disturbance to the performance variable is satisfactorily small. It is shown that the disturbance rejection problem of a dynamical network can be solved by analysing the H∞ control problem of a set of independent systems whose dimensions are equal to that of a single node. A counter-intuitive result is that the disturbance rejection level of the whole network with a diffusive coupling will never be better than that of an isolated node. To improve this, local feedback injections are applied to a small fraction of the nodes in the network. Some criteria for possible performance improvement are derived in terms of linear matrix inequalities. It is further demonstrated via a simulation example that one can indeed improve the disturbance rejection level of the network by pinning the nodes with higher degrees than pinning those with lower degrees.

Successive lag synchronization on dynamical networks with communication delay

In this paper, successive lag synchronization （SLS） on a dynamical network with communication delay is investigated. In order to achieve SLS on the dynamical network with communication delay, we design linear feedback control and adaptive control, respectively. By using the Lyapunov function method, we obtain some sufficient conditions for global stability of SLS. To verify these results, some numerical examples are further presented. This work may find potential applications in consensus of multi-agent systems.

Robust H_∞ observer-based control for synchronization of a class of complex dynamical networks

This paper is concerned with the robust Hoo synchronization problem for a class of complex dynamical networks by applying the observer-based control. The proposed feedback control scheme is developed to ensure the asymptotic stability of the augmented system, to reconstruct the non-measurable state variables of each node and to improve the H∞ performance related to the synchronization error and observation error despite the external disturbance. Based on the Lyapunov stability theory, a synchronization criterion is obtained under which the controlled network can be robustly stabilized onto a desired state with a guaranteed H∞ performance. The controller and the observer gains can be given by the feasible solutions of a set of linear matrix inequalities （LMIs）. The effectiveness of the proposed control scheme is demonstrated by a numerical example through simulation.

Robust H_∞ cluster synchronization analysis of Lurie dynamical networks

The cluster synchronization problem of complex dynamical networks with each node being a Lurie system with exter- nal disturbances and time-varying delay is investigated in this paper. Some criteria for cluster synchronization with desired H∞ performance are presented by using a local linear control scheme. Firstly, sufficient conditions are established to realize cluster synchronization of the Lurie dynamical networks without time delay. Then, the notion of the cluster synchronized region is introduced, and some conditions guaranteeing the cluster synchronized region and unbounded cluster synchro- nized region are derived. Furthermore, the cluster synchronization and cluster synchronized region in the Lurie dynamical networks with time-varying delay are considered. Numerical examples are finally provided to verify and illustrate the theoretical results.

Comparison between pinning control of different chaotic complex dynamical networks

The stabilization properties of various typical complex dynamical networks composed of chaotic nodes are theoretically investigated and numerically simulated in detail. Some local stability properties of such pinned networks are derived and the valid stability regions are estimated based on eigenvalue analysis. Numerical simulations of such networks are given to explain why significantly less local controllers are needed by the specifically pinning scheme, which pins the most highly connected nodes in scale-free networks, than that required by the randomly pinning scheme. Also, it is explained why there is no significant difference between the two schemes for controlling random-graph networks and small-world networks.

Estimating Topology of Discrete Dynamical Networks

In this paper,by applying Lasalle's in variance principle and some results about the trace of a matrix,we propose a method for estimating the topological structure of a discrete dynamical network based on the dynamicalevolution of the network.The network concerned can be directed or undirected,weighted or unweighted,and the localdynamics of each node can be nonidentical.The connections among the nodes can be all unknown or partially known.Finally,two examples,including a Henon map and a central network,are illustrated to verify the theoretical results.

Robust impulsive synchronization of linear discrete dynamical networks

This paper aims to study robust impulsive synchronization problem foruncertain linear discrete dynamical network. For the discrete dynamical networks with unknown butbounded linear coupling, by introducing the concept of uniformly positive definite matrix functions,some robust impulsive controllers are designed, which ensure that the state of a discrete dynamicalnetwork globally asymptotically synchronizes with an arbitrarily assigned state of an isolate nodeof the network. This paper also investigates the synchronization problem where the network couplingfunctions are uncertain but bounded nonlinear functions. Finally, two examples are simulated toillustrate our results.