 |
|
|
|
| HAL : hal-00652952, version 2 |
| arXiv : 1112.4131 |
| Fiche détaillée |  Récupérer au format |
|
|
| Versions disponibles : | v1 (18-12-2011) | v2 (20-12-2011) |
|
|
|
|
| Uncommon Suffix Tries |
|
|
| Peggy Cénac 1Brigitte Chauvin 2 |
|
|
| (14/12/2011) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Institut de Mathématiques de Bourgogne (IMB) |
|
|
|
CNRS : UMR5584 – Université de Bourgogne |
|
|
| 2 : | Laboratoire de Mathématiques de Versailles (LM-Versailles) |
|
|
|
CNRS : UMR8100 – Université de Versailles Saint-Quentin-en-Yvelines |
|
|
| 3 : | Laboratoire Amiénois de Mathématique Fondamentale et Appliquée (LAMFA) |
|
|
|
CNRS : UMR6140 – Université de Picardie Jules Verne |
|
|
|
|
|
|
|
|
|
| IMB, UMR 5584 |
|
|
|
|
| Domaine | : | Mathématiques/Probabilités Informatique/Algorithme et structure de données |
|
|
| variable length Markov chain – probabilistic source – mixing properties – suffix trie. |
|
|
|
|
|
| hal-00652952, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00652952 | |
| oai:hal.archives-ouvertes.fr:hal-00652952 | |
| Contributeur : Frédéric Paccaut | |
| Soumis le : Mardi 20 Décembre 2011, 09:57:53 | |
| Dernière modification le : Mardi 20 Décembre 2011, 11:20:46 | |
