Profiles of random trees: Limit theorems for random recursive trees and binary search trees

From MaRDI portal
Publication:866961

DOI10.1007/s00453-006-0109-5zbMath1106.68083OpenAlexW2020389755MaRDI QIDQ866961

Hsien-Kuei Hwang, Michael Fuchs, Ralph Neininger

Publication date: 14 February 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-0109-5




Related Items (25)

Limit Theorems for Subtree Size Profiles of Increasing TreesNormal Limit Law for Protected Node Profile of Random Recursive TreesProfile of random exponential binary treesProfile of random exponential recursive trees\(k\)-cut on paths and some treesOn nodes of small degrees and degree profile in preferential dynamic attachment circuitsEdgeworth expansions for profiles of lattice branching random walksLong and short paths in uniform random recursive dagsShape Measures of Random Increasing k-treesGeneral Edgeworth expansions with applications to profiles of random treesThe degree profile of random Pólya treesWeak convergence of the number of vertices at intermediate levels of random recursive treesSubtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson ApproximationsA functional limit theorem for the profile of random recursive treesProfiles of random trees: correlation and width of random recursive trees and binary search treesThe \(k\)-cut model in deterministic and random treesSearch trees: metric aspects and strong limit theoremsA functional limit theorem for the profile of search treesOn the Subtree Size Profile of Binary Search treesThe shape of unlabeled rooted random treesA functional limit theorem for the profile of \(b\)-ary treesWidth and mode of the profile for some random trees of logarithmic heightOn the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive TreesBranching random walks on binary search trees: convergence of the occupation measureLimit theorems for patterns in phylogenetic trees




This page was built for publication: Profiles of random trees: Limit theorems for random recursive trees and binary search trees