Uncertainty Principles and Sparse Eigenvectors of Graphs

DOI10.1109/TSP.2017.2731299MaRDI QIDQ4628097zbMATH OpenFDO

Authors Oguzhan Teke, P. P. Vaidyanathan

Publication date 6 March 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2017.2731299

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(5)

• Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
• Frequency domain uncertainty and the graph topology
• A unified framework for structured graph learning via spectral constraints
• Study of graph isomorphism using Jordan forms of adjacency matrices
• Approximation theorems on graphs

This page was built for publication: Uncertainty Principles and Sparse Eigenvectors of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628097)