31 citations · 59 across the 37 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023
Planted Bipartite Graph Detection
Asaf Rotenberg, Wasim Huleihel, Ofer Shayevitz
We consider the task of detecting a hidden bipartite subgraph in a given random graph. This is formulated as a hypothesis testing problem, under the null hypothesis, the graph is a…
cs.DS2021
Inferring Hidden Structures in Random Graphs
Wasim Huleihel
We study the two inference problems of detecting and recovering an isolated community of \emph{general} structure planted in a random graph. The detection problem is formalized as…
cs.DS2021
Random Subgraph Detection Using Queries
Wasim Huleihel, Arya Mazumdar, Soumyabrata Pal
The planted densest subgraph detection problem refers to the task of testing whether in a given (random) graph there is a subgraph that is unusually dense. Specifically, we observe…