Scaling limit of random k-trees

We consider a random k-tree Gn,k that is uniformly selected from the class of labelled k-trees with n + k vertices. Since 1-trees are just trees, it is well-known that Gn,1 (after scaling the distances by 1/(2 √ n)) converges to the Continuum Random Tree Te. Our main result is that for k = 1, the random k-tree Gn,k, scaled by (k + 1)/(2 √ n), converges to the Continuum Random Tree Te, too. In particular this shows that the diameter as well as the typical distance of two vertices in a random k-tree Gn,k are of order √ n.

• Type: Journal
• Year: 2016
• Where: ANALCO
• Authors: Michael Drmota, Emma Yu Jin
• Keywords: ANALCO 2016