This paper mainly discusses the problem of fast fixed-time bipartite synchronization in the complex networks with signed graph that is based on TS fuzzy system. By designing suitable and effective controller, the synchronization of the considered complex networks has been achieved successfully in this ...
To formulate signed networks and exhibit the competitive relation, a structurally balanced signed network is built and all the units are divided into two subcommunities. By employing Lyapunov method and graph theory, some sufficient conditions on bipartite synchronization are given. Meanwhile, when ...
Assume that graph Gs has no self-loops, namely, πmms=0. For any pair of distinct vertices vj, vm, if Bipartite synchronization in strongly connected networks by pinning feedback strategy In this subsection, the detailed analysis will be discussed to guarantee bipartite synchronization of ...
Signed network embedding methods allow for a low-dimensional representation of nodes and primarily focus on partitioning the graph into clusters, hence losing information on continuous node attributes. Here, we introduce a spectral embedding algorithm fo
Due to the superior performance of finite/fixed-time controls, finite-time bipartite synchronization (FeTBS) or fixed-time bipartite synchronization (FdTBS) of neural networks (NNs) in the unsigned graph have been investigated intensively. However, distributed delays, which are more challenging, are...
The second鈥恛rder neural networks, called inertial neural networks, can be transformed into differential equations of first鈥恛rder by implementing suitable variable substitution. Under certain hypothesis about the node dynamics, signed graph theory and balanced topology of networks, some conditions are ...
Although many results have been obtained to address the consensus problem of multi-agent systems based on event-triggered pinning control, few papers have disscussed the bipartite consensus problem of second-order multi-agent systems under signed graph, which is the main motivation of this work. ...
This paper mainly studies quasi-bipartite synchronization (QBPS) of signed delayed neural networks (SDNNs) under impulsive effects, in which the nodes have cooperative as well as antagonistic interactions. It is assumed that disturbance occurs in the communication channels between some neighboring ...
Li et al. use a graph propagation algorithm based on the answerer–channel bipartite graph to detect spam answers in Community Question Answering sites [11]. Integro [9] is an optimized random walk-based ranking algorithm for fake account detection. SybilEdge [28] uses friend request acceptance...