Abstract
We study the degree profile for a number of classes of random graphs that arise as generalizations of recursive trees, including random circuits and random recursive trees endowed with the power of choice. We investigate the distribution of the degrees of nodes that appear in various stages of the insertion process in each of these graph types. For these classes, we will see phase transitions in degrees depending on the stage—early stages are associated with normal distributions, intermediate stages are associated with the Poisson distribution and in the late stages the degrees become degenerate.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arya S, Golin M, Mehlhorn K (1999) On the expected depth of random circuits. Comb Probab Comput 8:209–228
Bergeron F, Flajolet P, Salvy B (1992) Varieties of increasing trees. In: Lecture notes in computer science, vol 581. Springer, Berlin, pp 24–48
D’Souza R, Krapivsky P, Moore C (2007) The power of choice in growing trees. Eur Phys J B59:535–543
Devroye L, Janson S (2011) Long and short paths in uniform random recur sive dags. Ark Mat 49:61–77
Díaz J, Serna M, Spirakis P, Toran J (1994) On the expected depth of Boolean circuits. Report LSI-7-R, Department de Linguatges i Systemes. Universidad Politécnica Catalunya, Barcelona
Feng Q, Mahmoud H, Panholzer A (2008) The degree distribution of random k–trees. Theor Comput Sci 60:319–343
Gao Y (2009) The degree distribution of random k–trees. Theor Comput Sci 410:688–695
Janson S (2005) Asymptotic degree distribution in random recursive trees. Random Struct Algorithms 26:69–83
Kuba M, Panholzer A (2007) On the degree distribution of the nodes in increasing trees. J Comb Theory Ser A 114:597–618
Mahmoud H (2010) The power of choice in the construction of recursive trees. Methodol Comput Appl Probab 12:763–773
Mahmoud H, Smythe R (1992) Asymptotic joint normality of outdegrees of nodes in random recursive trees. Random Struct Algorithms 3:255–266
Panholzer A, Seitz G (2010) Ordered increasin k–trees: introduction and analysis of preferential attachment network model. In: Discrete mathematics and theoretical computer science. DMTC Proc. AM, pp 549–564
Seitz G (2011) Analysis of various parameters in labelled trees and tree-like structures. PhD Dissertation, Vienna University of Technology, Austria
Smythe R, Mahmoud H (1994) A survey of recursive trees. Theorya Imovirnosty ta Matemika Statystika 51:1–29 (in Ukrainian); an English translation appears in Theory Probab Math Stat 51:1–27
Tsukiji T, Mahmoud H (2001) A limit law for outputs in random circuits. Algorithmica 31:403–412
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mahmoud, H.M. The Degree Profile in Some Classes of Random Graphs that Generalize Recursive Trees. Methodol Comput Appl Probab 16, 527–538 (2014). https://doi.org/10.1007/s11009-012-9312-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-012-9312-9
Keywords
- Random structure
- Random tree
- Random graph
- Recursive tree
- Recursive circuit
- Power of choice
- Degree
- Profile
- Phases
- Phase transition
- Stochastic recurrence