Wednesday, November 20th, 2019
03:00pm - 04:00pm, in Science 2-064

Dan Sussman

Boston University

Finding the Way with Graph Matching

Abstract: The graph matching problem involves estimating a latent correspondence between the vertex sets of two graphs. As traditionally formulated, this involved trying to minimize the number of edge discrepancies between the aligned networks. In this talk we explore methods for solving the graph matching problem and demonstrate how adjusting the objective function can aid algorithmically to improve search performance. We also argue that in many instances the standard objective function will lead to incorrect solutions but appropriate modifications, often based on spectral graph properties, the correct alignment can be recovered even when the graphs have very different global structure.