The height of random k‐trees and related branching processes

DOI10.1002/rsa.20576zbMath1328.05168arXiv1309.4342OpenAlexW2097424184WikidataQ57401423 ScholiaQ57401423MaRDI QIDQ5256388

Ryuhei Uehara, Colin Cooper, Alan M. Frieze

Publication date: 22 June 2015

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.4342

zbMATH Keywords

random \(k\)-Apollonian networksrandom \(k\)-trees

Mathematics Subject Classification ID

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

Related Items

Justifying the small-world phenomenon via random recursive trees ⋮ Heavy subtrees of Galton-Watson trees with an application to Apollonian networks ⋮ The degree profile and weight in Apollonian networks and k-trees ⋮ Randomized rumor spreading in poorly connected small-world networks ⋮ Long Paths in Random Apollonian Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scale free properties of random \(k\)-trees
• Large deviations for the weighted height of an extended class of trees
• The degree distribution of random \(k\)-trees
• Branching processes in the analysis of the heights of trees
• The first birth problem for an age-dependent branching process
• A partial k-arboretum of graphs with bounded treewidth
• Degrees and distances in random and evolving apollonian networks
• A note on the height of binary search trees
• Note on the heights of random recursive trees and random m‐ary search trees
• On longest paths and diameter in random apollonian networks
• Ancestors and descendants in evolving k‐tree models