Results 1 to 10 of about 468,741 (299)

Graph theory versus minimum rank for index coding [PDF]

2014 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, Alexandros G. Dimakis, Michael Langberg   +2 more
semanticscholar   +5 more sources

Exponential Graph Regularized Non-Negative Low-Rank Factorization for Robust Latent Representation

Mathematics, 2022
Non-negative matrix factorization (NMF) is a fundamental theory that has received much attention and is widely used in image engineering, pattern recognition and other fields.
Guowei Yang, Lin Zhang, Minghua Wan
doaj   +2 more sources

Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning [PDF]

IEEE Open Journal of Control Systems
In this article, we utilize the concept of average controllability in graphs, along with a novel rank encoding method, to enhance the performance of Graph Neural Networks (GNNs) in social network classification tasks. GNNs have proven highly effective in
Anwar Said, Yifan Wei, Obaid Ullah Ahmad, Mudassir Shabbir, Waseem Abbas, Xenofon Koutsoukos   +5 more
doaj   +2 more sources

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

Remote 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, Yixin Yang, Huixin Zhou, Jonathan Cheung-Wai Chan   +3 more
doaj   +2 more sources

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

Journal 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

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

Annals 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
openalex   +2 more sources

A dual graph construction for higher-rank graphs, and 𝐾-theory for finite 2-graphs [PDF]

, 2005
Given a $k$-graph $\Lambda$ and an element $p$ of $\NN^k$, we define the dual $k$-graph, $p\Lambda$. We show that when $\Lambda$ is row-finite and has no sources, the $C^*$-algebras $C^*(\Lambda)$ and $C^*(p\Lambda)$ coincide.
Stephen Allen, David Pask, Aidan Sims
openalex   +6 more sources

On theK-theory of twisted higher-rank-graphC∗-algebras [PDF]

, 2012
We investigate the K-theory of twisted higher-rank-graph algebras by adapting parts of Elliott's computation of the K-theory of the rotation algebras.
Alex Kumjian, David Pask, Aidan Sims
openalex   +4 more sources

On the K-theory of twisted higher-rank-graph C*-algebras [PDF]

, 2012
Alex Kumjian, David Pask, Aidan Sims
openalex   +3 more sources

The treewidth of 2-section of hypergraphs [PDF]

Discrete 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