The continuum random tree is the scaling limit of unlabeled unrooted trees
From MaRDI portal
Publication:5242885
DOI10.1002/RSA.20833zbMath1426.05153arXiv1412.6333OpenAlexW2962866683WikidataQ128702227 ScholiaQ128702227MaRDI QIDQ5242885
Publication date: 7 November 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.6333
Related Items (9)
Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs ⋮ Asymptotic properties of random unlabelled block-weighted graphs ⋮ Graphon convergence of random cographs ⋮ The distribution of the number of automorphisms of random trees ⋮ Asymptotic enumeration and limit laws for multisets: the subexponential case ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ Self-similar real trees defined as fixed points and their geometric properties ⋮ Simply Generated Unrooted Plane Trees ⋮ Graph limits of random unlabelled k-trees
This page was built for publication: The continuum random tree is the scaling limit of unlabeled unrooted trees