Abstract
We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with fixed, complementary probabilities. Node addition follows the usual uniform attachment model. For node removal, we identify a class of deletion rules guaranteeing the current tree conditioned on its size is uniformly distributed over its range. By using generating function theory and singularity analysis, we obtain asymptotic estimates for the expectation and variance of a tree’s size, as well as its expected leaf count and root degree. In all cases, the behavior of such trees falls into three regimes determined by the insertion probability. Interestingly, the results are independent of the specific class member deletion rule used.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ben-Naim, E., Krapivsky P.L.: Addition-deletion networks. The Journal of Physics A: Mathematical and Theoretical 40, 8607–8619 (2007)
Deo, N., Cami, A.: Preferential deletion in dynamic models of web-like networks. Information Processing Letters 102, 156–162 (2007)
Dondajewski, M., Szymanski, J.: On the distribution of vertex-degress in a strata of a random recursive tree. Bulletin de l’Académie Polonaise des Sciences: Série des Sciences Mathématiques 30, 205–209 (1982)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)
Ghosal, G., Chi, L., Barabási, A.L.: Uncovering the role of elementary processes in networking evolution. Scientific Reports 3, 2920 (2013)
Hofri, M., Mahmoud, H.: Algorithms of Nonuniformity: Tools and Paradigms. CRC Press, Boca Raton (2018)
Janson, S.: Asymptotic degree distribution in random recursive trees. Random Structures and Algorithms 26, 69–83 (2005)
Jonassen, A.R., Knuth, D.E.: A trivial algorithm whose analysis isn’t. Journal of Computer and System Sciences 16, 301–322 (1978)
Najock, D., Heyde, C.C.: On the number of terminal vertices in certain random trees with an application to stemma construction in philology. Journal of Applied Probability 19, 675–680 (1982)
Panny, W.: Deletions in random binary search trees: a story of errors. Journal of Statistical Planning and Inference 140, 2335–2345 (2010)
Pittel, B.: Note on the height of random recursive trees and m-ary search trees. Random Structures and Algorithms 5, 337–347 (1994)
Prodinger, H.: The kernel method: a collection of examples. Séminarie Lotharingien de Combinatoire 50, Article B50f (2003)
Smythe R.T., Mahmoud, H.M.: A survey of recursive trees. Theory of probability and mathematical statistics 51, 1–27 (1995)
Zhang, X., He, Z., Rayman-Bacchus, L.: Random birth-and-death networks. Journal of Statistical Physics 162, 842–854 (2016)
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflicts of interest
The author declares that he has no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A preliminary version of this paper is posted to the arXiv as arXiv:1906.02720v2.
Rights and permissions
About this article
Cite this article
Saunders, A.T. A Class of Random Recursive Tree Algorithms with Deletion. Algorithmica 83, 3363–3378 (2021). https://doi.org/10.1007/s00453-021-00859-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-021-00859-y