Depth of vertices with high degree in random recursive trees

zbMath1492.60020arXiv1611.07466MaRDI QIDQ5093993

Laura Eslava

Publication date: 2 August 2022

Full work available at URL: https://arxiv.org/abs/1611.07466

zbMATH Keywords

extreme valuesrandom recursive treesKingman's coalescentmaximum degreesnear-maximum degrees

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (1)

Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applications of the theory of records in the study of random trees
• Limit distribution for the maximum degree of a random recursive tree
• Persistence of hubs in growing random networks
• Distribution of nodes of a tree by degree
• Recent progress in coalescent theory
• Limiting Distributions for Path Lengths in Recursive Trees
• Random Trees
• Note on the heights of random recursive trees and random m‐ary search trees
• High degrees in random recursive trees
• The Maximum Degree of the Barabási–Albert Random Tree
• An Introduction to the Theory of Point Processes
• The strong convergence of maximal degrees in uniform random recursive trees and dags
• A non-increasing tree growth process for recursive trees and applications
• Partition Functions of Discrete Coalescents: From Cayley’s Formula to Frieze’s ζ(3) Limit Theorem

This page was built for publication: Depth of vertices with high degree in random recursive trees