The CRT is the scaling limit of unordered binary trees (Q5198666)
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: The CRT is the scaling limit of unordered binary trees |
scientific article; zbMATH DE number 5937286
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The CRT is the scaling limit of unordered binary trees |
scientific article; zbMATH DE number 5937286 |
Statements
The CRT is the scaling limit of unordered binary trees (English)
0 references
9 August 2011
0 references
CRT
0 references
unordered trees
0 references
weak convergence
0 references
Pólya trees
0 references
Gromov Hausdorff
0 references
0 references
0 references
0 references
