Evolving Spanning Trees Using the Heat Equation

This paper explores how to use the heat kernel to evolve the minimum spanning tree of a graph with time. We use the heat kernel to weight the edges of the graph, and these weights can be computed by exponentiating the Laplacian eigensystem of the graph with time. The resulting spanning trees exhibit an interesting behaviour as time increases. Initially, they are bushy and rooted near the centre of graph, but as time evolves they become string-like and hug the boundary of the graph. We characterise this behaviour using the distribution of terminal nodes with time, and use this distribution for the purposes of graph clustering and image segmentation.

[1]  Shing-Tung Yau,et al.  Discrete Green's Functions , 2000, J. Comb. Theory A.

[2]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[3]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[4]  Jianbo Shi,et al.  A Random Walks View of Spectral Segmentation , 2001, AISTATS.

[5]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.

[6]  Antonio Robles-Kelly,et al.  Graph edit distance from spectral seriation , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[9]  François Fouss,et al.  The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering , 2004, ECML.

[10]  S. Redner,et al.  First-passage properties of the Erdos Renyi random graph , 2004, cond-mat/0410309.

[11]  Dino Pedreschi,et al.  Machine Learning: ECML 2004 , 2004, Lecture Notes in Computer Science.

[12]  Marco Gori,et al.  Graph matching using random walks , 2004, ICPR 2004.

[13]  A. J. Collins,et al.  Introduction To Multivariate Analysis , 1981 .

[14]  Risi Kondor,et al.  Diffusion kernels on graphs and other discrete structures , 2002, ICML 2002.

[15]  John D. Lafferty,et al.  Diffusion Kernels on Graphs and Other Discrete Input Spaces , 2002, ICML.