Asymptotic normality for the size of graph tries built from M-ary tree labelings

Graph tries are a new and interesting data structure proposed by Jacquet in 2014. They generalize the classical trie data structure which has found many applications in computer science and is one of the most popular data structure on words. For his generalization, Jacquet considered the size (or sp...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 968; p. 114011
Main Authors Fuchs, Michael, Yu, Tsan-Cheng
Format Journal Article
LanguageEnglish
Published Elsevier B.V 11.08.2023
Subjects
Central limit theorem
Graph tries
Method of moments
Space requirement
Tries
Graph tries
Space requirement
Central limit theorem
Tries
Method of moments
Online AccessGet full text

Cover

More Information
Summary:Graph tries are a new and interesting data structure proposed by Jacquet in 2014. They generalize the classical trie data structure which has found many applications in computer science and is one of the most popular data structure on words. For his generalization, Jacquet considered the size (or space requirement) and derived an asymptotic expansion for the mean and the variance when graph tries are built from n independently chosen random labelings of a rooted M-ary tree. Moreover, he conjectured a central limit theorem for the (suitably normalized) size as the number of labelings tends to infinity. In this paper, we verify this conjecture with the method of moments.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2023.114011