Harnessing spectral representations for subgraph alignment

05/30/2022
by   Marco Pegoraro, et al.
0

With the rise and advent of graph learning techniques, graph data has become ubiquitous. However, while several efforts are being devoted to the design of new convolutional architectures, pooling or positional encoding schemes, less effort is being spent on problems involving maps between (possibly very large) graphs, such as signal transfer, graph isomorphism and subgraph correspondence. With this paper, we anticipate the need for a convenient framework to deal with such problems, and focus in particular on the challenging subgraph alignment scenario. We claim that, first and foremost, the representation of a map plays a central role on how these problems should be modeled. Taking the hint from recent work in geometry processing, we propose the adoption of a spectral representation for maps that is compact, easy to compute, robust to topological changes, easy to plug into existing pipelines, and is especially effective for subgraph alignment problems. We report for the first time a surprising phenomenon where the partiality arising in the subgraph alignment task is manifested as a special structure of the map coefficients, even in the absence of exact subgraph isomorphism, and which is consistently observed over different families of graphs up to several thousand nodes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

The Densest k Subgraph Problem in b-Outerplanar Graphs

We give an exact O(nk^2) algorithm for finding the densest k subgraph in...
research
10/30/2016

Strong Neutrosophic Graphs and Subgraph Topological Subspaces

In this book authors for the first time introduce the notion of strong n...
research
12/25/2019

Neural Subgraph Isomorphism Counting

In this paper, we study a new graph learning problem: learning to count ...
research
05/01/2023

Embeddability of graphs and Weihrauch degrees

We study the complexity of the following related computational tasks con...
research
12/01/2018

Number of Connected Components in a Graph: Estimation via Counting Patterns

Due to the limited resources and the scale of the graphs in modern datas...
research
10/20/2022

Maximum Common Subgraph Guided Graph Retrieval: Late and Early Interaction Networks

The graph retrieval problem is to search in a large corpus of graphs for...
research
07/16/2017

Projected Power Iteration for Network Alignment

The network alignment problem asks for the best correspondence between t...

Please sign up or login with your details

Forgot password? Click here to reset