Triad count estimation in digraphs (Q4229256)
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 1251561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triad count estimation in digraphs |
scientific article; zbMATH DE number 1251561 |
Statements
Triad count estimation in digraphs (English)
0 references
16 December 1999
0 references
local set
0 references
local net
0 references
network sampling
0 references
Horvitz-Thompson estimation
0 references
triad count
0 references
0.8000378012657166
0 references
0.7611786127090454
0 references
0.743130624294281
0 references
0.7421677112579346
0 references
0.7401911020278931
0 references
