Two-walks degree assortativity in graphs and networks (Q1739993)
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: Two-walks degree assortativity in graphs and networks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-walks degree assortativity in graphs and networks |
scientific article |
Statements
Two-walks degree assortativity in graphs and networks (English)
0 references
29 April 2019
0 references
graphs
0 references
real-world networks
0 references
walks
0 references
assortativity
0 references
0.7957231998443604
0 references
0.7904167175292969
0 references
0.7473081946372986
0 references
0.7465869188308716
0 references
0.7297908067703247
0 references
