Controllability and observability of linear multi-agent systems over matrix-weighted signed networks [PDF]
arXiv.org, 2022 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 ...
Lanhao Zhao +3 more
semanticscholar +1 more source
Online Correlation Clustering for Dynamic Complete Signed Graphs [PDF]
Social Science Research Network, 2022 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 +1 more source
Polarization and multiscale structural balance in signed networks
Communications Physics, 2023 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 +1 more source
Stable Vectorization of Multiparameter Persistent Homology using Signed Barcodes as Measures [PDF]
Neural Information Processing Systems, 2023 Persistent homology (PH) provides topological descriptors for geometric data, such as weighted graphs, which are interpretable, stable to perturbations, and invariant under, e.g., relabeling.
David Loiseaux +4 more
semanticscholar +1 more source
Signed distance Laplacian matrices for signed graphs [PDF]
Linear and multilinear algebra, 2020 A signed graph is a graph whose edges are labelled either positive or negative. Corresponding to the two signed distance matrices defined for signed graphs, we define two signed distance Laplacian matrices.
Roshni T. Roy +3 more
semanticscholar +1 more source
Weighted Model Counting with Twin-Width [PDF]
International Conference on Theory and Applications of Satisfiability Testing, 2022 Bonnet et al. (FOCS 2020) introduced the graph invariant twin-width and showed that many NP-hard problems are tractable for graphs of bounded twin-width, generalizing similar results for other width measures, including treewidth and clique-width. In this
R. Ganian +4 more
semanticscholar +1 more source
Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering [PDF]
, 2018 Graph clustering, or community detection, is the task of identifying groups of closely related objects in a large network. In this paper we introduce a new community-detection framework called LambdaCC that is based on a specially weighted version of ...
Gleich, David +2 more
core +2 more sources
GASP, a generalized framework for agglomerative clustering of signed graphs and its application to Instance Segmentation [PDF]
Computer Vision and Pattern Recognition, 2019 We propose a theoretical framework that generalizes simple and fast algorithms for hierarchical agglomerative clustering to weighted graphs with both attractive and repulsive interactions between the nodes.
Alberto Bailoni +6 more
semanticscholar +1 more source
Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes From the European Parliament [PDF]
, 2015 In this paper, we want to study the informative value of negative links in signed complex networks. For this purpose, we extract and analyze a collection of signed networks representing voting sessions of the European Parliament (EP).
Figueiredo, Rosa +3 more
core +3 more sources
Enabling Social Applications via Decentralized Social Data Management [PDF]
, 2015 An unprecedented information wealth produced by online social networks, further augmented by location/collocation data, is currently fragmented across different proprietary services. Combined, it can accurately represent the social world and enable novel
Blackburn, Jeremy +3 more
core +1 more source