Synchronization of nonlinearly coupled networks based on circle criterion

The problem of synchronization in networks of linear systems with nonlinear diffusive coupling and a connected undirected graph is studied. By means of a coordinate transformation, the system is reduced to the form of mean-field dynamics and a synchronization-error system. The network synchronization conditions are established based on the stability conditions of the synchronization-error system obtained using the circle criterion, and the results are used to derive the condition for synchronization in a network of neural-mass-model populations with a connected undirected graph. Simulation examples are presented to illustrate the obtained results.

LMI-Based Results on Robust Exponential Passivity of Uncertain Neutral-Type Neural Networks with Mixed Interval Time-Varying Delays via the Reciprocally Convex Combination Technique

The issue of the robust exponential passivity analysis for uncertain neutral-type neural networks with mixed interval time-varying delays is discussed in this work. For our purpose, the lower bounds of the delays are allowed to be either positive or zero adopting the combination of the model transformation, various inequalities, the reciprocally convex combination, and suitable Lyapunov–Krasovskii functional. A new robust exponential passivity criterion is received and formulated in the form of linear matrix inequalities (LMIs). Moreover, a new exponential passivity criterion is also examined for systems without uncertainty. Four numerical examples indicate our potential results exceed the previous results.

Finite-Time Passivity-Based Stability Criteria for Delayed Discrete-Time Neural Networks via New Weighted Summation Inequalities

In this paper, we study the problem of finite-time stability and passivity criteria for discrete-time neural networks (DNNs) with variable delays. The main objective is how to effectively evaluate the finite-time passivity conditions for NNs. To achieve this, some new weighted summation inequalities are proposed for application to a finite-sum term appearing in the forward difference of a novel Lyapunov-Krasovskii functional, which helps to ensure that the considered delayed DNN is passive. The derived passivity criteria are presented in terms of linear matrix inequalities. A numerical example is given to illustrate the effectiveness of the proposed results.

Passivity and Output Synchronization of Complex Dynamical Networks With Fixed and Adaptive Coupling Strength

This paper considers a complex dynamical network model, in which the input and output vectors have different dimensions. We, respectively, investigate the passivity and the relationship between output strict passivity and output synchronization of the complex dynamical network with fixed and adaptive coupling strength. First, two new passivity definitions are proposed, which generalize some existing concepts of passivity. By constructing appropriate Lyapunov functional, some sufficient conditions ensuring the passivity, input strict passivity and output strict passivity are derived for the complex dynamical network with fixed coupling strength. In addition, we also reveal the relationship between output strict passivity and output synchronization of the complex dynamical network with fixed coupling strength. By employing the relationship between output strict passivity and output synchronization, a sufficient condition for output synchronization of the complex dynamical network with fixed coupling strength is established. Then, we extend these results to the case when the coupling strength is adaptively adjusted. Finally, two examples with numerical simulations are provided to demonstrate the effectiveness of the proposed criteria.

Neural Skyline Filtering for Imbalance Features Classification

In the current digitalized era, large datasets play a vital role in features extractions, information processing, knowledge mining and management. Sometimes, existing mining approaches are not sufficient to handle large volume of datasets. Biological data processing also suffers for the same issue. In the present work, a classification process is carried out on large volume of exons and introns from a set of raw data. The proposed work is designed into two parts as pre-processing and mapping-based classification. For pre-processing, three filtering techniques have been used. However, these traditional filtering techniques face difficulties for large datasets due to the long required time during large data processing as well as the large required memory size. In this regard, a mapping-based neural skyline filtering approach is designed. Randomized algorithm performed the mapping for large volume of datasets based on objective function. The objective function determines the randomized size of the datasets according to the homogeneity. Around 200 million DNA base pairs have been used for experimental analysis. Experimental result shows that mapping centric filtering outperforms other filtering techniques during large data processing.

Passivity of Directed and Undirected Complex Dynamical Networks With Adaptive Coupling Weights

A complex dynamical network consisting of N identical neural networks with reaction-diffusion terms is considered in this paper. First, several passivity definitions for the systems with different dimensions of input and output are given. By utilizing some inequality techniques, several criteria are presented, ensuring the passivity of the complex dynamical network under the designed adaptive law. Then, we discuss the relationship between the synchronization and output strict passivity of the proposed network model. Furthermore, these results are extended to the case when the topological structure of the network is undirected. Finally, two examples with numerical simulations are provided to illustrate the correctness and effectiveness of the proposed results.

Passivity and Synchronization of Linearly Coupled Reaction-Diffusion Neural Networks With Adaptive Coupling

In this paper, we study a general array model of coupled reaction-diffusion neural networks (NNs) with adaptive coupling. In order to ensure the passivity of the coupled reaction-diffusion neural networks, some adaptive strategies to tune the coupling strengths among network nodes are designed. By utilizing some inequality techniques and the designed adaptive laws, several sufficient conditions ensuring passivity are obtained. In addition, we reveal the relationship between passivity and synchronization of the coupled reaction-diffusion NNs. Based on the obtained passivity results and the relationship between passivity and synchronization, a global synchronization criterion is established. Finally, numerical simulations are presented to illustrate the correctness and effectiveness of the proposed results.

Passivity and Passification of Memristor-Based Recurrent Neural Networks With Additive Time-Varying Delays

