arXiv stat.ML
· Papers
Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests
arXiv:2607.09087v1 Announce Type: cross Abstract: This paper studies graph matching under the correlated $text{ErdH{o}s-R'{e}nyi}$ (ER) graph pair model. This model first samples an $mathrm{ER}(n,frac{lambda}{ns})$ base graph, whose edges are then independently subsampled twice with probability $s$ to produce two