Graph limits of random unlabelledk-trees

Jin, Emma Yu und Stufler, Benedikt (2020): Graph limits of random unlabelledk-trees. In: Combinatorics Probability & Computing, Vol. 29, No. 5, PII S0963548320000164: pp. 722-746

Abstract

We study random unlabelledk-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.

• Item Type: Journal article
• Faculties: Mathematics, Computer Science and Statistics > Mathematics
• Subjects: 500 Science > 510 Mathematics
• ISSN: 0963-5483
• Language: English