TY - JOUR

T1 - Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated ErdÅ's-Rényi Graphs

AU - Dai, Osman Emre

AU - Cullina, Daniel

AU - Kiyavash, Negar

AU - Grossglauser, Matthias

N1 - Publisher Copyright:
© 2019 Copyright is held by the owner/author(s).

PY - 2019/12/17

Y1 - 2019/12/17

N2 - Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact informationtheoretic threshold for graph alignment in correlated ErdÅ's-Rényi graphs. However, very little is known about the existence of efficient algorithms to achieve graph alignment without seeds. In this work we identify a region in which a straightforward O(n11/5 logn)-Time canonical labeling algorithm, initially introduced in the context of graph isomorphism, succeeds in aligning correlated ErdÅ's-Rényi graphs. The algorithm has two steps. In the first step, all vertices are labeled by their degrees and a trivial minimum distance alignment (i.e., sorting vertices according to their degrees) matches a fixed number of highest degree vertices in the two graphs. Having identified this subset of vertices, the remaining vertices are matched using a alignment algorithm for bipartite graphs.

AB - Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact informationtheoretic threshold for graph alignment in correlated ErdÅ's-Rényi graphs. However, very little is known about the existence of efficient algorithms to achieve graph alignment without seeds. In this work we identify a region in which a straightforward O(n11/5 logn)-Time canonical labeling algorithm, initially introduced in the context of graph isomorphism, succeeds in aligning correlated ErdÅ's-Rényi graphs. The algorithm has two steps. In the first step, all vertices are labeled by their degrees and a trivial minimum distance alignment (i.e., sorting vertices according to their degrees) matches a fixed number of highest degree vertices in the two graphs. Having identified this subset of vertices, the remaining vertices are matched using a alignment algorithm for bipartite graphs.

UR - http://www.scopus.com/inward/record.url?scp=85086502126&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85086502126&partnerID=8YFLogxK

U2 - 10.1145/3309697.3331505

DO - 10.1145/3309697.3331505

M3 - Article

AN - SCOPUS:85086502126

VL - 47

SP - 96

EP - 97

JO - Performance Evaluation Review

JF - Performance Evaluation Review

SN - 0163-5999

IS - 1

ER -