Set-Membership Filtering Approach to Dynamic Event-Triggered Fault Estimation for a Class of Nonlinear Time-Varying Complex Networks

The present study addresses the problem of fault estimation for a specific class of nonlinear time-varying complex networks,utilizing an unknown-input-observer approach within the framework of dynamic event-triggered mechanism(DETM).In order to optimize communication resource utilization,the DETM is employed to determine whether the current measurement data should be transmitted to the estimator or not.To guarantee a satisfactory estimation performance for the fault signal,an unknown-input-observer-based estimator is constructed to decouple the estimation error dynamics from the influence of fault signals.The aim of this paper is to find the suitable estimator parameters under the effects of DETM such that both the state estimates and fault estimates are confined within two sets of closed ellipsoid domains.The techniques of recursive matrix inequality are applied to derive sufficient conditions for the existence of the desired estimator,ensuring that the specified performance requirements are met under certain conditions.Then,the estimator gains are derived by minimizing the ellipsoid domain in the sense of trace and a recursive estimator parameter design algorithm is then provided.Finally,a numerical example is conducted to demonstrate the effectiveness of the designed estimator.

Analysis of cut vertex in the control of complex networks

The control of complex networks is affected by their structural characteristic. As a type of key nodes in a network structure, cut vertexes are essential for network connectivity because their removal will disconnect the network. Despite their fundamental importance, the influence of the cut vertexes on network control is still uncertain. Here, we reveal the relationship between the cut vertexes and the driver nodes, and find that the driver nodes tend to avoid the cut vertexes.However, driving cut vertexes reduce the energy required for controlling complex networks, since cut vertexes are located near the middle of the control chains. By employing three different node failure strategies, we investigate the impact of cut vertexes failure on the energy required. The results show that cut vertex failures markedly increase the control energy because the cut vertexes are larger-degree nodes. Our results deepen the understanding of the structural characteristic in network control.

Important edge identification in complex networks based on local and global features

Identifying important nodes and edges in complex networks has always been a popular research topic in network science and also has important implications for the protection of real-world complex systems.Finding the critical structures in a system allows us to protect the system from attacks or failures with minimal cost.To date,the problem of identifying critical nodes in networks has been widely studied by many scholars,and the theory is becoming increasingly mature.However,there is relatively little research related to edges.In fact,critical edges play an important role in maintaining the basic functions of the network and keeping the integrity of the structure.Sometimes protecting critical edges is less costly and more flexible in operation than just focusing on nodes.Considering the integrity of the network topology and the propagation dynamics on it,this paper proposes a centrality measure based on the number of high-order structural overlaps in the first and second-order neighborhoods of edges.The effectiveness of the metric is verified by the infection-susceptibility(SI)model,the robustness index R,and the number of connected branchesθ.A comparison is made with three currently popular edge importance metrics from two synthetic and four real networks.The simulation results show that the method outperforms existing methods in identifying critical edges that have a significant impact on both network connectivity and propagation dynamics.At the same time,the near-linear time complexity can be applied to large-scale networks.

Vertex centrality of complex networks based on joint nonnegative matrix factorization and graph embedding

Finding crucial vertices is a key problem for improving the reliability and ensuring the effective operation of networks,solved by approaches based on multiple attribute decision that suffer from ignoring the correlation among each attribute or the heterogeneity between attribute and structure. To overcome these problems, a novel vertex centrality approach, called VCJG, is proposed based on joint nonnegative matrix factorization and graph embedding. The potential attributes with linearly independent and the structure information are captured automatically in light of nonnegative matrix factorization for factorizing the weighted adjacent matrix and the structure matrix, which is generated by graph embedding. And the smoothness strategy is applied to eliminate the heterogeneity between attributes and structure by joint nonnegative matrix factorization. Then VCJG integrates the above steps to formulate an overall objective function, and obtain the ultimately potential attributes fused the structure information of network through optimizing the objective function. Finally, the attributes are combined with neighborhood rules to evaluate vertex's importance. Through comparative analyses with experiments on nine real-world networks, we demonstrate that the proposed approach outperforms nine state-of-the-art algorithms for identification of vital vertices with respect to correlation, monotonicity and accuracy of top-10 vertices ranking.

