Spectral bounds of the regularized normalized Laplacian for random geometric graphs.
Mounia HamidoucheLaura CottatellucciKonstantin AvrachenkovPublished in: CoRR (2019)
Keyphrases
- spectral decomposition
- laplacian matrix
- heat kernel
- pseudo inverse
- spectral clustering
- graph laplacian
- spectral methods
- graph structures
- graph theoretical
- upper bound
- laplace beltrami
- high order
- low dimensional
- graph matching
- adjacency matrix
- subgraph isomorphism
- minimum spanning tree
- geometric information
- graph theoretic
- vc dimension
- worst case
- error bounds
- geometric structure
- graph theory
- reeb graph
- least squares
- tikhonov regularization
- rotationally invariant
- topological information
- weighted graph
- risk minimization
- graph model
- graph databases
- lower and upper bounds
- graph kernels
- lower bound