Building random trees from blocks

DOI10.1017/S0269964813000338MaRDI QIDQ5413455zbMATH OpenFDO

Authors Mohan Gopaladesikan, Hosam M. Mahmoud, Mark Daniel Ward

Publication date 30 April 2014

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0269964813000338

zbMATH Keywords

martingalesPólya urns

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• On random trees
• Random sprouts as internet models, and Pólya processes
• Random trees and general branching processes
• Degree distributions of generalized hooking networks
• scientific article; zbMATH DE number 3846622

Cites work

• Central limit theorems for urn models
• Distribution of nodes of a tree by degree
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
• scientific article; zbMATH DE number 3762080 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 1409903 (Why is no real title available?)
• Large deviations for the weighted height of an extended class of trees
• Limit theorems for depths and distances in weighted random b-ary recursive trees
• Limiting Distributions for Path Lengths in Recursive Trees
• Note on the heights of random recursive trees and random m‐ary search trees
• On the number of terminal vertices in certain random trees with an application to stemma construction in philology
• Simulation of compound hierarchical models in R
• Tree adjunct grammars
• Variance in randomized play-the-winner clinical trials

Cited in

(7)

• A few logs suffice to build (almost) all trees. II
• Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks
• Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment
• Profile of random exponential recursive trees
• Degrees in random self-similar bipolar networks
• Depths in hooking networks
• Random multi-hooking networks

This page was built for publication: Building random trees from blocks

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