Advertisement

Profile of Random Exponential Binary Trees

  • Yarong Feng
  • Hosam Mahmoud
Article
  • 36 Downloads

Abstract

We introduce the random exponential binary tree (EBT) and study its profile. As customary, the tree is extended by padding each leaf node (considered internal), with the appropriate number of external nodes, so that the outdegree of every internal node is made equal to 2. In a random EBT, at every step, each external node is promoted to an internal node with probability p, stays unchanged with probability 1 - p, and the resulting tree is extended. We study the internal and external profiles of a random EBT and get exact expectations for the numbers of internal and external nodes at each level. Asymptotic analysis shows that the average external profile is richest at level \(\frac {2p}{p+1}n\), and it experiences phase transitions at levels a n, where the a’s are the solutions to an algebraic equation. The rates of convergence themselves go through an infinite number of phase changes in the sublinear range, and then again at the nearly linear levels.

Keywords

Binary tree Random graph Internal (external) profile Asymptotic analysis Phase transition Two-dimensional recurrence Generating function 

Mathematics Subject Classification (2010)

Primary: 90B15; Secondary: 60C05 05C80 65Q30 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chan DY, Hughes BD, Leong AS, Reed WJ (2003) Stochastically evolving networks. Phys Rev E 68(6):066,124MathSciNetCrossRefGoogle Scholar
  2. Devroye L, Hwang HK (2006) Width and mode of the profile for some random trees of logarithmic height. Ann Appl Probab 16(2):886–918MathSciNetCrossRefzbMATHGoogle Scholar
  3. Drmota M, Hwang HK (2005) Profiles of random trees: correlation and width of random recursive trees and binary search trees. Adv Appl Probab 321–341Google Scholar
  4. Flajolet P, Prodinger H (1987) Level number sequences for trees. Discret Math 65(2):149–156MathSciNetCrossRefzbMATHGoogle Scholar
  5. Fuchs M, Hwang HK, Neininger R (2006) Profiles of random trees: limit theorems for random recursive trees and binary search trees. Algorithmica 46(3-4):367–407MathSciNetCrossRefzbMATHGoogle Scholar
  6. Gastwirth JL, Bhattacharya P (1984) Two probability models of pyramid or chain letter schemes demonstrating that their promotional claims are unreliable. Oper Res 32(3):527–536MathSciNetCrossRefzbMATHGoogle Scholar
  7. Mahmoud HM (1992) Evolution of random search trees. WileyGoogle Scholar
  8. Najock D, Heyde C (1982) On the number of terminal vertices in certain random trees with an application to stemma construction in philology. J Appl Probab 675–680Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Department of StatisticsThe George Washington UniversityWashingtonUSA

Personalised recommendations