Graph limits of random unlabelled $k$-trees
Combinatorics
2018-01-31 v1 Probability
Abstract
We study random unlabelled -dimensional trees by combining the colouring approach by Gainer-Dewar and Gessel (2014) with the cycle pointing method by Bodirsky, Fusy, Kang and Vigerske (2011). Our main applications are Gromov-Hausdorff-Prokhorov and Benjamini-Schramm limits, that describe their asymptotic geometric shape on a global and local scale as the number of hedra tends to infinity.
Keywords
Cite
@article{arxiv.1801.10097,
title = {Graph limits of random unlabelled $k$-trees},
author = {Emma Yu Jin and Benedikt Stufler},
journal= {arXiv preprint arXiv:1801.10097},
year = {2018}
}