Random enriched trees with applications to random graphs
Probability
2016-12-15 v7 Combinatorics
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 -trees that are rooted at a -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.
Cite
@article{arxiv.1504.02006,
title = {Random enriched trees with applications to random graphs},
author = {Benedikt Stufler},
journal= {arXiv preprint arXiv:1504.02006},
year = {2016}
}