Depth Properties of scaled attachment random recursive trees
From MaRDI portal
Publication:2909243
DOI10.1002/rsa.20391zbMath1247.05217arXiv1210.7168OpenAlexW3083134037WikidataQ62556722 ScholiaQ62556722MaRDI QIDQ2909243
Omar Fawzi, Nicolas Fraiman, Luc P. Devroye
Publication date: 30 August 2012
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7168
Related Items
Longest Path Distance in Random Circuits ⋮ It's a small world for random surfers ⋮ Community modulated recursive trees and population dependent branching processes ⋮ Asymptotic results on Hoppe trees and their variations ⋮ Nonuniform recursive trees with vertex attraction depending on their labels ⋮ A new approach to Pólya urn schemes and its infinite color generalization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The power of choice in the construction of recursive trees
- Uniform recursive trees: branching structure and simple random downward walk
- The power of choice in growing trees
- Branching processes in the analysis of the heights of trees
- Distances in random plane-oriented recursive trees
- Long and short paths in uniform random recursive dags
- Distribution of nodes of a tree by degree
- Emergence of Scaling in Random Networks
- Random Trees
- A note on the height of binary search trees
- A Probability Model of a Pyramid Scheme
- On the Altitude of Nodes in Random Trees
- On the Expected Depth of Random Circuits
- Note on the heights of random recursive trees and random m‐ary search trees
- On the depth of randomly generated circuits
- On the distribution of distances in recursive trees
- Total Path Length for Random Recursive Trees
- The strong convergence of maximal degrees in uniform random recursive trees and dags
- On the Variance of the Height of Random Binary Search Trees
- Probability Inequalities for Sums of Bounded Random Variables
- The total progeny in a branching process and a related random walk
- On the Application of the Borel-Cantelli Lemma
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- On the fluctuations of sums of random variables
