@article{doi:10.1002/rsa.20802,
author = {Drmota, Michael and Jin, Emma Yu and Stufler, Benedikt},
title = {Graph limits of random graphs from a subset of connected k-trees},
journal = {Random Structures \& Algorithms},
volume = {55},
number = {1},
pages = {125-152},
keywords = {continuum random tree, modified Galton-Watson tree, partial k-trees},
doi = {10.1002/rsa.20802},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.20802},
eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.20802},
abstract = {For any set Ω of non-negative integers such that , we consider a random Ω-k-tree Gn,k that is uniformly selected from all connected k-trees of (n + k) vertices such that the number of (k + 1)-cliques that contain any fixed k-clique belongs to Ω. We prove that Gn,k, scaled by where Hk is the kth harmonic number and σΩ > 0, converges to the continuum random tree . Furthermore, we prove local convergence of the random Ω-k-tree to an infinite but locally finite random Ω-k-tree G∞,k.},,
year = {2019}
}