Self-similarity of complex networks under centrality-based node removal strategy

Real-world networks exhibit complex topological interactions that pose a significant computational challenge to analyses of such networks.Due to limited resources,there is an urgent need to develop dimensionality reduction techniques that can significantly reduce the structural complexity of initial large-scale networks.In this paper,we propose a subgraph extraction method based on the node centrality measure to reduce the size of the initial network topology.Specifically,nodes with smaller centrality value are removed from the initial network to obtain a subgraph with a smaller size.Our results demonstrate that various real-world networks,including power grids,technology,transportation,biology,social,and language networks,exhibit self-similarity behavior during the reduction process.The present results reveal the selfsimilarity and scale invariance of real-world networks from a different perspective and also provide an effective guide for simplifying the topology of large-scale networks.

SLGC: Identifying influential nodes in complex networks from the perspectives of self-centrality, local centrality, and global centrality

Identifying influential nodes in complex networks and ranking their importance plays an important role in many fields such as public opinion analysis, marketing, epidemic prevention and control. To solve the issue of the existing node centrality measure only considering the specific statistical feature of a single dimension, a SLGC model is proposed that combines a node’s self-influence, its local neighborhood influence, and global influence to identify influential nodes in the network. The exponential function of e is introduced to measure the node’s self-influence;in the local neighborhood,the node’s one-hop neighboring nodes and two-hop neighboring nodes are considered, while the information entropy is introduced to measure the node’s local influence;the topological position of the node in the network and the shortest path between nodes are considered to measure the node’s global influence. To demonstrate the effectiveness of the proposed model, extensive comparison experiments are conducted with eight existing node centrality measures on six real network data sets using node differentiation ability experiments, susceptible–infected–recovered(SIR) model and network efficiency as evaluation criteria. The experimental results show that the method can identify influential nodes in complex networks more accurately.

A Survey on the Role of Complex Networks in IoT and Brain Communication

Complex networks on the Internet of Things(IoT)and brain communication are the main focus of this paper.The benefits of complex networks may be applicable in the future research directions of 6G,photonic,IoT,brain,etc.,communication technologies.Heavy data traffic,huge capacity,minimal level of dynamic latency,etc.are some of the future requirements in 5G+and 6G communication systems.In emerging communication,technologies such as 5G+/6G-based photonic sensor communication and complex networks play an important role in improving future requirements of IoT and brain communication.In this paper,the state of the complex system considered as a complex network(the connection between the brain cells,neurons,etc.)needs measurement for analyzing the functions of the neurons during brain communication.Here,we measure the state of the complex system through observability.Using 5G+/6G-based photonic sensor nodes,finding observability influenced by the concept of contraction provides the stability of neurons.When IoT or any sensors fail to measure the state of the connectivity in the 5G+or 6G communication due to external noise and attacks,some information about the sensor nodes during the communication will be lost.Similarly,neurons considered sing the complex networks concept neuron sensors in the brain lose communication and connections.Therefore,affected sensor nodes in a contraction are equivalent to compensate for maintaining stability conditions.In this compensation,loss of observability depends on the contraction size which is a key factor for employing a complex network.To analyze the observability recovery,we can use a contraction detection algorithm with complex network properties.Our survey paper shows that contraction size will allow us to improve the performance of brain communication,stability of neurons,etc.,through the clustering coefficient considered in the contraction detection algorithm.In addition,we discuss the scalability of IoT communication using 5G+/6G-based photonic technology.

Quasi-synchronization of fractional-order complex networks with random coupling via quantized control

