Geometric Characterizations of Graphs Using Heat Kernel Embeddings
From MaRDI portal
graph clusteringkernel methodsgraph embeddingdifferential geometrygeodesic distanceEuclidean distancegraph spectraheat kernel embeddingGaussian curvaturescomputing geometric characterisations of graphsdistribution of path lengthsLaplacian eigensystemnode affinitiessection curvaturesYoung Householder decomposition
Recommendations
- Heat kernel embeddings, differential geometry and graph structure
- Structural, Syntactic, and Statistical Pattern Recognition
- Graph-Based Representations in Pattern Recognition
- Mathematics of Surfaces XI
- Heat Kernels of Graphs
- Graph characteristics from the heat kernel trace
- scientific article; zbMATH DE number 7370580
- Heat kernels on unit spheres and applications to graph kernels
- scientific article; zbMATH DE number 219049
Cited in
(9)- A Riemannian approach to graph embedding
- Graph Regularisation Using Gaussian Curvature
- Graph characteristics from the heat kernel trace
- Structural, Syntactic, and Statistical Pattern Recognition
- Mathematics of Surfaces XI
- scientific article; zbMATH DE number 7370580 (Why is no real title available?)
- Graph-Based Representations in Pattern Recognition
- Coarse geometric kernels for networks embedding
- Heat kernel embeddings, differential geometry and graph structure
This page was built for publication: Geometric Characterizations of Graphs Using Heat Kernel Embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639014)