Results 1 to 10 of about 7,274 (228)

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, MacGillivray G., Olesky D. D., van den Driessche P.   +3 more
doaj   +5 more sources

Method Maximizing the Spread of Influence in Directed Signed Weighted Graphs

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, Vladislav Sergeevich Vasilev, Larisa Anatolievna Tselykh, Simon Antonovich Barkovskii   +3 more
doaj   +4 more sources

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, Massimo Stella, Trevor James Swanson, Andreia Sofia Teixeira   +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

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$.
Jianbing Liu, Miaomiao Han, Hong-Jian Lai   +2 more
openaire   +1 more source

Learning Weight Signed Network Embedding with Graph Neural Networks

Data Science and Engineering, 2023
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, Qiancheng Yu, Xia Li, Xiaoning Li, Qinwen Yang   +4 more
openaire   +2 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, Zijian Chen, Qunsheng Guan, Chengyi Xia   +3 more
openaire   +2 more sources

WSGMB: weight signed graph neural network for microbial biomarker identification

Briefings in Bioinformatics, 2023
Abstract The stability of the gut microenvironment is inextricably linked to human health, with the onset of many diseases accompanied by dysbiosis of the gut microbiota. It has been reported that there are differences in the microbial community composition between patients and healthy individuals, and many microbes are considered ...
Shuheng Pan, Xinyi Jiang, Kai Zhang
openaire   +2 more sources

Efficient Minus and Signed Domination in Proper Interval Graphs with a Totally Unimodular Structure

Axioms
The efficient minus domination problem (EMDP) and the efficient signed domination problem (ESDP) are domination-type problems in graphs. These problems are known to be NP-complete on chordal graphs and polynomially solvable on chain interval graphs ...
Chuan-Min Lee
doaj   +1 more source

Task complexity shapes internal representations and robustness in neural networks

Machine Learning: Science and Technology
Neural networks excel across a wide range of tasks, yet remain ‘black boxes’. In particular, how their internal representations are shaped by the complexity of the input data and the problems they solve remains obscure. In this work, we introduce a suite
Robert Jankowski, Filippo Radicchi, M Ángeles Serrano, Marián Boguñá, Santo Fortunato   +4 more
doaj   +1 more source