Note on the heights of random recursive trees and random m‐ary search trees
From MaRDI portal
Publication:4286299
DOI10.1002/rsa.3240050207zbMath0790.05077MaRDI QIDQ4286299
Publication date: 22 June 1994
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240050207
height; random recursive tree; uniform recursive tree; Crump-Mode branching process; Devroye's limit law; ordered recursive tree; random \(m\)-ary search tree
Related Items
Weak convergence of the number of vertices at intermediate levels of random recursive trees, A non-increasing tree growth process for recursive trees and applications, The metric space of limit laws for $q$-hook formulas, SMALL-WORLD EFFECT IN GEOGRAPHICAL ATTACHMENT NETWORKS, Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, The idemetric property: when most distances are (almost) the same, Depth of vertices with high degree in random recursive trees, Random Recursive Trees and Preferential Attachment Trees are Random Split Trees, On a random search tree: asymptotic enumeration of vertices by distance from leaves, Search problems in groups and branching processes, The height of random k‐trees and related branching processes, Diameter of the Stochastic Mean-Field Model of Distance, BUILDING RANDOM TREES FROM BLOCKS, The height of increasing trees, On martingale tail sums for the path length in random trees, A Theory of Network Security: Principles of Natural Selection and Combinatorics, On bucket increasing trees, clustered increasing trees and increasing diamonds, Random recursive hypergraphs, Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves, Community modulated recursive trees and population dependent branching processes, Broadcasting‐induced colorings of preferential attachment trees, High degrees in recursive trees, It's a small world for random surfers, Probabilistic analysis of bucket recursive trees, A random model of publication activity, Twitter event networks and the superstar model, Weighted height of random trees, Diameters in preferential attachment models, A functional limit theorem for the profile of \(b\)-ary trees, On a random graph evolving by degrees, A note on the growth of random trees, Limit distribution for the maximum degree of a random recursive tree, The robot crawler graph process, A functional limit theorem for the profile of random recursive trees, A bijection of plane increasing trees with relaxed binary trees of right height at most one, Poisson-Dirichlet branching random walks, Geometry of weighted recursive and affine preferential attachment trees, A random graph of moderate density, Correction terms for the height of weighted recursive trees, On joint properties of vertices with a given degree or label in the random recursive tree, Condensation phenomena in preferential attachment trees with neighbourhood influence, The \(k\)-cut model in deterministic and random trees, The variance of the average depth of a pure birth process converges to 7, Limiting probabilities for vertices of a given rank in 1-2 trees, Degree distribution of the FKP network model, On leaf related statistics in recursive tree models, Long and short paths in uniform random recursive dags, Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study, A class of random recursive tree algorithms with deletion, Profile of random exponential recursive trees, Investigating several fundamental properties of random lobster trees and random spider trees, Multiway Trees of Maximum and Minimum Probability under the Random Permutation Model, The small-community phenomenon in networks, On Tail Bounds for Random Recursive Trees, Depth Properties of scaled attachment random recursive trees, Justifying the small-world phenomenon via random recursive trees, Critical random graphs and the structure of a minimum spanning tree, Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees, The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees, Asymptotic results on Hoppe trees and their variations, On finding a minimum spanning tree in a network with random weights, Width of a scale-free tree, On the asymptotic behaviour of random recursive trees in random environments, The Longest Minimum-Weight Path in a Complete Graph, Universal Limit Laws for Depths in Random Trees
Cites Work
- Unnamed Item
- On growing random binary trees
- Branching processes in the analysis of the heights of trees
- On the distribution of leaves in rooted subtrees of recursive trees
- Distances in random plane-oriented recursive trees
- Postulates for subadditive processes
- The first birth problem for an age-dependent branching process
- Linear expected time of a simple union-find algorithm
- The expected linearity of a simple equivalence algorithm
- A general age-dependent branching process. I
- Distribution of nodes of a tree by degree
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- On the height of random m‐ary search trees
- A note on the height of binary search trees
- The first- and last-birth problems for a multitype age-dependent branching process
- A Probability Model of a Pyramid Scheme
- Chernoff's theorem in the branching random walk
- On the structure of random plane‐oriented recursive trees and their branches
