On the number of weakly connected subdigraphs in random \(k\)NN digraphs (Q2223629)
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: On the number of weakly connected subdigraphs in random kNN digraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of weakly connected subdigraphs in random \(k\)NN digraphs |
scientific article |
Statements
On the number of weakly connected subdigraphs in random \(k\)NN digraphs (English)
0 references
29 January 2021
0 references
asymptotic normality
0 references
binomial process
0 references
central limit theorem
0 references
homogeneous point process
0 references
indegree
0 references
law of large numbers
0 references
reflexivity
0 references
0 references
0 references
0 references
0 references
0.7564950585365295
0 references
0.7548415064811707
0 references
0.7523152828216553
0 references
0.7392144799232483
0 references
