Sharp upper bounds for the largest Laplacian eigenvalue of mixed graphs.
Gui-Xian TianTing-Zhu HuangShu-Yu CuiPublished in: Ars Comb. (2013)
Keyphrases
- upper bound
- laplacian matrix
- lower bound
- spectral decomposition
- upper and lower bounds
- worst case
- tight bounds
- heat kernel
- branch and bound
- graph matching
- graph mining
- edge detection
- graph theoretic
- high quality
- graph structure
- bipartite graph
- spectral clustering
- tight upper and lower bounds
- spectral methods
- sparse coding
- sample size
- upper bounding
- error probability
- efficiently computable
- weighted graph
- graph kernels
- graph clustering
- sample complexity
- graph model
- shape analysis
- covariance matrix
- least squares
- special case
- multiscale