Limit laws for the Randić index of random binary tree models

DOI10.1007/s10463-006-0107-zzbMath1332.68038OpenAlexW1997647471MaRDI QIDQ1019451

Hosam M. Mahmoud, Alois Panholzer, Qunqiang Feng

Publication date: 2 June 2009

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10463-006-0107-z

zbMATH Keywords

momentsfunctional equationrecurrencetopological indexcontraction methodrandom treesbinary search treescomputational chemistryCatalan treeschemical index

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Searching and sorting (68P10) Random graphs (graph-theoretic aspects) (05C80)

Related Items (8)

ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES ⋮ Several topological indices of random caterpillars ⋮ Investigating several fundamental properties of random lobster trees and random spider trees ⋮ DEGREE-BASED GINI INDEX FOR GRAPHS ⋮ The degree profile in some classes of random graphs that generalize recursive trees ⋮ The Gini index of random trees with an application to caterpillars ⋮ Unnamed Item ⋮ On the Zagreb Index of Random Recursive Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The oscillatory distribution of distances in random tries
• Multiple Quickselect -- Hoare's Find algorithm for several elements
• On convergence rates in the central limit theorems for combinatorial structures
• Analysis of multiple quickselect variants.
• A general limit theorem for recursive algorithms and combinatorial structures
• Normal convergence problem? Two moments and a recurrence may be the clues
• The center of mass of the ISE and the Wiener index of trees
• The contraction method for recursive algorithms
• On the analysis of stochastic divide and conquer algorithms
• Distribution of distances in random binary search trees.
• Spanning tree size in random binary search trees.
• On a multivariate contraction method for random recursive structures with applications to Quicksort
• Analysis of Hoare's FIND algorithm with Median-of-three partition
• Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
• Comparisons in Hoare's Find Algorithm
• The Wiener Index of simply generated random trees
• Distances and Finger Search in Random Binary Search Trees
• A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
• An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
• Probability metrics and recursive algorithms
• A limit theorem for “quicksort”

This page was built for publication: Limit laws for the Randić index of random binary tree models