Search

An Innocents-Spreaders-Calmness-Removes (ISCR) rumor propagation model is established with nonlinear incidence and time delay on complex networks in this paper. Based on the mean-field theory, the spreading dynamics of the ISCR model are discussed in detail. Firstly, the basic reproduction number R 0 is obtained by the next generation matrix method to ensure the existence of rumor-prevailing equilibrium. Secondly, by utilizing the Routh–Hurwitz criterion and LaSalle's invariance principle, the local stability and global stability of rumor equilibria are proved. Moreover, the optimal control is presented via Pontryagin's minimum principle, which is to effectively restrain rumor diffusion. Finally, the theoretical results are verified by numerical simulations. [ABSTRACT FROM AUTHOR]

In this paper, a complex-variable neural network model is obtained for solving complex-variable optimization problems described by differential inclusion. Based on the nonpenalty idea, the constructed algorithm does not need to design penalty parameters, that is, it is easier to be designed in practical applications. And some theorems for the convergence of the proposed model are given under suitable conditions. Finally, two numerical examples are shown to illustrate the correctness and effectiveness of the proposed optimization model. [ABSTRACT FROM AUTHOR]

The problem of cluster consensus with multiple leaders is called multitracking. In this article, a sort of multitracking of first-order multiagent systems with adaptive coupling strength is studied by the application of adaptive strategy, and the delayed relation between various leaders and clusters is considered. To reach the clustered multitracking goal, a novel pinning-like control protocol with adaptive approach is designed according to the properties of network topology. In addition, the structure of the networked system is a weakly connected digraph. Some conditions are derived to ensure that the nodes in the same cluster reach the consensus via tracking their leader, while leaders will keep a delayed relation with the settled leader node as time goes on to form the required delay consensus. [ABSTRACT FROM AUTHOR]

In this paper, the edge-based and node-based adaptive algorithms are established, respectively, to solve the distribution convex optimization problem. The algorithms are based on multiagent systems with general linear dynamics; each agent uses only local information and cooperatively reaches the minimizer. Compared with existing results, a damping term in the adaptive law is introduced for the adaptive algorithms, which makes the algorithms more robust. Under some sufficient conditions, all agents asymptotically converge to the consensus value which minimizes the cost function. An example is provided for the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we mainly study the performance of star-composed networks which can achieve consensus. Specifically, we investigate the convergence speed and robustness of the consensus of the networks, which can be measured by the smallest nonzero eigenvalue λ2 of the Laplacian matrix and the H2 norm of the graph, respectively. In particular, we introduce the notion of the corona of two graphs to construct star-composed networks and apply the Laplacian spectrum to discuss the convergence speed and robustness for the communication network. Finally, the performances of the star-composed networks have been compared, and we find that the network in which the centers construct a balanced complete bipartite graph has the most advantages of performance. Our research would provide a new insight into the combination between the field of consensus study and the theory of graph spectra. [ABSTRACT FROM AUTHOR]

The stability of discrete-time impulsive delay neural networks with and without uncertainty is investigated. First, by using Razumikhin-type theorem, a new less conservative condition for the exponential stability of discrete-time neural network with delay and impulse is proposed. Moreover, some new sufficient conditions are derived to guarantee the stability of uncertain discrete-time neural network with delay and impulse by using Lyapunov function and linear matrix inequality (LMI). Finally, several examples with numerical simulation are presented to demonstrate the effectiveness of the obtained results. [ABSTRACT FROM AUTHOR]