Wasim Huleihel

Fundamental Limits of Query-Based Subgraph Detection

This paper investigates an information-limited version of the planted subgraph detection problem, in which the planted structure is an arbitrary sequence of graphs, where $\Gamma_n$ is embedded in an ambient graph on $n$ vertices, but the observer does not have access to the full adjacency matrix.