Profile of Random Exponential Recursive Trees
Hosam Mahmoud ()
Additional contact information
Hosam Mahmoud: The George Washington University
Methodology and Computing in Applied Probability, 2022, vol. 24, issue 1, 259-275
Abstract:
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 p p + 1 n $\frac {p}{p+1} n$ in exponential recursive trees, and is p 2 p + 1 n $\frac {p}{2p+1} n$ in exponential PORTs.
Keywords: Recursive tree; Random graph; Profile; Two-dimensional recurrence; Martingale; 05082; 90B15; 60C05; 60F05 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s11009-020-09831-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:24:y:2022:i:1:d:10.1007_s11009-020-09831-9
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009
DOI: 10.1007/s11009-020-09831-9
Access Statistics for this article
Methodology and Computing in Applied Probability is currently edited by Joseph Glaz
More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().