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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information theory Ročník 70; číslo 6; s. 4319 - 4334
Hlavní autori:	Rotenberg, Asaf, Huleihel, Wasim, Shayevitz, Ofer
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.06.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!