Matched Filters for Noisy Induced Subgraph Detection

03/06/2018
by   Daniel L. Sussman, et al.
0

We consider the problem of finding the vertex correspondence between two graphs with different number of vertices where the smaller graph is still potentially large. We propose a solution to this problem via a graph matching matched filter: padding the smaller graph in different ways and then using graph matching methods to align it to the larger network. Under a statistical model for correlated pairs of graphs, which yields a noisy copy of the small graph within the larger graph, the resulting optimization problem can be guaranteed to recover the true vertex correspondence between the networks, though there are currently no efficient algorithms for solving this problem. We consider an approach that exploits a partially known correspondence and show via varied simulations and applications to the Drosophila connectome that in practice this approach can achieve good performance.

READ FULL TEXT

page 19

page 20

research
07/26/2018

Seeded Graph Matching via Large Neighborhood Statistics

We study a well known noisy model of the graph isomorphism problem. In t...
research
04/28/2010

Many-to-Many Graph Matching: a Continuous Relaxation Approach

Graphs provide an efficient tool for object representation in various co...
research
07/24/2018

Tractable Graph Matching via Soft Seeding

The graph matching problem aims to discover a latent correspondence betw...
research
08/25/2023

Gotta match 'em all: Solution diversification in graph matching matched filters

We present a novel approach for finding multiple noisily embedded templa...
research
04/06/2021

Sparse Partial Least Squares for Coarse Noisy Graph Alignment

Graph signal processing (GSP) provides a powerful framework for analyzin...
research
12/26/2018

Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks

Given a pair of graphs with the same number of vertices, the inexact gra...
research
05/01/2017

Vertex Nomination Via Local Neighborhood Matching

Consider two networks on overlapping, non-identical vertex sets. Given v...

Please sign up or login with your details

Forgot password? Click here to reset