We investigate the quasi-synchronization of fractional-order complex networks(FCNs) with random coupling via quantized control. Firstly, based on the logarithmic quantizer theory and the Lyapunov stability theory, a new quantized feedback controller, which can make all nodes of complex networks quasi-synchronization and eliminate the disturbance of random coupling in the system state, is designed under non-delay conditions. Secondly, we extend the theoretical results under non-delay conditions to time-varying delay conditions and design another form of quantization feedback controller to ensure that the network achieves quasi-synchronization. Furthermore, the error bound of quasi-synchronization is obtained.Finally, we verify the accuracy of our results using two numerical simulation examples.

Synchronization of stochastic complex networks with time-delayed coupling

Noise and time delay are inevitable in real-world networks. In this article, the framework of master stability function is generalized to stochastic complex networks with time-delayed coupling. The focus is on the effects of noise, time delay,and their inner interactions on the network synchronization. It is found that when there exists time-delayed coupling in the network and noise diffuses through all state variables of nodes, appropriately increasing the noise intensity can effectively improve the network synchronizability;otherwise, noise can be either beneficial or harmful. For stochastic networks, large time delays will lead to desynchronization. These findings provide valuable references for designing optimal complex networks in practical applications.

Input Structure Design for Structural Controllability of Complex Networks

This paper addresses the problem of the input design of large-scale complex networks.Two types of network components,redundant inaccessible strongly connected component(RISCC)and intermittent inaccessible strongly connected component(IISCC)are defined,and a subnetwork called a driver network is developed.Based on these,an efficient method is proposed to find the minimum number of controlled nodes to achieve structural complete controllability of a network,in the case that each input can act on multiple state nodes.The range of the number of input nodes to achieve minimal control,and the configuration method(the connection between the input nodes and the controlled nodes)are presented.All possible input solutions can be obtained by this method.Moreover,we give an example and some experiments on real-world networks to illustrate the effectiveness of the method.

Synchronous Control of Complex Networks with Fuzzy Connections

This article is based on the T-S fuzzy control theory and investigates the synchronization control problem of complex networks with fuzzy connections. Firstly, the main stability equation of a complex network system is obtained, which can determine the stability of the synchronous manifold. Secondly, the main stable system is fuzzified, and based on fuzzy control theory, the control design of the fuzzified main stable system is carried out to obtain a coupling matrix that enables the complex network to achieve complete synchronization. The numerical analysis results indicate that the control method proposed in this paper can effectively achieve synchronization control of complex networks, while also controlling the transition time for the network to achieve synchronization.

Evidential method to identify influential nodes in complex networks

Identifying influential nodes in complex networks is still an open issue. In this paper, a new comprehensive centrality mea- sure is proposed based on the Dempster-Shafer evidence theory. The existing measures of degree centrality, betweenness centra- lity and closeness centrality are taken into consideration in the proposed method. Numerical examples are used to illustrate the effectiveness of the proposed method.

A dynamic epidemic control model on uncorrelated complex networks

In this paper, a dynamic epidemic control model on the uncorrelated complex networks is proposed. By means of theoretical analysis, we found that the new model has a similar epidemic threshold as that of the susceptible-infectedrecovered （SIR） model on the above networks, but it can reduce the prevalence of the infected individuals remarkably. This result may help us understand epidemic spreading phenomena on real networks and design appropriate strategies to control infections.

Normalized entropy of rank distribution： a novel measure of heterogeneity of complex networks

Many unique properties of complex networks result from heterogeneity. The measure and analysis of heterogeneity are important and desirable to the research of the properties and functions of complex networks. In this paper, the rank distribution is proposed as a new statistic feature of complex networks. Based on the rank distribution, a novel measure of the heterogeneity called a normalized entropy of rank distribution （NERD） is proposed. The NERD accords with the normal meaning of heterogeneity within the context of complex networks compared with conventional measures. The heterogeneity of scale-free networks is studied using the NERD. It is shown that scale-free networks become more heterogeneous as the scaling exponent decreases and the NERD of scale-free networks is independent of the number of vertices, which indicates that the NERD is a suitable and effective measure of heterogeneity for networks with different sizes.

Optimization-based topology identification of complex networks