This paper presents a new design scheme for the passivity and passification of a class of memristor-based recurrent neural networks (MRNNs) with additive time-varying delays. The predictable assumptions on the boundedness and Lipschitz continuity of activation functions are formulated. The systems considered here are based on a different time-delay model suggested recently, which includes additive time-varying delay components in the state. The connection between the time-varying delay and its upper bound is considered when estimating the upper bound of the derivative of Lyapunov functional. It is recognized that the passivity condition can be expressed in a linear matrix inequality (LMI) format and by using characteristic function method. For state feedback passification, it is verified that it is apathetic to use immediate or delayed state feedback. By constructing a Lyapunov-Krasovskii functional and employing Jensen's inequality and reciprocal convex combination technique together with a tighter estimation of the upper bound of the cross-product terms derived from the derivatives of the Lyapunov functional, less conventional delay-dependent passivity criteria are established in terms of LMIs. Moreover, second-order reciprocally convex approach is employed for deriving the upper bound for terms with inverses of squared convex parameters. The model based on the memristor with additive time-varying delays widens the application scope for the design of neural networks. Finally, pertinent examples are given to show the advantages of the derived passivity criteria and the significant improvement of the theoretical approaches.

New Results on Passivity Analysis of Stochastic Neural Networks with Time-Varying Delay and Leakage Delay

The passivity problem for a class of stochastic neural networks systems (SNNs) with varying delay and leakage delay has been further studied in this paper. By constructing a more effective Lyapunov functional, employing the free-weighting matrix approach, and combining with integral inequality technic and stochastic analysis theory, the delay-dependent conditions have been proposed such that SNNs are asymptotically stable with guaranteed performance. The time-varying delay is divided into several subintervals and two adjustable parameters are introduced; more information about time delay is utilised and less conservative results have been obtained. Examples are provided to illustrate the less conservatism of the proposed method and simulations are given to show the impact of leakage delay on stability of SNNs.

Passivity and passification of memristor-based recurrent neural networks with time-varying delays

This paper presents new theoretical results on the passivity and passification of a class of memristor-based recurrent neural networks (MRNNs) with time-varying delays. The casual assumptions on the boundedness and Lipschitz continuity of neuronal activation functions are relaxed. By constructing appropriate Lyapunov-Krasovskii functionals and using the characteristic function technique, passivity conditions are cast in the form of linear matrix inequalities (LMIs), which can be checked numerically using an LMI toolbox. Based on these conditions, two procedures for designing passification controllers are proposed, which guarantee that MRNNs with time-varying delays are passive. Finally, two illustrative examples are presented to show the characteristics of the main results in detail.

State estimation for delayed genetic regulatory networks based on passivity theory

This paper is concerned with the state estimation problem for delayed genetic regulatory networks (GRNs) based on passivity analysis approach. The main purpose of the problem is to design the estimator to approximate the true concentrations of the mRNA and protein through available measurement outputs. Time-varying delays are explicitly assumed to be non-differentiable and constraint on the derivative of the time-varying delay is less than one can be removed. Based on the Lyapunov-Krasovskii functionals involving triple integral terms, using some integral inequalities and convex combination technique, a delay-dependent passivity criterion is established for GRNs in terms of linear matrix inequalities (LMIs) that can efficiently be solved by any available LMI solvers. Finally, numerical examples and simulation are presented to demonstrate the efficiency of the proposed estimation schemes.

Generalized outer synchronization between complex dynamical networks

In this paper, the problem of generalized outer synchronization between two completely different complex dynamical networks is investigated. With a nonlinear control scheme, a sufficient criterion for this generalized outer synchronization is derived based on Barbalat's lemma. Two corollaries are also obtained, which contains the situations studied in two lately published papers as special cases. Numerical simulations further demonstrate the feasibility and effectiveness of the theoretical results.

On the relationship between pinning control effectiveness and graph topology in complex networks of dynamical systems

This paper concerns pinning control in complex networks of dynamical systems, where an external forcing signal is applied to the network in order to align the state of all the systems to the forcing signal. By considering the control signal as the state of a virtual dynamical system, this problem can be studied as a synchronization problem. The main focus of this paper is to study how the effectiveness of pinning control depends on the underlying graph. In particular, we look at the relationship between pinning control effectiveness and the complex network asymptotically as the number of vertices in the network increases. We show that for vertex balanced graphs, if the number of systems receiving pinning control does not grow as fast as the total number of systems, then the strength of the control needed to effect pinning control will be unbounded as the number of vertices grows. Furthermore, in order to achieve pinning control in systems coupled via locally connected graphs, as the number of systems grows, both the pinning control and the coupling among all systems need to increase. Finally, we give evidence to show that applying pinning control to minimize the distances between all systems to the pinned systems can lead to a more effective pinning control.

Synchronization in power-law networks

We consider realistic power-law graphs, for which the power-law holds only for a certain range of degrees. We show that synchronizability of such networks depends on the expected average and expected maximum degree. In particular, we find that networks with realistic power-law graphs are less synchronizable than classical random networks. Finally, we consider hybrid graphs, which consist of two parts: a global graph and a local graph. We show that hybrid networks, for which the number of global edges is proportional to the number of total edges, almost surely synchronize.