Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs

Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs

27 November 2023

Jian Ding

Zhangsong Li

Papers citing "Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs"

12 / 12 papers shown

Title
Scaling Open-Vocabulary Action Detection Zhen Hao Sia Yogesh Singh Rawat ObjD VLM 63 0 0 04 Apr 2025
The feasibility of multi-graph alignment: a Bayesian approach Louis Vassaux Laurent Massoulié 42 1 0 24 Feb 2025
Robust random graph matching in dense graphs via vector approximate message passing Zhangsong Li 69 1 0 21 Dec 2024
Testing Dependency of Weighted Random Graphs Mor Oren Vered Paslev Wasim Huleihel 28 1 0 23 Sep 2024
Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs Dong Huang Xianwen Song Pengkun Yang 21 1 0 08 Jun 2024
Faster algorithms for the alignment of sparse correlated Erdös-Rényi random graphs Andrea Muratori G. Semerjian 19 1 0 14 May 2024
The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime Shuyang Gong Zhangsong Li 19 4 0 23 Feb 2024
Low-degree phase transitions for detecting a planted clique in sublinear time Jay Mardia K. A. Verchand Alexander S. Wein 12 1 0 08 Feb 2024
Statistical limits of correlation detection in trees Luca Ganassali Laurent Massoulié G. Semerjian 30 16 0 27 Sep 2022
Random graph matching at Otter's threshold via counting chandeliers Cheng Mao Yihong Wu Jiaming Xu Sophie H. Yu 25 37 0 25 Sep 2022
Random Graph Matching with Improved Noise Robustness Cheng Mao M. Rudelson K. Tikhomirov 32 21 0 28 Jan 2021
Optimal Low-Degree Hardness of Maximum Independent Set Alexander S. Wein 21 45 0 13 Oct 2020