ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2305.10227
  4. Cited By
Reaching Kesten-Stigum Threshold in the Stochastic Block Model under
  Node Corruptions

Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions

17 May 2023
Jingqiu Ding
Tommaso dÓrsi
Yiding Hua
David Steurer
ArXivPDFHTML

Papers citing "Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions"

6 / 6 papers shown
Title
Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
Hongjie Chen
Jingqiu Ding
Yiding Hua
Stefan Tiegel
61
0
0
05 Mar 2025
Fast, robust approximate message passing
Fast, robust approximate message passing
Misha Ivkov
T. Schramm
25
1
0
05 Nov 2024
Multi-View Stochastic Block Models
Multi-View Stochastic Block Models
Vincent Cohen-Addad
Tommaso dÓrsi
Silvio Lattanzi
Rajai Nasser
33
0
0
07 Jun 2024
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph
  Clustering
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering
Vincent Cohen-Addad
Tommaso dÓrsi
Aida Mousavifar
30
1
0
07 Jun 2024
Robust Graph Matching when Nodes are Corrupt
Robust Graph Matching when Nodes are Corrupt
Taha Ameen
Bruce Hajek
18
4
0
28 Oct 2023
Robust Estimation for Random Graphs
Robust Estimation for Random Graphs
Jayadev Acharya
Ayush Jain
Gautam Kamath
A. Suresh
Huanyu Zhang
24
8
0
09 Nov 2021
1