Growing random uniform d-ary trees
From MaRDI portal
Publication:6367464
DOI10.1007/S00026-022-00621-3arXiv2105.05513MaRDI QIDQ6367464FDOQ6367464
Authors: Jean-François Marckert 
Publication date: 12 May 2021
Abstract: Let T d (n) be the set of d-ary rooted trees with n internal nodes. We give a method to construct a sequence (t n , n 0) where, for any n 1, t n has the uniform distribution in T d (n), and t n is constructed from t n--1 by the addition of a new node, and a rearrangement of the structure of t n--1. This method is inspired by R{'e}my's algorithm which does this job in the binary case, but it is different from it. This provides a method for the random generation of a uniform d-ary tree in T d (n) with a cost linear in n.
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Functional limit theorems; invariance principles (60F17) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
This page was built for publication: Growing random uniform d-ary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367464)
