Asymptotic expectation of protected node profile in random digital search trees

DOI10.2478/jamsi-2022-0004OpenAlexW4283800036MaRDI QIDQ2688817

Mehri Javanian, Jaleh Toofanpour, Ramin Imany Nabiyyi, Mohammed Q. Vahidi-Asl

Publication date: 6 March 2023

Published in: Journal of Applied Mathematics, Statistics and Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/jamsi-2022-0004

zbMATH Keywords

profileprobability generating functionsaddle point methoddigital search treessingularity analysisprotected node

Mathematics Subject Classification ID

Trees (05C05) Analyticity in context of PDEs (35A20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Notes on protected nodes in digital search trees
• The expected profile of digital search trees
• Mellin transforms and asymptotics: Harmonic sums
• Protected nodes and fringe subtrees in some random trees
• Analytical depoissonization and its applications
• Profiles of PATRICIA tries
• Random Trees
• Profiles of Tries
• Exact and asymptotic distributions in digital and binary search trees
• Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces
• Ideal Metrics in the Problem of Approximating Distributions of Sums of Independent Random Variables
• Normal Limit Law for Protected Node Profile of Random Recursive Trees
• External Profile of Symmetric Digital Search Trees (Extended Abstract)
• On 2-protected nodes in random digital trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic expectation of protected node profile in random digital search trees