REVIEW 1 cited by
Matching recovery threshold for correlated random graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Matching recovery threshold for correlated random graphs
read the original abstract
For two correlated graphs which are independently sub-sampled from a common Erd\H{o}s-R\'enyi 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^{-\alpha+o(1)}$ for $\alpha\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.
Forward citations
Cited by 1 Pith paper
-
Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d>n$ Regime
Proves detection of RGG vs. ER is impossible for d ≫ (n h(p))^3 and d ≥ (1+ε)n, resolving the detection threshold conjecture in the regime p ≳ n^{-2/3}/log n.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.