Finding one community in a sparse graph (Q892403)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6511625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding one community in a sparse graph |
scientific article; zbMATH DE number 6511625 |
Statements
Finding one community in a sparse graph (English)
0 references
19 November 2015
0 references
random graphs
0 references
cavity method
0 references
statistical inference
0 references
hidden clique
0 references
polynomial algorithms
0 references
phase transitions
0 references
0 references
0.7887434959411621
0 references
0.7808118462562561
0 references
0.7797244191169739
0 references
0.7697317600250244
0 references
