Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime

Documenti analoghi

• A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
  di: Ding, Jian, et al.
  Pubblicazione: (2022)
• A computational transition for detecting correlated stochastic block models by low-degree polynomials
  di: Chen, Guanyi, et al.
  Pubblicazione: (2024)
• Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs
  di: Ding, Jian, et al.
  Pubblicazione: (2023)
• The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
  di: Gong, Shuyang, et al.
  Pubblicazione: (2024)
• Efficient Graph Matching for Correlated Stochastic Block Models
  di: Chai, Shuwen, et al.
  Pubblicazione: (2024)