Note on the exponential recursive k-ary trees

DOI10.1051/ITA/2023003zbMath1521.05022OpenAlexW4384303293MaRDI QIDQ6047788

Ramin Imany Nabiyyi, Mehri Javanian, M. Ghasemi

Publication date: 13 September 2023

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ita/2023003

zbMATH Keywords

martingalealmost sure convergencecontraction methodrecursive \(k\)-ary trees

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Central limit and other weak theorems (60F05) Trees (05C05) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Depth of nodes in random recursive \(k\)-ary trees
• Profile of random exponential binary trees
• The contraction method for recursive algorithms
• Profile of random exponential recursive trees
• On a multivariate contraction method for random recursive structures with applications to Quicksort

This page was built for publication: Note on the exponential recursive k-ary trees