Scaling limits of k-ary growing trees

From MaRDI portal
Publication:902873

DOI10.1214/14-AIHP622zbMATH Open1329.60076arXiv1402.1084MaRDI QIDQ902873FDOQ902873

Robin Stephenson, Bénédicte Haas

Publication date: 4 January 2016

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Abstract: For each integer kgeq2, we introduce a sequence of k-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" k1 new edges. When k=2, this corresponds to a well-known algorithm which was first introduced by R'emy. Our main result concerns the asymptotic behavior of these trees as n becomes large: for all k, the sequence of k-ary trees grows at speed n1/k towards a k-ary random real tree that belongs to the family of self-similar fragmentation trees. This convergence is proved with respect to the Gromov-Hausdorff-Prokhorov topology. We also study embeddings of the limiting trees when k varies.


Full work available at URL: https://arxiv.org/abs/1402.1084




Recommendations




Cites Work


Cited In (17)





This page was built for publication: Scaling limits of \(k\)-ary growing trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902873)