A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
From MaRDI portal
Publication:6326129
DOI10.1016/J.DAM.2020.12.013arXiv1909.12767MaRDI QIDQ6326129FDOQ6326129
Authors: Michael Fuchs, Cecilia Holmgren, D. Mitsche, Ralph Neininger 
Publication date: 27 September 2019
Abstract: We identify the mean growth of the independence number of random binary search trees and random recursive trees and show normal fluctuations around their means. Similarly we also show normal limit laws for the domination number and variations of it for these two cases of random tree models. Our results are an application of a recent general theorem of Holmgren and Janson on fringe trees in these two random tree models.
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
This page was built for publication: A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6326129)
