High degrees in recursive trees

DOI10.1016/J.ENDM.2015.07.075zbMATH Open1347.05228OpenAlexW2205735485MaRDI QIDQ324889FDOQ324889

Authors: Laura Eslava, Louigi Addario-Berry 

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.075

Recommendations

• High degrees in random recursive trees
• Limit distribution for the maximum degree of a random recursive tree
• scientific article; zbMATH DE number 17686
• Asymptotic degree distribution in random recursive trees
• Depth of vertices with high degree in random recursive trees

zbMATH Keywords

analysis of algorithmsrandom treesrandom recursive treesKingman's coalescentunion-find

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• Random Trees
• An Introduction to the Theory of Point Processes
• Recent progress in coalescent theory.
• Asymptotic degree distribution in random recursive trees
• Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
• Branching processes in the analysis of the heights of trees
• Limit distribution for the maximum degree of a random recursive tree
• Distribution of nodes of a tree by degree
• Title not available (Why is that?)
• Note on the heights of random recursive trees and random m‐ary search trees
• The strong convergence of maximal degrees in uniform random recursive trees and dags

Cited In (4)

• High degrees in random recursive trees
• Representing trees of higher degree
• Degree distribution in the lower levels of the uniform recursive tree
• Title not available (Why is that?)

This page was built for publication: High degrees in recursive trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324889)