A Universal upper bound on Graph Diameter based on Laplacian Eigenvalues
Shayan Oveis GharanLuca TrevisanPublished in: CoRR (2012)
Keyphrases
- upper bound
- laplacian matrix
- lower bound
- graph laplacian
- adjacency matrix
- random walk
- worst case
- constant factor
- directed graph
- spectral decomposition
- structured data
- weighted graph
- graph representation
- directed acyclic graph
- graph structure
- graph theory
- spectral clustering
- edge detection
- sample size
- graph partitioning
- branch and bound
- covariance matrix
- graph based algorithm
- heat kernel
- symmetric matrices
- eigenvalues and eigenvectors
- average degree
- low dimensional
- minimum spanning tree
- graph model
- social networks