2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.LG2023★ 2 cited
Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions
Jingqiu Ding, Tommaso d'Orsi, Yiding Hua +1
We study robust community detection in the context of node-corrupted stochastic block model, where an adversary can arbitrarily modify all the edges incident to a fraction of the $…
cs.LG2023
SQ Lower Bounds for Random Sparse Planted Vector Problem
Jingqiu Ding, Yiding Hua
Consider the setting where a -sparse Rademacher vector is planted in a random -dimensional subspace of . A classical question is how to recover this planted vector given…
cs.DS2022
Maintaining Expander Decompositions via Sparse Cuts
Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg +1
In this article, we show that the algorithm of maintaining expander decompositions in graphs undergoing edge deletions directly by removing sparse cuts repeatedly can be made effic…