Skip to main content
SpringerLink
Log in

Profile of Random Exponential Recursive Trees

  • Published:
Methodology and Computing in Applied Probability Aims and scope Submit manuscript

Abstract

We introduce the random exponential recursive tree in which at each point of discrete time every node recruits a child (new leaf) with probability p, or fails to do so with probability 1 − p. We study the distribution of the size of these trees and the average level composition, often called the profile. We also study the size and profile of an exponential version of the plane-oriented recursive tree (PORT), wherein every insertion positions in the “gaps” between the edges recruits a child (new leaf) with probability p, or fails to do so with probability 1 − p. We use martingales in conjunction with distributional equations to establish strong laws for the size of both exponential flavors; in both cases, the limit laws are characterized by their moments. Via generating functions, we get an exact expression for the average expectation of the number of nodes at each level. Asymptotic analysis reveals that the most populous level is \(\frac {p}{p+1} n\) in exponential recursive trees, and is \(\frac {p}{2p+1} n\) in exponential PORTs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Addario-Berry L, Eslava L (2018) High degrees in random recursive trees. Random Structures & Algorithms 52:560–575

    Article  MathSciNet  MATH  Google Scholar 

  • Barabási A, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512

    Article  MathSciNet  MATH  Google Scholar 

  • Bergeron F, Flajolet P, Salvy B (1992) Varieties of increasing trees. Lecture Notes in Computer Science 581:24–48. Springer, Berlin

    Article  MathSciNet  Google Scholar 

  • Billingsley P (2012) Probability and measure, anniversary ed. Wiley, Hoboken

    MATH  Google Scholar 

  • Brightwell G, Luczak M (2012) Vertices of high degree in the preferential attachment tree. Electron J Probab 17:14

    Article  MathSciNet  MATH  Google Scholar 

  • Chan D, Hughes B, Leong A, Reed W (2003) Stochastically evolving networks. Phys Rev E 68:066124

    Article  MathSciNet  Google Scholar 

  • D’Souza R, Krapivsky P, Moore C (2007) The power of choice in growing trees. Eur Phys J B 59:535–543

    Article  MathSciNet  MATH  Google Scholar 

  • Dereich S, Ortgiese M (2014) Robust analysis of preferential attachment models with fitness. Comb Probab Comput 23:386–411

    Article  MathSciNet  MATH  Google Scholar 

  • Devroye L, Hwang H (2006) Width and mode of the profile for some random trees of logarithmic height. Ann Appl Probab 16:886–918

    Article  MathSciNet  MATH  Google Scholar 

  • Dobrow R, Fill J (1999) Total path length for random recursive trees. Comb Probab Comput 8:317–333

    Article  MathSciNet  MATH  Google Scholar 

  • Dobrow R, Smythe R (1996) Poisson approximations for functionals of random trees. Random Structures & Algorithms 9:79–92

    Article  MathSciNet  MATH  Google Scholar 

  • Dondajewski M, Szymański J (1982) On the distribution of vertex-degrees in a strata of a random recursive tree. Bulletin de l’ Académie Polonaisedes Sciences Série des Sciences Mathématiques 30:205–209

    MathSciNet  MATH  Google Scholar 

  • Drmota M (2009) Random trees: An interplay between combinatorics and probability. Springer-Verlag Wien, New York

    Book  MATH  Google Scholar 

  • Drmota M, Gittenberger B, Panholzer A (2008) The degree distribution of thickened trees. Discrete Mathematics and Theoretical Computer Science. In: Proceedings of the Fifth colloquium on mathematics and computer science, Proceedings AI, pp 149–162

  • Feng Y, Mahmoud H (2018) Profile of random exponential binary trees. Methodol Comput Appl Probab 20:575–587

    Article  MathSciNet  MATH  Google Scholar 

  • Frieze A, Karoński M (2016) Introduction to random graphs, 2nd edn. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  • Fuchs M (2011) The subtree size profile of plane-oriented recursive trees. In: Flajolet P, Panario D (eds) 2011 proceedings of the workshop on analytic algorithmics and combinatorics (ANALCO11), San Francisco, pp 85–92

  • Fuchs M, Hwang H, Neininger R (2006) Profiles of random trees: Limit theorems for random recursive trees and binary search trees. Algorithmica 46:367–407

    Article  MathSciNet  MATH  Google Scholar 

  • Gastwirth J, Bhattacharya P (1984) Two probability models of pyramid or chain letter schemes demonstrating that their promotional claims are unreliable. Oper Res 32:527–536

    Article  MathSciNet  MATH  Google Scholar 

  • Goh W, Schmutz E (2002) Limit distribution for the maximum degree of a random recursive tree. J Comput Appl Math 142:61–82

    Article  MathSciNet  MATH  Google Scholar 

  • Gopaladesikan M, Mahmound H, Ward M (2014) Building random trees from blocks. Probab Eng Inf Sci 28:67–81

    Article  MathSciNet  MATH  Google Scholar 

  • Hall P, Heyde C (1980) Martingale limit theory and its applications. Academic Press, New York

    MATH  Google Scholar 

  • Hambly B, Jordan J (2004) A random hierarchical lattice: the series-parallel graph and its properties. Adv Appl Probab 36:824–838

    Article  MathSciNet  MATH  Google Scholar 

  • Henning S (2008) A functional limit law for the profile of plane-oriented recursive trees. In: Proceedings of the fifth colloquium on Mathematics and Computer Science DMTCS, AI, Kiel, Germany, pp 339–350

  • Hofri M, Mahmoud H (2018) Algorithmics of nonuniformity: Tools and Paradigms. CRC Press, Boca Raton

    Book  MATH  Google Scholar 

  • Holmgren C, Janson S (2015) Limit laws for functions of fringe trees for binary search trees and random recursive trees. Electronic Journal of Probability 20(4):51

    MathSciNet  MATH  Google Scholar 

  • Hwang H (2007) Profiles of random trees: Plane-oriented recursive trees. Random Structures & Algorithms 30:380–413

    Article  MathSciNet  MATH  Google Scholar 

  • Janson S (2005) Asymptotic degree distribution in random recursive trees. Random Structures & Algorithms 26:69–83

    Article  MathSciNet  MATH  Google Scholar 

  • Janson S (2019) Random recursive trees and preferential attachment trees are random split trees. Comb Probab Comput 28:81–99

    Article  MathSciNet  MATH  Google Scholar 

  • Javanian M, Vahidi-Asl M (2006) Depth of nodes in random recursive k-ary trees. Inf Process Lett 98:115–118

    Article  MathSciNet  MATH  Google Scholar 

  • Knoblauch A (2008) Closed-form expressions for the moments of the binomial probability distribution. SIAM J Appl Math 69:197–204

    Article  MathSciNet  MATH  Google Scholar 

  • Lamping J, Rao R, Pirolli P (1996) The hyperbolic browser: a focus + context technique for visualizing large hierarchies. J Vis Lang Comput 7:33–55

    Article  Google Scholar 

  • Lyon M, Mahmoud H (2020) Trees grown under young-age preferential attachment. J Appl Probab 57:911–927

    Article  MathSciNet  MATH  Google Scholar 

  • Mahmoud H (1991) Limiting distributions for path lengths in recursive trees. Probab Eng Inf Sci 5:53–59

    Article  MathSciNet  MATH  Google Scholar 

  • Mahmoud H (2010) The power of choice in the construction of recursive trees. Methodol Comput Appl Probab 2:763–773

    Article  MathSciNet  MATH  Google Scholar 

  • Mahmoud H, Smythe R (1995) Probabilistic analysis of bucket recursive trees. Theor Comput Sci 144:221–249

    Article  MathSciNet  MATH  Google Scholar 

  • Mahmoud H, Smythe R (1995) A survey of recursive trees. Theory Probab Math Stat 51:1–27

    MathSciNet  MATH  Google Scholar 

  • Mahmoud H, Smythe R.T, Szymański J (1993) On the structure of plane-oriented recursive trees and their branches. Random Structures & Algorithms 4:151–176

    Article  MathSciNet  MATH  Google Scholar 

  • Meir A, Moon J (1978) On the altitude of nodes in random trees. Canadian J Math 30:997–1015

    Article  MathSciNet  MATH  Google Scholar 

  • 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 19:675–680

    Article  MathSciNet  MATH  Google Scholar 

  • Neininger R (2001) The Wiener index of random trees. Comb Probab Comput 11:587–597

    Article  MathSciNet  MATH  Google Scholar 

  • Pittel B (1994) Note on the heights of random recursive trees and random m-ary search trees. Random Structures & Algorithms 5:337–347

    Article  MathSciNet  MATH  Google Scholar 

  • Stanley R (2011) Enumerative combinatorics, vol I, 2nd edn. Cambridge University Press, Cambridge

  • Van der Hofstad R, Hooghiemstra G, Van Mieghem P (2002) On the covariance of the level sizes in random recursive trees. Random Structures & Algorithms 20:519–539

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang P, Mahmoud H (2020) On nodes of small degrees and degree profile in preferential dynamic attachment circuits. Methodol Comput Appl Probab 22:625–645

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang P (2020) On several properties of a class of preferential attachment trees—plane-oriented recursive trees. Probability in the Engineering and Informational Sciences (to appear)

Download references

Acknowledgment

The author is indebted to a referee for suggestions that improved the graphics and the overall exposition.

Author information

Authors and Affiliations

  1. Department of Statistics, The George Washington University, Washington, DC, 20052, USA

    Hosam Mahmoud

Authors
  1. Hosam Mahmoud
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hosam Mahmoud.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mahmoud, H. Profile of Random Exponential Recursive Trees. Methodol Comput Appl Probab 24, 259–275 (2022). https://doi.org/10.1007/s11009-020-09831-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11009-020-09831-9

Keywords

Mathematics Subject Classification (2010)

Search

Navigation