Profiles of random trees: Plane-oriented recursive trees
From MaRDI portal
Publication:3437023
DOI10.1002/rsa.20139zbMath1115.05083OpenAlexW4256254287MaRDI QIDQ3437023
Publication date: 11 May 2007
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20139
Related Items (18)
Limit Theorems for Subtree Size Profiles of Increasing Trees ⋮ Normal Limit Law for Protected Node Profile of Random Recursive Trees ⋮ ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES ⋮ Profile of random exponential recursive trees ⋮ Limit laws for two distance-based indices in random recursive tree models ⋮ Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves ⋮ On nodes of small degrees and degree profile in preferential dynamic attachment circuits ⋮ On several properties of a class of hybrid recursive trees ⋮ Long and short paths in uniform random recursive dags ⋮ Shape Measures of Random Increasing k-trees ⋮ General Edgeworth expansions with applications to profiles of random trees ⋮ The degree profile of random Pólya trees ⋮ Quantification and statistical analysis of topological features of recursive trees ⋮ Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations ⋮ The \(k\)-cut model in deterministic and random trees ⋮ A functional limit theorem for the profile of search trees ⋮ The shape of unlabeled rooted random trees ⋮ Limit theorems for patterns in phylogenetic trees
Cites Work
This page was built for publication: Profiles of random trees: Plane-oriented recursive trees
