Search

In this short paper, we explore relationship between various models of complex networks with pinning controllers.

In this letter, we propose high order layered complex networks. The synchronization is discussed in detail. The relations of synchronization, individual coupling matrices and the intrinsic function of the uncoupled system are given. As special cases, synchronization of monolayer networks and multiplex networks discussed in literature can be obtained.

This short paper addresses quasi synchronization of heterogeneous complex dynamical networks. The similarity and difference between synchronization of homogeneous systems and quasi synchronization of heterogeneous complex dynamical networks will be revealed.

In this paper, we discuss distributive synchronization of complex networks in finite time, with a single nonlinear pinning controller. The results apply to heterogeneous dynamic networks, too. Different from many models, which assume the coupling matrix being symmetric (or the connecting graph is undirected), here, the coupling matrix is asymmetric (or the connecting graph is directed

In this paper, we propose several models, which can realize synchronization of complex networks in finite time effectively. The results apply to heterogeneous dynamic networks, too. The mechanism of finite time convergence is revealed. Different from many models, which assume the coupling matrix being symmetric (or the connecting graph is undirected), here, the coupling matrix is asymmetric (or the connecting graph is directed).

In this paper, we discuss distributed adaptive algorithms for synchronization of complex networks, consensus of multi-agents with or without pinning controller. The dynamics of individual node is governed by generalized QUAD condition. We design new algorithms, which can keep the left eigenvector of the adaptive coupling matrix corresponding to the zero eigenvalue invariant. Based on this invariance, various distributive adaptive synchronization, consensus, anti-synchronization models are given.

In this short note, we recommend another approach to deal with the topic Consensus of Multi-agents, which was proposed in \cite{Chena}.

In this paper, we focus on the topic Synchronization and consensus of Complex Networks and their relationships. It is revealed that two topics are closely relating to each other and all results given in \cite{Li1,Li2} and many other papers can be obtained by the results in \cite{Chen1,Chen2}. It is pointed out that QUAD condition plays important role in discussing synchronization and consensus.

In this paper, stability of linearly coupled dynamical systems with feedback pinning is studied. Event-triggered rules are employed on both diffusion coupling and feedback pinning to reduce the updating load of the coupled system. Here, both the coupling matrix and the set of pinned-nodes vary with time are induced by a homogeneous Markov chain. For each node, the diffusion coupling and feedback pinning are set up from the observation of its neighbors' and target's (if pinned) information at the latest event time and the next event time is triggered by some specified criteria. Two event-triggering rules are proposed and it is proved that if the system with time-average coupling and pinning gains are stable, the event-triggered strategies can stabilize the system if the switching is sufficiently fast. Moreover, Zeno behaviors are excluded in some cases. Finally, numerical examples are presented to illustrate the theoretical results.

In this paper, we focus on the topic Synchronization and consensus of Complex Networks and their relationships. It is revealed that two topics are closely relating to each other and all results given in \cite{Li} can be obtained by the results in \cite{Lu2006}.

In this paper, we discuss the outer-synchronization of the asymmetrically connected recurrent time-varying neural networks. By both centralized and decentralized discretization data sampling principles, we derive several sufficient conditions based on diverse vector norms that guarantee that any two trajectories from different initial values of the identical neural network system converge together. The lower bounds of the common time intervals between data samples in centralized and decentralized principles are proved to be positive, which guarantees exclusion of Zeno behavior. A numerical example is provided to illustrate the efficiency of the theoretical results., Comment: 13 pages, 2 figures

In this paper, we investigate stability of a class of analytic neural networks with the synaptic feedback via event-triggered rules. This model is general and include Hopfield neural network as a special case. These event-trigger rules can efficiently reduces loads of computation and information transmission at synapses of the neurons. The synaptic feedback of each neuron keeps a constant value based on the outputs of the other neurons at its latest triggering time but changes at its next triggering time, which is determined by certain criterion. It is proved that every trajectory of the analytic neural network converges to certain equilibrium under this event-triggered rule for all initial values except a set of zero measure. The main technique of the proof is the Lojasiewicz inequality to prove the finiteness of trajectory length. The realization of this event-triggered rule is verified by the exclusion of Zeno behaviors. Numerical examples are provided to illustrate the efficiency of the theoretical results., Comment: 12 pages, 3 figures. arXiv admin note: substantial text overlap with arXiv:1504.08081

In this paper, the fixed-time cluster synchronization problem for complex networks via pinning control is discussed. Fixed-time synchronization has been a hot topic in recent years, which means that the network can achieve synchronization in finite-time and the settling time is bounded by a constant for any initial values. To realize the fixed-time cluster synchronization, a simple distributed protocol by pinning control technique is designed, whose validity is rigorously proved, and some sufficient criteria for fixed-time cluster synchronization are also obtained. Especially, when the cluster number is one, the cluster synchronization becomes the complete synchronization problem; when the intrinsic dynamics for each node is missed, the fixed-time cluster synchronization becomes the fixed-time cluster (or complete) consensus problem; when the network has only one node, the coupling term between nodes will disappear, and the synchronization problem becomes the simplest master-slave case, which also includes the stability problem for nonlinear systems like neural networks. All these cases are also discussed. Finally, numerical simulations are presented to demonstrate the correctness of obtained theoretical results.

In this letter, by regarding finite-time stability as an inverse problem, we reveal the essence of finite-time stability and fixed-time stability. Some necessary and sufficient conditions are given. As application, we give a new approach for finite-time and fixed-time synchronization and consensus. Many existing results can be derived by the general approach.

Stability of the zero solution plays an important role in the investigation of positive systems. In this note, we revisit the $\mu$-stability of positive nonlinear systems with unbounded time-varying delays. The system is modelled by continuous-time differential equations. Under some assumptions on the nonlinear functions like homogeneous, cooperative, nondecreasing, we propose a novel transform, by which the nonlinear system reduces to a new system. Thus, we analyze its dynamics, which can simplify the nonlinear homogenous functions with respect to (w.r.t.) arbitrary dilation map to those w.r.t. the standard dilation map. We finally get some criteria for the global $\mu$-stability. A numerical example is given to demonstrate the validity of obtained results.

In this paper, we investigate the global exponential stability for complex-valued recurrent neural networks with asynchronous time delays by decomposing complex-valued networks to real and imaginary parts and construct an equivalent real-valued system. The network model is described by a continuous-time equation. There are two main differences of this paper with previous works: (1), time delays can be asynchronous, i.e., delays between different nodes are different, which makes our model more general; (2), we prove the exponential convergence directly, while the existence and uniqueness of the equilibrium point is just a direct consequence of the exponential convergence. By using three generalized norms, we present some sufficient conditions for the uniqueness and global exponential stability of the equilibrium point for delayed complex-valued neural networks. These conditions in our results are less restrictive because of our consideration of the excitatory and inhibitory effects between neurons, so previous works of other researchers can be extended. Finally, some numerical simulations are given to demonstrate the correctness of our obtained results.

In this paper, we investigate convergence of a class of analytic neural networks with event-triggered rule. This model is general and include Hopfield neural network as a special case. The event-trigger rule efficiently reduces the frequency of information transmission between synapses of the neurons. The synaptic feedback of each neuron keeps a constant value based on the outputs of its neighbours at its latest triggering time but changes until the next triggering time of this neuron that is determined by certain criterion via its neighborhood information. It is proved that the analytic neural network is completely stable under this event-triggered rule. The main technique of proof is the ${\L}$ojasiewicz inequality to prove the finiteness of trajectory length. The realization of this event-triggered rule is verified by the exclusion of Zeno behaviors. Numerical examples are provided to illustrate the theoretical results and present the optimisation capability of the network dynamics.

In this paper, we utilize event-triggered coupling configuration to realize synchronization of linearly coupled dynamical systems. Here, the diffusion couplings are set up from the latest observations of the nodes of its neighborhood and the next observation time is triggered by the proposed criteria based on the local neighborhood information as well. Two scenarios are considered: continuous monitoring, that each node can observe its neighborhood's instantaneous states, and discrete monitoring, that each node can only obtain its neighborhood's states at the same time point when the coupling term is triggered. In both cases, we prove that if the system with persistent coupling can synchronize, then these event-trigger coupling strategies can synchronize the system, too.

In this paper, we propose a new self-triggered consensus algorithm in networks of multi-agents. Different from existing works, which are based on the observation of states, here, each agent determines its next update time based on its coupling structure. Both centralized and distributed approaches of the algorithms have been discussed. By transforming the algorithm to a proper discrete-time systems without self delays, we established a new analysis framework to prove the convergence of the algorithm. Then we extended the algorithm to networks with switching topologies, especially stochastically switching topologies. Compared to existing works, our algorithm is easier to understand and implement. It explicitly provides positive lower and upper bounds for the update time interval of each agent based on its coupling structure, which can also be independently adjusted by each agent according to its own situation. Our work reveals that the event/self triggered algorithms are essentially discrete and more suitable to a discrete analysis framework. Numerical simulations are also provided to illustrate the theoretical results.

This paper mainly investigates consensus problem with pull-based event-triggered feedback control. For each agent, the diffusion coupling feedbacks are based on the states of its in-neighbors at its latest triggering time and the next triggering time of this agent is determined by its in-neighbors' information as well. The general directed topologies, including irreducible and reducible cases, are investigated. The scenario of distributed continuous monitoring is considered firstly, namely each agent can observe its in-neighbors' continuous states. It is proved that if the network topology has a spanning tree, then the event-triggered coupling strategy can realize consensus for the multi-agent system. Then the results are extended to discontinuous monitoring, i.e., self-triggered control, where each agent computes its next triggering time in advance without having to observe the system's states continuously. The effectiveness of the theoretical results are illustrated by a numerical example finally., Comment: arXiv admin note: text overlap with arXiv:1407.1377

In this paper, we study consensus problem in multi-agent system with directed topology by event-triggered feedback control. That is, at each agent, the diffusion coupling feedbacks are based on the information from its latest observations to its in-neighbours. We derive distributed criteria to determine the next observation time of each agent that are triggered by its in-neighbours' information and its own states respectively. We prove that if the network topology is irreducible, then under the event-triggered coupling principles, the multi-agent system reach consensus. Then, we extend these results to the case of reducible topology with spanning tree. In addition, these results are also extended to the case of self-triggered control, in terms that the next triggering time of each agent is computed based on the current states, i.e., without observing the system's states continuously. The effectiveness of the theoretical results are illustrated by numerical examples.

This paper studies the consensus problem of multi-agent systems with asymmetric and reducible topologies. Centralized event-triggered rules are provided so as to reduce the frequency of system's updating. The diffusion coupling feedbacks of each agent are based on the latest observations from its in-neighbors and the system's next observation time is triggered by a criterion based on all agents' information. The scenario of continuous monitoring is first considered, namely all agents' instantaneous states can be observed. It is proved that if the network topology has a spanning tree, then the centralized event-triggered coupling strategy can realize consensus for the multi-agent system. Then the results are extended to discontinuous monitoring, where the system computes its next triggering time in advance without having to observe all agents' states continuously. Examples with numerical simulation are provided to show the effectiveness of the theoretical results.

In this paper, cluster consensus in continuous-time networks of multi-agents with time-varying topologies via non-identical inter-cluster inputs is studied. The cluster consensus contains two aspects: intra-cluster synchronization, that the state differences between agents in the same cluster converge to zero, and inter-cluster separation, that the states of the agents in different clusters do not approach. $\delta$-cluster-spanning-tree in continuous-time networks of multi-agent systems plays essential role in analysis of cluster synchronization. Inter-cluster separation can be realized by imposing adaptive inputs that are identical within the same cluster but different in different clusters, under the inter-cluster common influence condition. Simulation examples demonstrate the effectiveness of the derived theoretical results.

In this paper, we study pinning control problem of coupled dynamical systems with stochastically switching couplings and stochastically selected controller-node set. Here, the coupling matrices and the controller-node sets change with time, induced by a continuous-time Markovian chain. By constructing Lyapunov functions, we establish tractable sufficient conditions for exponentially stability of the coupled system. Two scenarios are considered here. First, we prove that if each subsystem in the switching system, i.e. with the fixed coupling, can be stabilized by the fixed pinning controller-node set, and in addition, the Markovian switching is sufficiently slow, then the time-varying dynamical system is stabilized. Second, in particular, for the problem of spatial pinning control of network with mobile agents, we conclude that if the system with the average coupling and pinning gains can be stabilized and the switching is sufficiently fast, the time-varying system is stabilized. Two numerical examples are provided to demonstrate the validity of these theoretical results, including a switching dynamical system between several stable sub-systems, and a dynamical system with mobile nodes and spatial pinning control towards the nodes when these nodes are being in a pre-designed region., Comment: 9 pages; 3 figures

In this paper, we study asymptotic stability of the zero solution of a class of differential systems governed by a scalar differential inequality with time-varying structures and delays. We establish a new generalized Halanay inequality for the asymptotic stability of the zero solution for such systems under more relaxed conditions than the existing ones. We also apply the theoretical results to the analysis of self synchronization in networks of delayed differential systems and obtained a more general sufficient condition for self synchronization.

In this paper, we study complete synchronization of the complex dynamical networks described by linearly coupled ordinary differential equation systems (LCODEs). The coupling considered here is time-varying in both the network structure and the reaction dynamics. Inspired by our previous paper [6], the extended Hajnal diameter is introduced and used to measure the synchronization in a general differential system. Then we find that the Hajnal diameter of the linear system induced by the time-varying coupling matrix and the largest Lyapunov exponent of the synchronized system play the key roles in synchronization analysis of LCODEs with the identity inner coupling matrix. As an application, we obtain a general sufficient condition guaranteeing directed time-varying graph to reach consensus. Example with numerical simulation is provided to show the effectiveness the theoretical results., Comment: 22 pages, 4 figures

Synchronization problem for linear coupled networks is a hot topic in recent decade. However, until now, some confused concepts and results still puzzle people. To avoid further misleading researchers, it is necessary to point out these misunderstandings, correct these mistakes and give precise results.

In this paper, we discuss pinning consensus in networks of multiagents via impulsive controllers. In particular, we consider the case of using only one impulsive controller. We provide a sufficient condition to pin the network to a prescribed value. It is rigorously proven that in case the underlying graph of the network has spanning trees, the network can reach consensus on the prescribed value when the impulsive controller is imposed on the root with appropriate impulsive strength and impulse intervals. Interestingly, we find that the permissible range of the impulsive strength completely depends on the left eigenvector of the graph Laplacian corresponding to the zero eigenvalue and the pinning node we choose. The impulses can be very sparse, with the impulsive intervals being lower bounded. Examples with numerical simulations are also provided to illustrate the theoretical results.

In this paper, cluster consensus of multi-agent systems is studied via inter-cluster nonidentical inputs. Here, we consider general graph topologies, which might be time-varying. The cluster consensus is defined by two aspects: the intra-cluster synchronization, that the state differences between each pair of agents in the same cluster converge to zero, and inter-cluster separation, that the states of the agents in different clusters are separated. For intra-cluster synchronization, the concepts and theories of consensus including the spanning trees, scramblingness, infinite stochastic matrix product and Hajnal inequality, are extended. With them, it is proved that if the graph has cluster spanning trees and all vertices self-linked, then static linear system can realize intra-cluster synchronization. For the time-varying coupling cases, it is proved that if there exists T>0 such that the union graph across any T-length time interval has cluster spanning trees and all graphs has all vertices self-linked, then the time-varying linear system can also realize intra-cluster synchronization. Under the assumption of common inter-cluster influence, a sort of inter-cluster nonidentical inputs are utilized to realize inter-cluster separation, that each agent in the same cluster receives the same inputs and agents in different clusters have different inputs. In addition, the boundedness of the infinite sum of the inputs can guarantee the boundedness of the trajectory. As an application, we employ a modified non-Bayesian social learning model to illustrate the effectiveness of our results., Comment: 13 pages, 4 figures

In this paper, we study cluster synchronization in networks of coupled non-identical dynamical systems. The vertices in the same cluster have the same dynamics of uncoupled node system but the uncoupled node systems in different clusters are different. We present conditions guaranteeing cluster synchronization and investigate the relation between cluster synchronization and the unweighted graph topology. We indicate that two condition play key roles for cluster synchronization: the common inter-cluster coupling condition and the intra-cluster communication. From the latter one, we interpret the two well-known cluster synchronization schemes: self-organization and driving, by whether the edges of communication paths lie at inter or intra-cluster. By this way, we classify clusters according to whether the set of edges inter- or intra-cluster edges are removable if wanting to keep the communication between pairs of vertices in the same cluster. Also, we propose adaptive feedback algorithms on the weights of the underlying graph, which can synchronize any bi-directed networks satisfying the two conditions above. We also give several numerical examples to illustrate the theoretical results.

For networks of pulse-coupled oscillators with delayed excitatory coupling, we analyze the firing behaviors depending on coupling strength and transmission delay. The parameter space consisting of strength and delay is partitioned into two regions. For one region, we derive a low bound of interspike intervals, from which three firing properties are obtained. However, this bound and these properties would no longer hold for another region. Finally, we show the different synchronization behaviors for networks with parameters in the two regions., Comment: PACS Numbers: 05.45.-a, 05.45.+b

The purpose of this short paper is to provide a theoretical analysis for the consensus problem under nonlinear protocols. A main contribution of this work is to generalize the previous consensus problems under nonlinear protocols for networks with undirected graphs to directed graphs (information flow). Our theoretical result is that if the directed graph is strongly connected and the nonlinear protocol is strictly increasing, then consensus can be realized. Some simple examples are also provided to demonstrate the validity of our theoretical result.

Recently, the synchronization of coupled dynamical systems has been widely studied. Synchronization is referred to as a process wherein two (or many) dynamical systems are adjusted to a common behavior as time goes to infinity, due to coupling or forcing. Therefore, before discussing synchronization, a basic problem on continuation of the solution must be solved: For given initial conditions, can the solution of coupled dynamical systems be extended to the infinite interval $[0,+\infty)$? In this paper, we propose a general model of coupled dynamical systems, which includes previously studied systems as special cases, and prove that under the assumption of QUAD, the solution of the general model exists on $[0,+\infty)$.

Collective behavior of pulse-coupled oscillators has been investigated widely. As an example of pulse-coupled networks, fireflies display many kinds of flashing patterns. Mirollo and Strogatz (1990) proposed a pulse-coupled oscillator model to explain the synchronization of South East Asian fireflies ({\itshape Pteroptyx malaccae}). However, transmission delays were not considered in their model. In fact, the presence of transmission delays can lead to desychronization. In this paper, pulse-coupled oscillator networks with delayed excitatory coupling are studied. Our main result is that under reasonable assumptions, pulse-coupled oscillator networks with delayed excitatory coupling can not achieve complete synchronization, which can explain why another species of fireflies ({\itshape Photinus pyralis}) rarely synchronizes flashing. Finally, two numerical simulations are given. In the first simulation, we illustrate that even if all the initial phases are very close to each other, there could still be big variations in the times to process the pulses in the pipeline. It implies that asymptotical synchronization typically also cannot be achieved. In the second simulation, we exhibit a phenomenon of clustering synchronization.

In this paper, without assuming symmetry, irreducibility, or linearity of the couplings, we prove that a single controller can pin a coupled complex network to a homogenous solution. Sufficient conditions are presented to guarantee the convergence of the pinning process locally and globally. An effective approach to adapt the coupling strength is proposed. Several numerical simulations are given to verify our theoretical analysis.

In this paper, we discuss delayed periodic dynamical systems, compare capability of criteria of global exponential stability in terms of various $L^{p}$ ($1\le p<\infty$) norms. A general approach to investigate global exponential stability in terms of various $L^{p}$ ($1\le p<\infty$) norms is given. Sufficient conditions ensuring global exponential stability are given, too. Comparisons of various stability criteria are given. More importantly, it is pointed out that sufficient conditions in terms of $L^{1}$ norm are enough and easy to implement in practice.

In this paper, we investigate the existence and the global stability of periodic solution for dynamical systems with periodic interconnections, inputs and self-inhibitions. The model is very general, the conditions are quite weak and the results obtained are universal.

Research of delayed neural networks with variable self-inhibitions, inter-connection weights, and inputs is an important issue. %In the real world, self-inhibitions, %inter-connection weights, and inputs should vary through time. In In this paper, we discuss a large class of delayed dynamical systems with almost periodic self-inhibitions, inter-connection weights, and inputs. This model is universal and includes delayed systems with time-varying delays, distributed delays as well as combination of both. We prove that under some mild conditions, the system has a unique almost periodic solution, which is globally exponentially stable. We propose a new approach, which is independent of existing theory concerning with existence of almost periodic solution for dynamical systems.

In this short paper, we point out that a single local stability controller can pin the complex network to a specified solution (or its equilibrium) of the coupled complex network. A rigorous mathematical proof is given, too.