arXiv · 2205.14650
Matching recovery threshold for correlated random graphs
Abstract
For two correlated graphs which are independently sub-sampled from a common Erdős-Rényi graph $\mathbf{G}(n, p)$, we wish to recover their \emph{latent} vertex matching from the observation of these two graphs \emph{without labels}. When $p = n^{-α+o(1)}$ for $α\in (0, 1]$, we establish a sharp information-theoretic threshold for whether it is possible to correctly match a positive fraction of vertices. Our result sharpens a constant factor in a recent work by Wu, Xu and Yu.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jian Ding, Hang Du. 2022-05-29. Matching recovery threshold for correlated random graphs. https://arxiv.org/abs/2205.14650
Cite the original work for its findings. Save a collection to share your selection of sources.