Finding one community in a sparse graph (Q892403): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LAS / rank | |||
Normal rank | |||
Revision as of 01:39, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding one community in a sparse graph |
scientific article |
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
