Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Random enriched trees with applications to random graphs

Abstract : We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random unlabelled k-trees that are rooted at a k-clique of distinguishable vertices. For both models we establish a Gromov–Hausdorff scaling limit, a Benjamini–Schramm limit, and a local weak limit that describes the asymptotic shape near the fixed root.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [61 references]  Display  Hide  Download
Contributor : Benedikt Stufler <>
Submitted on : Wednesday, February 8, 2017 - 12:28:08 PM
Last modification on : Tuesday, November 19, 2019 - 12:22:28 PM
Long-term archiving on: : Tuesday, May 9, 2017 - 1:10:10 PM


Files produced by the author(s)


  • HAL Id : ensl-01461638, version 1
  • ARXIV : 1504.02006



Benedikt Stufler. Random enriched trees with applications to random graphs. 2017. ⟨ensl-01461638⟩