Showing math.STShow all
3 papers · 1 filter
math.ST2026
Fundamental Limits of Query-Based Subgraph Detection
Wasim Huleihel
The planted subgraph detection problem asks whether a random graph contains a hidden structured subgraph. In the classical formulation, the entire adjacency matrix is observed and…
math.ST2026
Inhomogeneous Submatrix Detection
Mor Oren-Loberman, Dvir Jerbi, Tamir Bendory +1
In this paper, we study the problem of detecting multiple hidden submatrices in a large Gaussian random matrix when the planted signal is inhomogeneous across entries. Under the nu…
math.ST2025
Detecting Arbitrary Planted Subgraphs in Random Graphs
Dor Elimelech, Wasim Huleihel
The problems of detecting and recovering planted structures/subgraphs in ErdÅs-Rényi random graphs, have received significant attention over the past three decades, leading to ma…