Bounding the sum of powers of normalized Laplacian eigenvalues of a graph.
Jianxi LiJi-Ming GuoWai Chee ShiuS. Burcu BozkurtDurmus BozkurtPublished in: Appl. Math. Comput. (2018)
Keyphrases
- laplacian matrix
- graph laplacian
- spectral methods
- random walk
- spectral clustering
- spectral decomposition
- directed graph
- upper bound
- graph structure
- adjacency matrix
- covariance matrix
- heat kernel
- graph theory
- eigenvalues and eigenvectors
- weighted graph
- connected components
- bipartite graph
- similarity measure
- correlation matrix
- pseudo inverse
- min sum
- directed acyclic graph
- graph structures
- graph clustering
- spectral analysis
- minimum spanning tree
- graph theoretic
- weighted sum
- principal components
- structured data
- edge detection
- principal component analysis
- objective function