This paper describes how heat-kernel asymptotics can be used to compute approximate Euclidean distances between nodes in a graph. The distances are used to embed the graph-nodes in a low-dimensional space by performing Multidimensional Scaling(MDS). We perform an analysis of the distances, and demonstrate that they are related to the sectional curvature of the connecting geodesic on the manifold. Experiments with moment invariants computed from the embedded points show that they can be used for graph clustering. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Bai, X., & Hancock, E. R. (2005). Recent results on heat kernel embedding of graphs. In Lecture Notes in Computer Science (Vol. 3434, pp. 373–382). Springer Verlag. https://doi.org/10.1007/978-3-540-31988-7_36
Mendeley helps you to discover research relevant for your work.