The strong convergence of maximal degrees in uniform random recursive trees and dags
From MaRDI portal
Publication:4847393
DOI10.1002/rsa.3240070102zbMath0835.05062OpenAlexW2102055990MaRDI QIDQ4847393
Publication date: 8 April 1996
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240070102
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)
Related Items
The small-community phenomenon in networks, Longest Path Distance in Random Circuits, Depth Properties of scaled attachment random recursive trees, High degrees in recursive trees, Community modulated recursive trees and population dependent branching processes, Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point, Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights, The number of descendants in a random directed acyclic graph, The degree sequence of a scale-free random graph process, Depth of vertices with high degree in random recursive trees, Persistence of hubs in growing random networks, On the Zagreb Index of Random Recursive Trees, 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, \(\gamma\)-variable first-order logic of uniform attachment random graphs, Limit distribution for the maximum degree of a random recursive tree
Cites Work
