Poisson approximations for functionals of random trees

DOI10.1002/(SICI)1098-2418(199608/09)9:1/2%3C79::AID-RSA5%3E3.0.CO;2-8MaRDI QIDQ4894602zbMATH OpenOpenAlexFDO

Authors Robert P. Dobrow, Robert T. Smythe

Publication date 14 January 1997

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2%3C79::aid-rsa5%3E3.0.co;2-8

zbMATH Keywords

binary search treesincreasing treesPoisson approximationrecursive trees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05)

Recommendations

• A hooray for Poisson approximation
• A non-uniform bound on Poisson approximation of the number of subtrees of size \(k\) in a random binary search tree \(T_n\)
• Limit laws for functions of fringe trees for binary search trees and random recursive trees
• Using Stein's method to show Poisson and normal limit laws for fringe subtrees
• Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations

Cited in

(25)

• Approximating functions by their Poisson transform
• Poisson trees, succession lines and coalescing random walks
• Poisson point process limits in size-biased Galton-Watson trees
• Mixed Poisson approximation of node depth distributions in random binary search trees
• Poisson transforms for trees of bounded degree
• On multisets, interpolated multiple zeta values and limit laws
• Insertion depth in power-weight trees
• A note on the distance in random recursive trees
• Random binary trees: from the average case analysis to the asymptotics of distributions
• Labels distance in bucket recursive trees with variable capacities of buckets
• Profile of random exponential recursive trees
• A strong law for the size of Yule m-oriented recursive trees
• A non-uniform bound on Poisson approximation of the number of subtrees of size \(k\) in a random binary search tree \(T_n\)
• Deterministic edge weights in increasing tree families
• On the covariance of the level sizes in random recursive trees
• Asymptotic analysis of Hoppe trees
• On the Zagreb index of random m-oriented recursive trees
• Weak limits for the largest subpopulations in Yule processes with high mutation probabilities
• A hooray for Poisson approximation
• Ancestors and descendants in evolving k‐tree models
• On martingale tail sums for the path length in random trees
• Generalized Stirling permutations, families of increasing trees and urn models
• Bernoulli convolution of the depth of nodes in recursive trees with general affinities
• The left-right-imbalance of binary search trees
• On the distribution of distances between specified nodes in increasing trees

This page was built for publication: Poisson approximations for functionals of random trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894602)