Results 21 to 30 of about 70,726 (237)
The Kuramoto Model on Oriented and Signed Graphs [PDF]
Many real-world systems of coupled agents exhibit directed interactions, meaning that the influence of an agent on another is not reciprocal. Furthermore, interactions usually do not have identical amplitude and/or sign.
R. Delabays +2 more
semanticscholar +1 more source
Simplicial and Cellular Trees [PDF]
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension.
Duval, Art M. +2 more
core +2 more sources
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [PDF]
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al.
Datta, Samir +2 more
core +7 more sources
TwitterMancer: predicting interactions on Twitter accurately [PDF]
This paper investigates the interplay between different types of user interactions on Twitter, with respect to predicting missing or unseen interactions.
Byers, John W. +3 more
core +1 more source
Entropy-based randomisation of rating networks [PDF]
In the last years, due to the great diffusion of e-commerce, online rating platforms quickly became a common tool for purchase recommendations. However, instruments for their analysis did not evolve at the same speed.
Becatti, Carolina +2 more
core +2 more sources
Laplacian matrices of weighted digraphs represented as quantum states
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
Partial containment control over signed graphs [PDF]
In this paper, we deal with the containment control problem in presence of antagonistic interactions. In particular, we focus on the cases in which it is not possible to contain the entire network due to a constrained number of control signals.
DeLellis, Pietro +3 more
core +2 more sources
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
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
In this exploratory study, we investigated the relationship between the gut microbiota and outcome in patients with metastatic hormone receptor‐positive breast cancer, treated in a randomized clinical trial with chemotherapy alone or chemotherapy in combination with immune checkpoint blockade.
Andreas Ullern +7 more
wiley +1 more source
A Spectral Framework for a Class of Undirected Hypergraphs [PDF]
We extend the graph spectral framework to a new class of undirected hypergraphs with bipartite hyperedges. A bipartite hyperedge is a pair of disjoint sets of nodes in which every node is associated with a weight. A bipartite hyperedge can be viewed as a
Garriga, Gemma, +3 more
core +2 more sources

