The degree profile in some classes of random graphs that generalize recursive trees

DOI10.1007/S11009-012-9312-9zbMath1315.60012OpenAlexW2081791100MaRDI QIDQ479165

Hosam M. Mahmoud

Publication date: 5 December 2014

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-012-9312-9

zbMATH Keywords

profilephase transitionrandom structuredegreephasesrandom graphrandom treestochastic recurrencepower of choicerecursive circuitrecursive tree

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (3)

On nodes of small degrees and degree profile in preferential dynamic attachment circuits ⋮ On several properties of a class of hybrid recursive trees ⋮ On martingale tail sums in affine two-color urn models with multiple drawings

Cites Work

• Unnamed Item
• The power of choice in the construction of recursive trees
• On the degree distribution of the nodes in increasing trees
• The power of choice in growing trees
• The degree distribution of random \(k\)-trees
• Limit laws for the Randić index of random binary tree models
• Long and short paths in uniform random recursive dags
• Ordered increasing k-trees: Introduction and analysis of a preferential attachment network model
• Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
• On the Expected Depth of Random Circuits
• Asymptotic degree distribution in random recursive trees
• A limit law for outputs in random recursive circuits

This page was built for publication: The degree profile in some classes of random graphs that generalize recursive trees