Name
Abstract | ||
|---|---|---|
What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinformatics. Existing solutions either require auxiliary information such as node attributes, or provide a single-scale view of the graph by translating the problem into aligning node embeddings. In this paper, we transfer the shape-analysis concept of functional maps from the continuous to the discrete case, and treat the graph alignment problem as a special case of the problem of finding a mapping between functions on graphs. We present GRASP, a method that captures multiscale structural characteristics from the eigenvectors of the graph's Laplacian and uses this information to align two graphs.Our experimental study, featuring noise levels higher than anything used in previous studies, shows that GRASP outperforms state-of-the-art methods for graph alignment across noise levels and graph types. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-85896-4_4 | WEB AND BIG DATA, APWEB-WAIM 2021, PT I |
DocType | Volume | ISSN |
Conference | 12858 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Judith Hermanns | 1 | 0 | 0.34 |
| Tsitsulin Anton | 2 | 1 | 1.03 |
| Munkhoeva, Marina | 3 | 4 | 2.43 |
| Alex Bronstein | 4 | 0 | 0.34 |
| Davide Mottin | 5 | 181 | 18.07 |
| Panagiotis Karras | 6 | 824 | 51.33 |