Commute Times, Discrete Green’s Functions and Graph Matching

  • Huaijun Qiu
  • Edwin R. Hancock
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3617)


This paper describes a graph-spectral method for simplifying the structure of a graph. Our starting point is the lazy random walk on the graph, which is determined by the heat-kernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using the commute time between nodes, and show how this quantity may be computed from the Laplacian spectrum using the discrete Green’s function. Our idea is to augment the graph with an auxiliary node which acts as a heat source. We use the pattern of commute times from this node to decompose the graph into a sequence of layers. These layers can be located using the Green’s function. We exploit this decomposition to develop a layer-by-layer graph-matching strategy. The matching method uses the commute time from the auxiliary node as a node-attribute.


  1. 1.
    Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1–7), 107–117 (1998)CrossRefGoogle Scholar
  2. 2.
    Chung, F.R.K.: Spectral Graph Theory. CBMS series, vol. 92. American Mathmatical Society Ed. (1997)Google Scholar
  3. 3.
    Chung, F.R.K., Yau, S.-T.: Discrete green’s functions. J. Combin. Theory Ser., 191–214 (2000)Google Scholar
  4. 4.
    Gori, M., Maggini, M., Sarti, L.: Graph matching using random walks. In: ICPR 2004, vol. III, pp. 394–397 (2004)Google Scholar
  5. 5.
    Kondor, R., Lafferty, J.: Diffusion kernels on graphs and other discrete structures. In: 19th Intl. Conf. on Machine Learning (ICML) [ICM 2002] (2002)Google Scholar
  6. 6.
    Lovász, L.: Random walks on graphs: A surveyGoogle Scholar
  7. 7.
    Luo, B., Hancock, E.R.: Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI 23(10), 1120–1136 (2001)Google Scholar
  8. 8.
    Meila, M., Shi, J.: A random walks view of spectral segmentation (2001)Google Scholar
  9. 9.
    Qiu, H., Hancock, E.R.: Spectral simplification of graphs. In: ECCV (2004)Google Scholar
  10. 10.
    Robles-Kelly, A., Hancock, E.R.: String edit distance, random walks and graph matching. Int. Journal of PRAI 18(3), 315–327 (2004)Google Scholar
  11. 11.
    Saerens, M., Fouss, F., Yen, L., Dupont, P.: The principal components analysis of a graph, and its relationships to spectral clustering. LNAI (2004)Google Scholar
  12. 12.
    Sood, V., Redner, S., ben Avraham, D.: First-passage properties of the erdoscrenyi random graph. J. Phys. A: Math. Gen. (38), 109–123 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Huaijun Qiu
    • 1
  • Edwin R. Hancock
    • 1
  1. 1.Department of Computer ScienceUniversity of YorkYorkUK

Personalised recommendations