Community detection in sparse random networks (Q894814)
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: Community detection in sparse random networks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Community detection in sparse random networks |
scientific article |
Statements
Community detection in sparse random networks (English)
0 references
24 November 2015
0 references
community detection
0 references
detecting a dense subgraph
0 references
minimax hypothesis testing
0 references
Erdős-Rényi random graph
0 references
planted subgraph problem
0 references
scan statistic
0 references
largest connected component
0 references
0.8966020345687866
0 references
0.7936281561851501
0 references
0.7887434959411621
0 references
0.7881998419761658
0 references
0.7835730910301208
0 references
