Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves

DOI10.1002/rsa.21138zbMath1522.05416arXiv2108.04989MaRDI QIDQ6051060

Boris G. Pittel, Miklós Bóna

Publication date: 12 October 2023

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

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

zbMATH Keywords

distributionranksenumerationasymptoticrootsearch treenumerical dataleaves

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• \(k\)-protected vertices in binary search trees
• Limiting probabilities for vertices of a given rank in 1-2 trees
• Limit laws for functions of fringe trees for binary search trees and random recursive trees
• Asymptotic distribution of two-protected nodes in ternary search trees
• Random Graphs and Complex Networks
• Introduction to Random Graphs
• Emergence of Scaling in Random Networks
• Profiles of random trees: Plane-oriented recursive trees
• Random Trees
• Note on the heights of random recursive trees and random m‐ary search trees
• On random trees
• The Maximum Degree of the Barabási–Albert Random Tree
• On the structure of random plane‐oriented recursive trees and their branches
• Paths in graphs
• On a random search tree: asymptotic enumeration of vertices by distance from leaves
• The height of increasing trees
• On Bollobás‐Riordan random pairing model of preferential attachment graph

This page was built for publication: Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves