Detection threshold for correlated Erdős-Rényi graphs via densest subgraph (Q6574816)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Detection threshold for correlated Erdős-Rényi graphs via densest subgraph |
scientific article; zbMATH DE number 7883304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detection threshold for correlated Erdős-Rényi graphs via densest subgraph |
scientific article; zbMATH DE number 7883304 |
Statements
Detection threshold for correlated Erdős-Rényi graphs via densest subgraph (English)
0 references
18 July 2024
0 references
detecting edge correlation
0 references
Erdős-Rényi random graphs
0 references
unlabeled nodes
0 references
hypothesis testing problem
0 references
