Graph limits of random unlabelled k-trees
-
Published:2020-05-18
Issue:5
Volume:29
Page:722-746
-
ISSN:0963-5483
-
Container-title:Combinatorics, Probability and Computing
-
language:en
-
Short-container-title:Combinator. Probab. Comp.
Author:
Jin Emma Yu,Stufler Benedikt
Abstract
AbstractWe study random unlabelled k-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 (k + 1)-cliques tends to infinity.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference29 articles.
1. The Continuum random tree II: an overview
2. Limiting Distribution for Distances in k-Trees
3. The number of labeled k-trees
4. [17] Iriza, A. D. (2015) Enumeration and random generation of unlabeled classes of graphs: A practical study of cycle-pointing and the dissymmetry theorem. Master’s thesis, Princeton University.