On the number of leaves in a random recursive tree
type: Item
instance of: scholarly article
title: On the number of leaves in a random recursive tree
zbMATH Open document ID: 1360.05081
DOI: 10.1214/14-BJPS252
published in: Brazilian Journal of Probability and Statistics
publication date: 2015-11-10T00:00:00Z
full work available at URL: https://projecteuclid.org/euclid.bjps/1442513452
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05A16
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 60F05
zbMATH DE Number: 6506582
zbMATH Keywords: random recursive tree
zbMATH Keywords: normal approximation
zbMATH Keywords: Stein's method
zbMATH Keywords: size-bias method
zbMATH Keywords: Wasserstein distance
zbMATH Keywords: Kolmogorov distance
zbMATH Keywords: random permutation
zbMATH Keywords: concentration inequality
author: Ya Zhe Zhang
MaRDI profile type: Publication
cites work: Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
cites work: Concentration of measures via size-biased couplings
cites work: Multivariate normal approximations by Stein's method and size bias couplings
cites work: Hopf-algebraic structure of families of trees
cites work: Q4428423
cites work: Cutting down recursive trees
cites work: Distribution of nodes of a tree by degree
cites work: On the number of terminal vertices in certain random trees with an application to stemma construction in philology
cites work: Fundamentals of Stein's method
cites work: Q4940321
cites work: Breakage and restoration in recursive trees
description: scientific article; zbMATH DE number 6506582