BUILDING RANDOM TREES FROM BLOCKS
From MaRDI portal
Publication:5413455
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)
05C05: Trees
05C82: Small world graphs, complex networks (graph-theoretic aspects)
05C80: Random graphs (graph-theoretic aspects)
Related Items
Depths in hooking networks, 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
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
