Growing binary trees in a random environment

DOI10.1109/18.179356MaRDI QIDQ4034447zbMATH OpenOpenAlexFDO

Authors Ilan Kessler, Moshe Sidi

Publication date 16 May 1993

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/78ebd7719f3527a938180a6f3c2b611bf26ccb75

zbMATH Keywords

binary treesrandom environmentsplitting algorithmsrandom treesgrowing trees

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3846622
• On the asymptotic behaviour of random recursive trees in random environments
• Trees with product-form random weights
• A diffusion limit for a class of randomly-growing binary trees
• Subcritical branching processes in a two-state random environment, and a percolation problem on trees

Cited in

(2)

• Trees with product-form random weights
• Topological properties of binary trees grown with order-dependent branching probabilities

This page was built for publication: Growing binary trees in a random environment

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