In many cases, the topological structures of a complex network are unknown or uncertain, and it is of significance to identify the exact topological structure. An optimization-based method of identifying the topological structure of a complex network is proposed in this paper. Identification of the exact network topological structure is converted into a minimal optimization problem by using the estimated network. Then, an improved quantum-behaved particle swarm optimization algorithm is used to solve the optimization problem. Compared with the previous adaptive synchronization- based method, the proposed method is simple and effective and is particularly valid to identify the topological structure of synchronization complex networks. In some cases where the states of a complex network are only partially observable, the exact topological structure of a network can also be identified by using the proposed method. Finally, numerical simulations are provided to show the effectiveness of the proposed method.

Self-Organized Optimization of Transport on Complex Networks

We propose a self-organized optimization mechanism to improve the transport capacity of complex gradient networks. We find that, regardless of network topology, the congestion pressure can be strongly reduced by the self-organized optimization mechanism. Furthermore, the random scale-free topology is more efficient to reduce congestion compared with the random Poisson topology under the optimization mechanism. The reason is that the optimization mechanism introduces the correlations between the gradient field and the local topology of the substrate network. Due to the correlations, the cutoff degree of the gradient network is strongly reduced and the number of the nodes exerting their maximal transport capacity consumedly increases. Our work presents evidence supporting the idea that scale-free networks can efficiently improve their transport capacity by self- organized mechanism under gradient-driven transport mode.

Decentralized Adaptive Strategies for Synchronization of Fractional-order Complex Networks

This paper focuses on synchronization of fractionalorder complex dynamical networks with decentralized adaptive coupling.Based on local information among neighboring nodes,two fractional-order decentralized adaptive strategies are designed to tune all or only a small fraction of the coupling gains respectively.By constructing quadratic Lyapunov functions and utilizing fractional inequality techniques,Mittag-Leffler function,and Laplace transform,two sufficient conditions are derived for reaching network synchronization by using the proposed adaptive laws.Finally,two numerical examples are given to verify the theoretical results.

Dynamic properties of epidemic spreading on finite size complex networks

The Internet presents a complex topological structure, on which computer viruses can easily spread. By using theoretical analysis and computer simulation methods, the dynamic process of disease spreading on finite size networks with complex topological structure is investigated. On the finite size networks, the spreading process of SIS （susceptibleinfected-susceptible） model is a finite Markov chain with an absorbing state. Two parameters, the survival probability and the conditional infecting probability, are introduced to describe the dynamic properties of disease spreading on finite size networks. Our results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks. Also, knowledge about the dynamic character of virus spreading is helpful for adopting immunity policy.

Adaptive generalized matrix projective lag synchronization between two different complex networks with non-identical nodes and different dimensions

The adaptive generalized matrix projective lag synchronization between two different complex networks with non-identical nodes and different dimensions is investigated in this paper. Based on Lyapunov stability theory and Barbalat＇s lemma, generalized matrix projective lag synchronization criteria are derived by using the adaptive control method. Furthermore, each network can be undirected or directed, connected or disconnected, and nodes in either network may have identical or different dynamics. The proposed strategy is applicable to almost all kinds of complex networks. In addition, numerical simulation results are presented to illustrate the effectiveness of this method, showing that the synchronization speed is sensitively influenced by the adaptive law strength, the network size, and the network topological structure.

Network dynamics and its relationships to topology and coupling structure in excitable complex networks

All dynamic complex networks have two important aspects, pattern dynamics and network topology. Discovering different types of pattern dynamics and exploring how these dynamics depend or/network topologies are tasks of both great theoretical importance and broad practical significance. In this paper we study the oscillatory behaviors of excitable complex networks （ECNs） and find some interesting dynamic behaviors of ECNs in oscillatory probability, the multiplicity of oscillatory attractors, period distribution, and different types of oscillatory patterns （e.g., periodic, quasiperiodic, and chaotic）. In these aspects, we further explore strikingly sharp differences among network dynamics induced by different topologies （random or scale-free topologies） and different interaction structures （symmetric or asymmetric couplings）. The mechanisms behind these differences are explained physically.