GRASP: Scalable Graph Alignment by Spectral Corresponding Functions
Authors:
- Judith HermannsJHJudith Hermanns
- Konstantinos SkitsasKSKonstantinos Skitsas
- Anton TsitsulinATAnton Tsitsulin
- Marina MunkhoevaMMMarina Munkhoeva
- Alexander Frederiksen KysterAKAlexander Frederiksen Kyster
- Simon Daugaard NielsenSNSimon Daugaard Nielsen
- Alexander M. BronsteinABAlexander M. Bronstein
- Davide MottinDMDavide Mottin
- Panagiotis KarrasPanagiotis Karras
Open Access
- 24 February 2023
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 17 (4) , 1-26
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. Some solutions assume that auxiliary information on known matches or node or edge attributes is available, or utilize arbitrary graph features. Such methods fare poorly in the pure form of the problem, in which only graph structures are given. Other proposals translate the problem to one of aligning node embeddings, yet, by doing so, provide only a single-scale view of the graph. In this article, 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 first establishes a correspondence between functions derived from Laplacian matrix eigenvectors, which capture multiscale structural characteristics, and then exploits this correspondence to align nodes. We enhance the basic form of GRASP by altering two of its components, namely the embedding method and the assignment procedure it employs, leveraging its modular, hence adaptable design. Our experimental study, featuring noise levels higher than anything used in previous studies, shows that the enhanced form of GRASP outperforms scalable state-of-the-art methods for graph alignment across noise levels and graph types, and performs competitively with respect to the best non-scalable ones. We include in our study another modular graph alignment algorithm, CONE, which is also adaptable thanks to its modular nature, and show it can manage graphs with skewed power-law degree distributions.Keywords
This publication has 56 references indexed in Scilit:
- A fast approach to global alignment of protein-protein interaction networksBMC Research Notes, 2013
- IsoRankN: spectral methods for global alignment of multiple protein networksBioinformatics, 2009
- A new graph-based method for pairwise global network alignmentBMC Bioinformatics, 2009
- Global alignment of multiple protein interaction networks with application to functional orthology detectionProceedings of the National Academy of Sciences, 2008
- Hierarchical synopses with optimal error guaranteesACM Transactions on Database Systems, 2008
- Power laws, Pareto distributions and Zipf's lawContemporary Physics, 2005
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- A method for registration of 3-D shapesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1992
- An eigendecomposition approach to weighted graph matching problemsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1988