Results 21 to 30 of about 8,568 (240)
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
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
Weighted Model Counting with Twin-Width [PDF]
, 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
Ganian, Robert +4 more
core +4 more sources
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
Weighted Modulo Orientations of Graphs [PDF]
, 2020 This dissertation focuses on the subject of nowhere-zero flow problems on graphs. Tutte\u27s 5-Flow Conjecture (1954) states that every bridgeless graph admits a nowhere-zero 5-flow, and Tutte\u27s 3-Flow Conjecture (1972) states that every 4-edge ...
Liu, Jianbing
core +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
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
Traditional Graphs, such as weighted graphs, or fuzzy graphs have static edge weights or membership values.These graphs have been widely used to model various complex systems, but they typically do not incorporate dynamicinteractions found in evolving ...
Behzadi, Mohammad Hassan +4 more
core +1 more source
Quantum Grid States and Hybrid Graphs [PDF]
, 2022 Using the signed laplacian matrix, and weighted and hybrid graphs, we present additional ways to interpret graphs as grid states. Hybrid graphs offer the most general interpretation. Existing graphical methods that characterize entanglement properties of
Wagner, Thomas +3 more
core +1 more source
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
Electronic Journal of Combinatorics, 2018 A signed graph is a graph whose edges are labeled by signs. This is a bibliography of signed graphs and related mathematics.Several kinds of labelled graph have been called "signed" yet are mathematically very different.
T. Zaslavsky
semanticscholar +1 more source