Limit laws for two distance-based indices in random recursive tree models

DOI10.2478/ausi-2022-0003zbMath1495.05030OpenAlexW4290852080MaRDI QIDQ2674149

M. H. Behzadi, S. Naderi, Ramin Kazemi

Publication date: 22 September 2022

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2022-0003

zbMATH Keywords

martingalecontraction methodtotal path lengthrecursive treesSackin index

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05)

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of algorithms on recursive trees
• Distances in random plane-oriented recursive trees
• The contraction method for recursive algorithms
• On the analysis of stochastic divide and conquer algorithms
• Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
• Limiting Distributions for Path Lengths in Recursive Trees
• Profiles of random trees: Plane-oriented recursive trees
• Random Trees
• On the number of terminal vertices in certain random trees with an application to stemma construction in philology
• ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
• On the structure of random plane‐oriented recursive trees and their branches
• Total Path Length for Random Recursive Trees
• Probability metrics and recursive algorithms
• Level of nodes in increasing trees revisited
• A limit theorem for “quicksort”

This page was built for publication: Limit laws for two distance-based indices in random recursive tree models