Random enriched trees with applications to random graphs - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Random enriched trees with applications to random graphs

(1)
1
Benedikt Stufler

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.
Fichier principal
Vignette du fichier
unlenr.pdf (816.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-01461638 , version 1 (08-02-2017)

Identifiers

Cite

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

Collections

ENS-LYON INSMI UDL
44 View
59 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More