Heat Kernel Embeddings, Differential Geometry and Graph Structure
AbstractIn this paper, we investigate the heat kernel embedding as a route to graph representation. The heat kernel of the graph encapsulates information concerning the distribution of path lengths and, hence, node affinities on the graph; and is found by exponentiating the Laplacian eigen-system over time. A Young–Householder decomposition is performed on the heat kernel to obtain the matrix of the embedded coordinates for the nodes of the graph. With the embeddings at hand, we establish a graph characterization based on differential geometry by computing sets of curvatures associated with the graph edges and triangular faces. A sectional curvature computed from the difference between geodesic and Euclidean distances between nodes is associated with the edges of the graph. Furthermore, we use the Gauss–Bonnet theorem to compute the Gaussian curvatures associated with triangular faces of the graph. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
ElGhawalby, H.; Hancock, E.R. Heat Kernel Embeddings, Differential Geometry and Graph Structure. Axioms 2015, 4, 275-293.
ElGhawalby H, Hancock ER. Heat Kernel Embeddings, Differential Geometry and Graph Structure. Axioms. 2015; 4(3):275-293.Chicago/Turabian Style
ElGhawalby, Hewayda; Hancock, Edwin R. 2015. "Heat Kernel Embeddings, Differential Geometry and Graph Structure." Axioms 4, no. 3: 275-293.