Exact alignment recovery for correlated Erd\H{o}s-R\'enyi graphs
Information Theory
2018-05-15 v2 Machine Learning
math.IT
Abstract
We consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\H{o}s-R\'enyi (ER) graphs on the same vertex set. The correspondence between the vertices can be obscured by randomly permuting the vertex labels of one of the graphs. We determine the information-theoretic threshold for exact recovery, i.e. the conditions under which the entire vertex correspondence can be correctly recovered given unbounded computational resources.
Keywords
Cite
@article{arxiv.1711.06783,
title = {Exact alignment recovery for correlated Erd\H{o}s-R\'enyi graphs},
author = {Daniel Cullina and Negar Kiyavash},
journal= {arXiv preprint arXiv:1711.06783},
year = {2018}
}
Comments
12 pages. arXiv admin note: text overlap with arXiv:1602.01042