A diffusion limit for a class of randomly-growing binary trees

DOI10.1007/BF00318784zbMath0641.60026OpenAlexW2052638374MaRDI QIDQ1100799

David J. Aldous, Paul C. Shields

Publication date: 1988

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00318784

zbMATH Keywords

strong law of large numberscentral limit theorementropy estimationcoin-tossing

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Diffusion processes (60J60)

Related Items

Behavior near the extinction time in self-similar fragmentations. II: Finite dislocation measures., Stochastic explosion and non-uniqueness for \(\alpha\)-Riccati equation, A note on the probabilistic analysis of patricia trees, Phase transition in a generalized Eden growth model on a tree, Node profiles of symmetric digital search trees: Concentration properties, Continuous-time digital search tree and a border aggregation model, Doubly stochastic Yule cascades. II: The explosion problem in the non-reversible case, A Markovian growth dynamics on rooted binary trees evolving according to the Gompertz curve, Nearest-neighbor entropy estimators with weak metrics, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, Compression based homogeneity testing, Selection of a metric for the nearest neighbor entropy estimators, D?E?K=(1000)8, Analysis of random LC tries, A functional limit theorem for the profile of \(b\)-ary trees, Analytic analysis of algorithms, How many random questions are necessary to identify \(n\) distinct objects?, A Central Limit Theorem for Non-Overlapping Return Times, Digital search trees and chaos game representation, A Delayed Yule Process, Doubly stochastic Yule cascades. I: The explosion problem in the time-reversible case, Data compression and learning in time sequences analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotical growth of a class of random trees
• Oriented percolation in two dimensions
• On growing random binary trees
• Splitting intervals. II: Limit laws for lengths
• A criterion for tightness for a sequence of martingales
• Stopping times and tightness. II
• Coding theorems for individual sequences
• Paths in a random digital tree: limiting distributions
• A limit theorem for measurable random processes and its applications
• A universal algorithm for sequential data compression
• Discounted branching random walks
• Splitting intervals