A recursive tree is constructed by starting with a root node and repeatedly adjoining new nodes to one node of the tree already constructed. Such a tree can represent, for example, the heirarchy of a workforce of a company that grows via recruiting. At times of economic depression, the company may decide to lay off participants, and in some cases it is a fair policy to relieve the last senior worker (most recent entry in the tree). If we remove an edge from such a tree then it falls into two subtrees one of which contains the most recent entry. If we continue to remove edges from the successively smaller subtrees that contain the most recent entry, we eventually isolate the most recent entry. We consider how many randomly selected edges must be removed in average before isolating the most recent entry by this procedure.
AMS Mathematics Subject Classification
05C05 05C80 68R05
Key words and phrases
Recursive tree Tauberian theorem
This is a preview of subscription content, log in to check access.
R. Smythe and H. Mahmoud,A survey of recursive trees, Theory of Probability and Mathematical Statistics,51 (1996), 1–29 (appeared in Ukrainian in (1994)).MathSciNetGoogle Scholar
R. Van der Hofstad, G. Hooghiemstra and P. van Mieghem,First passage percolation on the random graph, Probability in Engineering and Information sciences15 (2001), 225–237.MATHCrossRefGoogle Scholar
R. Van der Hofstad, G. Hooghiemstra and P. van Mieghem,On the covariance of the level sizes in random recursive trees, Random Structures and Algorithms20 (2002), 519–539.MATHCrossRefMathSciNetGoogle Scholar