Growing random graphs with a preferential attachment structure (Q5026477)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7470638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Growing random graphs with a preferential attachment structure |
scientific article; zbMATH DE number 7470638 |
Statements
8 February 2022
0 references
Rémy's algorithm
0 references
scaling limit
0 references
preferential attachment tree
0 references
weighted recursive tree
0 references
self-similar random metric space
0 references
continuum random trees
0 references
line-breaking construction
0 references
0 references
0 references
0 references
0 references
0 references
0.7836715579032898
0 references
0.7735471129417419
0 references
0.7714461088180542
0 references
0.7669054269790649
0 references
0.7656094431877136
0 references
