String Edit Distance, Random Walks And Graph Matching

Antonio Robles-Kelly, Edwin R. Hancock

Abstract: This paper shows how the eigenstructure of the adjacency matrix can be used for the purposes of robust graph matching. We commence from the observation that the leading eigenvector of a transition ...