Graph limits of random unlabelledk-trees

Jin, Emma Yu und Stufler, Benedikt (2020): Graph limits of random unlabelledk-trees. In: Combinatorics Probability & Computing, Bd. 29, Nr. 5, PII S0963548320000164: S. 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.

• Dokumententyp: Zeitschriftenartikel
• Fakultät: Mathematik, Informatik und Statistik > Mathematik
• Themengebiete: 500 Naturwissenschaften und Mathematik > 510 Mathematik
• ISSN: 0963-5483
• Sprache: Englisch