Edge density of new graph types based on a random digraph family (Q670163)
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: Edge density of new graph types based on a random digraph family |
scientific article; zbMATH DE number 7037230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge density of new graph types based on a random digraph family |
scientific article; zbMATH DE number 7037230 |
Statements
Edge density of new graph types based on a random digraph family (English)
0 references
18 March 2019
0 references
arc density
0 references
asymptotic normality
0 references
central limit theorem
0 references
Delaunay tessellation and triangulation
0 references
proximity catch digraph
0 references
reflexivity
0 references
underlying graph
0 references
\(U\)-statistic
0 references
0 references
0.8158599734306335
0 references
0.7847830057144165
0 references
0.7382807731628418
0 references
0.7263760566711426
0 references
0.7190560102462769
0 references
