graph neural networkssigned bipartite networkssigned graph neural networksPositive and negative association prediction between gene and phenotype helps to illustrate the underlying mechanism of complex traits in organisms. The transcription and regulation activity of specific genes will be adjusted accordingly ...
This study explores the bipartite secure synchronization problem of coupled quaternion-valued neural networks (QVNNs), in which variable sampled communications and random deception attacks are considered. Firstly, by employing the signed graph theory, the mathematical model of coupled QVNNs with structur...
Proof. The proof follows by Theorem 21 as the underlying graph of the signed graph Σ is a bipartite graph. Theorem 24 A signed graph Σ∈Ψ(E3), is a solution to ŋ(Σ)∼(Σ)^3, if and only if for Σ∈Ψ(E3), the triangle is negative in Σ. Proof. Given that Σ∈Ψ(E3...
Xiao, Bipartite containment control of fractional multi-agent systems with input delay on switching signed directed networks. ISA Trans. 135, 130–137 (2023) Article MATH Google Scholar J. Zhang, H. Zhang, W. Li, Y. Wang, Adaptive event-triggered bipartite containment control of linear multi...
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
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 ...
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...
If the signed graph is structurally unbalanced, systems over signed graphs can only achieve common synchronization (consensus) instead of the bipartite synchronization [24]. At present, the bipartite synchronization of systems over structurally balanced signed graphs has obtained some interesting results (...
with the scalar-weighted networks, where bipartite consensus can be achieved if and only if the underlying signed network is structurally balanced, the structural balance property is no longer a graph-theoretic equivalence to the bipartite consensus in the case of signed matrix-weighted networks. To...
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. ...