The continuum random tree is the scaling limit of unlabelled unrooted trees

Abstract : We show that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov–Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This confirms a conjecture by Aldous (1991). We also establish Benjamini–Schramm convergence of this model of random trees and provide a general approximation result, that allows for a transfer of a wide range of asymptotic properties of extremal and additive graph parameters from Pólya trees to unrooted trees.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-01461633
Contributor : Benedikt Stufler <>
Submitted on : Wednesday, February 8, 2017 - 12:24:27 PM
Last modification on : Wednesday, November 29, 2017 - 4:01:42 PM
Long-term archiving on : Tuesday, May 9, 2017 - 1:08:37 PM

File

frerev.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-01461633, version 1
  • ARXIV : 1412.6333

Collections

Citation

Benedikt Stufler. The continuum random tree is the scaling limit of unlabelled unrooted trees. 2017. ⟨ensl-01461633⟩

Share

Metrics

Record views

68

Files downloads

32