Online Correlation Clustering for Dynamic Complete Signed Graphs [PDF]
In the correlation clustering problem for complete signed graphs, the input is a complete signed graph with edges weighted as $+1$ (denote recommendation to put this pair in the same cluster) or $-1$ (recommending to put this pair of vertices in separate
A. Shakiba
semanticscholar +2 more sources
On Manipulating Weight Predictions in Signed Weighted Networks [PDF]
Adversarial social network analysis studies how graphs can be rewired or otherwise manipulated to evade social network analysis tools. While there is ample literature on manipulating simple networks, more sophisticated network types are much less ...
Tomasz Lizurej +2 more
semanticscholar +2 more sources
Polarization and multiscale structural balance in signed networks [PDF]
Polarization, or a division into mutually hostile groups, is a common feature of social systems. It is studied in Structural Balance Theory in terms of semicycles in signed networks.
Szymon Talaga +3 more
doaj +2 more sources
Structural Balance of Complex Weighted Graphs and Multi-Partite Consensus [PDF]
The structural balance of a signed graph is known to be necessary and sufficient to obtain a bipartite consensus among agents with friend-foe relationships.
Honghui Wu +4 more
semanticscholar +2 more sources
The Kuramoto Model on Oriented and Signed Graphs [PDF]
Many real-world systems of coupled agents exhibit directed interactions, meaning that the influence of an agent on another is not reciprocal. Furthermore, interactions usually do not have identical amplitude and/or sign.
R. Delabays +2 more
semanticscholar +2 more sources
Qualitative Reasoning Methodology for the Generation of Process Plant Operating Procedures [PDF]
The analysis of operating procedures in the early stages of design can lead to safer and higher performance plants. Qualitative reasoning techniques hold considerable promise in supporting generations of operating procedures, since they are able to ...
Vianna, Regina Ferreira
core +7 more sources
Extended Double Covers and Homomorphism Bounds of Signed Graphs [PDF]
International audienceA signed graph (G, σ) is a graph G together with an assignment σ : E(G) → {+, −}. The notion of homomorphisms of signed graphs is a relatively new development which allows to strengthen the connection between the theories of minors ...
Xu, Rongxing +5 more
core +2 more sources
Learning Weight Signed Network Embedding with Graph Neural Networks
AbstractNetwork embedding aims to map nodes in a network to low-dimensional vector representations. Graph neural networks (GNNs) have received much attention and have achieved state-of-the-art performance in learning node representation. Using fundamental sociological theories (status theory and balance theory) to model signed networks, basing GNN on ...
Zekun Lu +4 more
openaire +3 more sources
Controllability and observability of linear multi-agent systems over matrix-weighted signed networks [PDF]
In this paper, the controllability and observability of linear multi-agent systems over matrix-weighted signed networks are analyzed. Firstly, the definition of equitable partition of matrix-weighted signed multi-agent system is given, and the upper ...
Lan-Hao Zhao +3 more
semanticscholar +1 more source
The replacements of signed graphs and Kauffman brackets of link families [PDF]
Let G be a signed graph. Let 6 be the graph obtained from G by replacing each edge e of G by a chain or a sheaf. In this paper we first establish a relation between the Q-polynomial of (G) over cap [L.H.
Zhang,F, Jin,X, 张福基
core +3 more sources

