Identifiability for graphexes and the weak kernel metric (Q3295264)
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: Identifiability for graphexes and the weak kernel metric |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifiability for graphexes and the weak kernel metric |
scientific article |
Statements
Identifiability for Graphexes and the Weak Kernel Metric (English)
0 references
8 July 2020
0 references
graphex
0 references
sparse network
0 references
weak kernel metric
0 references
regularity
0 references
identifiability
0 references
expected subgraph counts
0 references
Poisson process
0 references
0 references
0 references
0.8056630492210388
0 references
0.7920227646827698
0 references
0.7685126066207886
0 references
0.7602376341819763
0 references
0.747815728187561
0 references
