Results 1 to 10 of about 70,726 (237)
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 +7 more sources
Weighted Modulo Orientations of Graphs and Signed Graphs [PDF]
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
semanticscholar +3 more sources
Inertias of Laplacian matrices of weighted signed graphs [PDF]
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 +5 more sources
wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction [PDF]
International Workshop on Complex Networks & Their Applications, 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.
semanticscholar +6 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 +3 more sources
K-Partitioning of Signed or Weighted Bipartite Graphs [PDF]
IEEE International Conference on Social Computing, 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 ...
Nurettin B. Omeroglu +3 more
semanticscholar +5 more sources
Deterministic Asynchronous Threshold-Based Opinion Dynamics in Signed Weighted Graphs [PDF]
AppliedMathAmong the many (mostly randomized) models proposed in the last decades to study how opinions of a set of individuals interconnected by pairwise relations evolve, a novel deterministic model is introduced in this paper that is able to encompass individual
Miriam Di Ianni
openalex +2 more sources
BioengineeringThe early detection of Alzheimer’s disease (AD) is important for effective therapeutic interventions and optimized enrollment for clinical trials. Recent studies have shown high accuracy in identifying mild AD by applying visibility graph and machine learning methods to electroencephalographic (EEG) data.
Yongshuai Liu +8 more
openaire +4 more sources
Structural Balance of Complex Weighted Graphs and Multi-Partite Consensus [PDF]
IEEE Control Systems Letters, 2023 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 +1 more source
On Manipulating Weight Predictions in Signed Weighted Networks [PDF]
AAAI Conference on Artificial Intelligence, 2023 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 +1 more source