Geometric Characterizations of Graphs Using Heat Kernel Embeddings

Authors:
H. El-Ghawalby;E. R. Hancock
Affiliations:
Department of Computer Science, University of York, UK and Faculty of Engineering, Suez Canal University, Egypt;Department of Computer Science, University of York, UK
Venue:
Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII
Year:
2009

Citing 7
Cited 1

An Eigendecomposition Approach to Weighted Graph Matching Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Spectral Algorithm for Seriation and the Consecutive Ones Problem

SIAM Journal on Computing
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Comparing Images Using the Hausdorff Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Hyperplane margin classifiers on the multinomial manifold

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Trace formula analysis of graphs

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition

Two new graphs kernels in chemoinformatics

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate the heat kernel embedding as a route to computing geometric characterisations of graphs. The reason for turning to the heat kernel is that it encapsulates information concerning the distribution of path lengths and hence node affinities on the graph. The heat kernel of the graph is found by exponentiating the Laplacian eigensystem over time. The matrix of embedding co-ordinates for the nodes of the graph is obtained by performing a Young-Householder decomposition on the heat kernel. Once the embedding of its nodes is to hand we proceed to characterise a graph in a geometric manner. To obtain this characterisation, we focus on the edges of the graph under the embedding. Here we use the difference between geodesic and Euclidean distances between nodes to associate a sectional curvature with edges. Once the section curvatures are to hand then the Gauss-Bonnet theorem allows us to compute Gaussian curvatures at nodes on the graph. We explore how the attributes furnished by this analysis can be used to match and cluster graphs.