Detecting a Planted Bipartite Graph

Asaf Rotenberg*, Wasim Huleihel, Ofer Shayevitz

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We consider the task of detecting a hidden bipartite subgraph in a given random graph. Specifically, under the null hypothesis, the graph is a realization of an Erdos-Rényi random graph over n vertices with edge density q. Under the alternative, there exists a planted kR × kL bipartite subgraph with edge density p > q. We derive asymptotically tight upper and lower bounds for this detection problem in both the dense regime, where q, p = T(1), and the sparse regime where q, p = T(n-a), a ? (0, 2]. Moreover, we consider a variant of the above problem, where one can only observe a relatively small part of the graph, by using at most Q edge queries. For this problem, we derive upper and lower bounds in both the dense and sparse regimes, and observe a gap between them.

Original languageEnglish
Title of host publication2023 IEEE International Symposium on Information Theory, ISIT 2023
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781665475549
StatePublished - 2023
Event2023 IEEE International Symposium on Information Theory, ISIT 2023 - Taipei, Taiwan, Province of China
Duration: 25 Jun 202330 Jun 2023

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095


Conference2023 IEEE International Symposium on Information Theory, ISIT 2023
Country/TerritoryTaiwan, Province of China


FundersFunder number
Israel Science Foundation1734/21, 1766/22


    Dive into the research topics of 'Detecting a Planted Bipartite Graph'. Together they form a unique fingerprint.

    Cite this