2011/12/18 by Peggy Cénac, Brigitte Chauvin, Cénac, Peggy +5
Computer Science · Mathematics · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR) #cs.DS #math.PR
paper · pdf · doi:10.48550/arxiv.1112.4131
arxiv created 2011/12/20 · arxiv updated 2011/12/22
Common assumptions on the source producing the words inserted in a suffix trie with n leaves lead to a log n height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of n and another one whose saturation level is negligible with respect to log n. Both are built from VLMC (Variable Length Markov Chain) probabilistic sources; they are easily extended to families of sources having the same properties. The first example corresponds to a "logarithmic infinite comb" and enjoys a non uniform polynomial mixing. The second one corresponds to a "factorial infinite comb" for which mixing is uniform and exponential.