Preferential attachment random graphs with edge-step functions (Q2224970)
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: Preferential attachment random graphs with edge-step functions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preferential attachment random graphs with edge-step functions |
scientific article |
Statements
Preferential attachment random graphs with edge-step functions (English)
0 references
4 February 2021
0 references
complex networks
0 references
preferential attachment
0 references
concentration bounds
0 references
power-law
0 references
scale-free
0 references
Karamata's theory
0 references
regularly varying functions
0 references
0.8658743500709534
0 references
0.8379533290863037
0 references
0.8372570872306824
0 references
0.8228269219398499
0 references
0.8149594664573669
0 references
