Asymptotic normality for the size of graph tries built from M-ary tree labelings
From MaRDI portal
Publication:6132968
Abstract: 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 independently chosen random labelings of a rooted -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.
Cites work
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- A general central limit theorem for shape parameters of m-ary tries and PATRICIA tries
- A general limit theorem for recursive algorithms and combinatorial structures
- A multivariate view of random bucket digital search trees
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Analytic combinatorics
- Analytical depoissonization and its applications
- Digital trees and memoryless sources: from arithmetics to analysis
- Hidden word statistics
- Mellin transforms and asymptotics: Harmonic sums
- On the variance of a class of inductive valuations of data structures for digital search
- Process convergence for the complexity of radix selection on Markov sources
- Protected node profile of tries
- Trie structure for graph sequences
- Variance of size in regular graph tries
This page was built for publication: Asymptotic normality for the size of graph tries built from M-ary tree labelings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132968)
