BUILDING RANDOM TREES FROM BLOCKS

DOI10.1017/S0269964813000338zbMath1287.05139MaRDI QIDQ5413455

Mark Daniel Ward, Hosam M. Mahmoud, Mohan Gopaladesikan

Publication date: 30 April 2014

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

zbMATH Keywords

martingalesPólya urns

Mathematics Subject Classification ID

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

Related Items (5)

Depths in hooking networks ⋮ Degrees in random self-similar bipolar networks ⋮ Profile of random exponential recursive trees ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large deviations for the weighted height of an extended class of trees
• Tree adjunct grammars
• Variance in randomized play-the-winner clinical trials
• Central limit theorems for urn models
• Distribution of nodes of a tree by degree
• Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees
• Limiting Distributions for Path Lengths in Recursive Trees
• On the number of terminal vertices in certain random trees with an application to stemma construction in philology
• Note on the heights of random recursive trees and random m‐ary search trees
• Simulation of Compound Hierarchical Models in R
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems

This page was built for publication: BUILDING RANDOM TREES FROM BLOCKS