Method Maximizing the Spread of Influence in Directed Signed Weighted Graphs [PDF]
Advances in Electrical and Electronic Engineering, 2017 We propose a new method for maximizing the spread of influence, based on the identification of significant factors of the total energy of a control system.
Alexander Nikolaevich Tselykh +3 more
doaj +4 more sources
Inertias of Laplacian matrices of weighted signed graphs
Special Matrices, 2019 We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia.
Monfared K. Hassani +3 more
doaj +2 more sources
wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction [PDF]
, 2022 Graph Neural Networks (GNNs) have been widely used to learn representations on graphs and tackle many real-world problems from a wide range of domains. In this paper we propose wsGAT, an extension of the Graph Attention Network (GAT) layers, meant to address the lack of GNNs that can handle graphs with signed and weighted links, which are ubiquitous ...
Grassia M., Mangioni G.
openaire +3 more sources
Nonlinear Merging Consensus for Multi-Agent Systems on Directed and Weighted Signed Graph [PDF]
IEEE Access, 2020 This paper settles the nonlinear merging consensus for multi-agent systems on a directed and weighted signed network. A novel nonlinear merging control protocol is proposed to drive the states of all agents to arrive at the same state. To be consistent with the reality, the interactions among agents can be either cooperative or competitive and the ...
Shasha Feng +3 more
openaire +2 more sources
Weighted Modulo Orientations of Graphs and Signed Graphs
The Electronic Journal of Combinatorics, 2022 Given a graph $G$ and an odd prime $p$, for a mapping $f: E(G) \to {\mathbb Z}_p\setminus\{0\}$ and a ${\mathbb Z}_p$-boundary $b$ of $G$, an orientation $\tau$ is called an $(f,b;p)$-orientation if the net out $f$-flow is the same as $b(v)$ in ${\mathbb Z}_p$ at each vertex $v\in V(G)$ under orientation $D$.
Liu, Jianbing +2 more
openaire +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
K–partitioning of Signed or Weighted Bipartite Graphs [PDF]
, 2013 — In this work, K-partitioning of signed or weighted bipartite graph problem has been introduced, which appears as a real life problem where the partitions of bipartite graph represent two different entities and the edges between the nodes of the ...
Hasan Davulcu +3 more
core +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
Laplacian matrices of weighted digraphs represented as quantum states
, 2017 Representing graphs as quantum states is becoming an increasingly important approach to study entanglement of mixed states, alternate to the standard linear algebraic density matrix-based approach of study.
Adhikari, Bibhas +3 more
core +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 +5 more sources