Results 1 to 10 of about 450,197 (278)

Graph Theory versus Minimum Rank for Index Coding [PDF]

open access: green2014 IEEE International Symposium on Information Theory, 2014
We obtain novel index coding schemes and show that they provably outperform all previously known graph theoretic bounds proposed so far 1. Further, we establish a rather strong negative result: all known graph theoretic bounds are within a logarithmic ...
Karthikeyan Shanmugam   +2 more
semanticscholar   +8 more sources

Real and complex K-theory for higher rank graph algebras arising from cube complexes [PDF]

open access: greenAnnals of K-theory
Using the Evans spectral sequence and its counter-part for real $K$-theory, we compute both the real and complex $K$-theory of several infinite families of $C^*$-algebras based on higher-rank graphs of rank $3$ and $4$. The higher-rank graphs we consider
Jeffrey L. Boersema, Alina Vdovina
semanticscholar   +3 more sources

Hyperspectral Anomaly Detection via Graph Dictionary-Based Low Rank Decomposition with Texture Feature Extraction

open access: yesRemote Sensing, 2020
The accuracy of anomaly detection in hyperspectral images (HSIs) faces great challenges due to the high dimensionality, redundancy of data, and correlation of spectral bands.
Shangzhen Song   +3 more
doaj   +2 more sources

Rank-two 5d SCFTs from M-theory at isolated toric singularities: a systematic study [PDF]

open access: yesJournal of High Energy Physics, 2020
We carry out a detailed exploration of the deformations of rank-two five-dimensional superconformal field theories (SCFTs) T X $$ {\mathcal{T}}_{\mathbf{X}} $$ , which are geometrically engineered by M-theory on the space transverse to isolated toric ...
Vivek Saxena
doaj   +2 more sources

Identifying Influential Nodes Based on Evidence Theory in Complex Network [PDF]

open access: yesEntropy
Influential node identification is an important and hot topic in the field of complex network science. Classical algorithms for identifying influential nodes are typically based on a single attribute of nodes or the simple fusion of a few attributes ...
Fu Tan   +5 more
doaj   +2 more sources

An intuitionistic fuzzy graph’s variation coefficient measure with application to selecting a reliable alliance partner [PDF]

open access: yesScientific Reports
Group decision-making (GDM) is crucial in various components of graph theory, management science, and operations research. In particular, in an intuitionistic fuzzy group decision-making problem, the experts communicate their preferences using ...
Naveen Kumar Akula   +7 more
doaj   +2 more sources

The treewidth of 2-section of hypergraphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2021
Let $H=(V,F)$ be a simple hypergraph without loops. $H$ is called linear if $|f\cap g|\le 1$ for any $f,g\in F$ with $f\not=g$. The $2$-section of $H$, denoted by $[H]_2$, is a graph with $V([H]_2)=V$ and for any $ u,v\in V([H]_2)$, $uv\in E([H]_2)$ if ...
Ke Liu, Mei Lu
doaj   +1 more source

Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks [PDF]

open access: yesLOG IN, 2023
Our study reveals new theoretical insights into over-smoothing and feature over-correlation in graph neural networks. Specifically, we demonstrate that with increased depth, node representations become dominated by a low-dimensional subspace that depends
Andreas Roth, T. Liebig
semanticscholar   +1 more source

Tensor rank and other multipartite entanglement measures of graph states [PDF]

open access: yesPhysical Review A, 2022
Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant connections between the graph structure of these states and their multipartite
Louis Schatzki   +3 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy