High degrees in random recursive trees

DOI10.1002/RSA.20753zbMath1394.05111arXiv1507.05981OpenAlexW2255223375MaRDI QIDQ4584910

Laura Eslava, Louigi Addario-Berry

Publication date: 5 September 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

extreme valuesrandom recursive treesKingman's coalescentdegree distributions

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items (7)

Profile of random exponential recursive trees ⋮ Tree evolution processes for bucket increasing trees ⋮ Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights ⋮ Depth of vertices with high degree in random recursive trees ⋮ Persistence of hubs in growing random networks ⋮ A non-increasing tree growth process for recursive trees and applications ⋮ On joint properties of vertices with a given degree or label in the random recursive tree

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