Planted Bipartite Graph Detection

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 realization of an Erdős-Rényi random graph over n vertices with edge density q. Under the alternative, there exists a p...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 70; no. 6; pp. 4319 - 4334
Main Authors:	Rotenberg, Asaf, Huleihel, Wasim, Shayevitz, Ofer
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Apexes Bipartite graph Computational modeling Density Detection Graph theory hidden structures Hypotheses Hypothesis testing Image edge detection Information theory Lower bounds Null hypothesis Phase transitions Polynomials Stars statistical and computational limits statistical inference Task analysis Testing
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!