A uniform random graph model for directed acyclic networks and its effect on motif-finding (Q4689348)
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: A uniform random graph model for directed acyclic networks and its effect on motif-finding |
scientific article; zbMATH DE number 6954879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A uniform random graph model for directed acyclic networks and its effect on motif-finding |
scientific article; zbMATH DE number 6954879 |
Statements
A uniform random graph model for directed acyclic networks and its effect on motif-finding (English)
0 references
16 October 2018
0 references
directed acyclic graphs
0 references
motifs
0 references
random network models
0 references
complex networks
0 references
citation networks
0 references
0.87370133
0 references
0 references
0.85923916
0 references
0.8563679
0 references
0.8563679
0 references
0.8539582
0 references
0 references
0.85165364
0 references
0.8507504
0 references
