The CRT is the scaling limit of unordered binary trees (Q5198666): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 20:16, 5 March 2024
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
