We study the graph alignment problem over two independent Erd\H{o}s-R\'enyi graphs on $n$ vertices, with edge density $p$ falling into two regimes separated by the critical window around $p_c=\sqrt{\log n/n}$. Our result reveals an algorithmic phase transition for this random optimization problem: polynomial-time approximation schemes exist in the sparse regime, while statistical-computational gap emerges in the dense regime. Additionally, we establish a sharp transition on the performance of online algorithms for this problem when $p$ lies in the dense regime, resulting in a $\sqrt{8/9}$ multiplicative constant factor gap between achievable and optimal solutions.

翻译：我们研究在两个独立的Erdős-Rényi图上的图对齐问题，顶点数为$n$，边密度$p$分布在以$p_c=\sqrt{\log n/n}$为界的临界窗口两侧的两个区域。我们的结果揭示了这一随机优化问题的算法相变：在稀疏区域存在多项式时间近似方案，而在稠密区域则出现统计-计算鸿沟。此外，当$p$位于稠密区域时，我们建立了该问题在线算法性能的急剧转变，导致可达到解与最优解之间存在$\sqrt{8/9}$的乘法常数因子差距。