Limit laws for the Randić index of random binary tree models
DOI10.1007/S10463-006-0107-ZzbMATH Open1332.68038OpenAlexW1997647471MaRDI QIDQ1019451FDOQ1019451
Authors: Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
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
Recommendations
momentsfunctional equationrecurrencetopological indexrandom treescomputational chemistrycontraction methodbinary search treesCatalan treeschemical index
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Searching and sorting (68P10)
Cites Work
- Title not available (Why is that?)
- On convergence rates in the central limit theorems for combinatorial structures
- Title not available (Why is that?)
- A general limit theorem for recursive algorithms and combinatorial structures
- The contraction method for recursive algorithms
- On the analysis of stochastic divide and conquer algorithms
- On a multivariate contraction method for random recursive structures with applications to quicksort
- Comparisons in Hoare's Find Algorithm
- A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
- Probability metrics and recursive algorithms
- Title not available (Why is that?)
- A limit theorem for “quicksort”
- Multiple Quickselect -- Hoare's Find algorithm for several elements
- Title not available (Why is that?)
- Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
- Title not available (Why is that?)
- An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
- Distribution of distances in random binary search trees.
- Title not available (Why is that?)
- Distances and Finger Search in Random Binary Search Trees
- The Wiener Index of simply generated random trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spanning tree size in random binary search trees.
- The oscillatory distribution of distances in random tries
- The center of mass of the ISE and the Wiener index of trees
- Analysis of Hoare's FIND algorithm with Median-of-three partition
- Normal convergence problem? Two moments and a recurrence may be the clues
- Title not available (Why is that?)
- Analysis of multiple quickselect variants.
Cited In (15)
- ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES
- The asymptotic value of the Randić index for trees
- The Gini index of random trees with an application to caterpillars
- DEGREE-BASED GINI INDEX FOR GRAPHS
- Several topological indices of random caterpillars
- On the Randi\'{c} index and its variants of network data
- On the Zagreb index of random recursive trees
- Degree distance and Gutman index of increasing trees
- The degree profile in some classes of random graphs that generalize recursive trees
- Investigating several fundamental properties of random lobster trees and random spider trees
- Several topological indices of random binary trees
- Central limit theorem for the bifurcation ratio of a random binary tree
- Asymptotic normality of the Zagreb index of random \(b\)-ary recursive trees
- The Wiener index of random digital trees
- Limit laws for functions of fringe trees for binary search trees and random recursive trees
This page was built for publication: Limit laws for the Randić index of random binary tree models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019451)