Profile of random exponential binary trees

DOI10.1007/s11009-017-9578-zzbMath1393.90023OpenAlexW2736524906WikidataQ115603572 ScholiaQ115603572MaRDI QIDQ1657805

Yarong Feng, Hosam M. Mahmoud

Publication date: 14 August 2018

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-017-9578-z

zbMATH Keywords

binary treegenerating functionphase transitionasymptotic analysisrandom graphinternal (external) profiletwo-dimensional recurrence

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05) Numerical aspects of recurrence relations (65Q30)

Related Items (2)

Profile of random exponential recursive trees ⋮ Note on the exponential recursive k-ary trees

Cites Work

• Unnamed Item
• Profiles of random trees: Limit theorems for random recursive trees and binary search trees
• Width and mode of the profile for some random trees of logarithmic height
• Level number sequences for trees
• Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
• On the number of terminal vertices in certain random trees with an application to stemma construction in philology
• Profiles of random trees: correlation and width of random recursive trees and binary search trees

This page was built for publication: Profile of random exponential binary trees