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 metadatas

Cited literature [61 references]  Display  Hide  Download

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

File

unlenr.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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

Share

Metrics

Record views

47

Files downloads

22