Majorisations for the eigenvectors of graph-adjacency matrices.
Rahul DhalSandip RoyYan WanAli SaberiPublished in: Int. J. Control (2014)
Keyphrases
- eigenvalues and eigenvectors
- singular value decomposition
- adjacency matrix
- covariance matrix
- graph representation
- affinity matrix
- graph laplacian
- eigendecomposition
- laplacian matrix
- correlation matrix
- random walk
- graph theory
- strongly connected
- graph databases
- graph model
- weighted graph
- graph matching
- directed graph
- eigenvalue problems
- principal component analysis
- graph mining
- bipartite graph
- minimum spanning tree
- graph construction
- kronecker product
- face recognition
- low rank and sparse
- directed acyclic graph
- low rank
- spectral clustering
- connected components
- low dimensional
- k means