An Incomparable Upper Bound For The Largest Laplacian Graph Eigenvalue.
Sezer SorgunPublished in: Ars Comb. (2017)
Keyphrases
- upper bound
- lower bound
- laplacian matrix
- vc dimension
- graph laplacian
- graph theory
- worst case
- spectral decomposition
- random walk
- constant factor
- graph structure
- branch and bound algorithm
- adjacency matrix
- structured data
- covariance matrix
- connected components
- graph representation
- lower and upper bounds
- directed graph
- graph based algorithm
- error probability
- graph model
- graph theoretic
- branch and bound
- graph kernels
- graph structures
- graph databases
- weighted graph
- sparse coding
- heat kernel
- low dimensional
- markov random field
- least squares
- eigenvalue problems