Rights statement: The final publication is available at Springer via http://dx.doi.org/10.1007/s00493-021-4445-5
Accepted author manuscript, 386 KB, PDF document
Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License
Submitted manuscript
Licence: CC BY: Creative Commons Attribution 4.0 International License
Final published version
Research output: Contribution to Journal/Magazine › Journal article › peer-review
| <mark>Journal publication date</mark> | 31/12/2022 |
|---|---|
| <mark>Journal</mark> | Combinatorica |
| Issue number | 6 |
| Volume | 42 |
| Number of pages | 32 |
| Pages (from-to) | 821-852 |
| Publication Status | Published |
| Early online date | 15/11/21 |
| <mark>Original language</mark> | English |
Motivated by the work of Lovász and Szegedy on the convergence and limits of dense graph sequences [10], we investigate the convergence and limits of finite trees with respect to sampling in normalized distance. We introduce dendrons (a notion based on separable real trees) and show that the sampling limits of finite trees are exactly the dendrons. We also prove that the limit dendron is unique.