Results 1 to 10 of about 70,457 (210)
Method Maximizing the Spread of Influence in Directed Signed Weighted Graphs [PDF]
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 +6 more sources
Weighted Modulo Orientations of Graphs and Signed Graphs [PDF]
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 +2 more sources
Inertias of Laplacian matrices of weighted signed graphs [PDF]
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 +3 more sources
wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction [PDF]
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 +5 more sources
Nonlinear Merging Consensus for Multi-Agent Systems on Directed and Weighted Signed Graph [PDF]
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
The 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
K-Partitioning of Signed or Weighted Bipartite Graphs [PDF]
— 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
openalex +4 more sources
Polarization and multiscale structural balance in signed networks
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
Deterministic Asynchronous Threshold-Based Opinion Dynamics in Signed Weighted Graphs [PDF]
Miriam Di Ianni
openalex +1 more source
Graph neural network-based mutation-aware regression test ordering using code dependency graphs and execution traces. [PDF]
Sowmyadevi S, Alphy A.
europepmc +1 more source

