Dense graph limits under respondent-driven sampling (Q341610)
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 6653635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dense graph limits under respondent-driven sampling |
scientific article; zbMATH DE number 6653635 |
Statements
Dense graph limits under respondent-driven sampling (English)
0 references
16 November 2016
0 references
random graph
0 references
dense graph limits
0 references
ergodic
0 references
respondent driven sampling
0 references
0.8807936310768127
0 references
0.7853476405143738
0 references
0.7574499845504761
0 references
0.7461485266685486
0 references
0.7412670254707336
0 references
