arXiv (Cornell University) · 2010 · 13 citations · 20 references
EngineeringComputer ScienceMathematicsInformation TheoryProbability TheoryStochastic ProcessesMarkov ChainsMarkov ProcessesProbabilistic CombinatoricsProbability DistributionsDirichlet SeriesFinite Markov Chains
Infinite random sequences of letters can be viewed as stochastic chains or as strings produced by a source, in the sense of information theory. The relationship between Variable Length Markov Chains (VLMC) and probabilistic dynamical sources is studied. We establish a probabilistic frame for context trees and VLMC and we prove that any VLMC is a dynamical source for which we explicitly build the mapping. On two examples, the ``comb'' and the ``bamboo blossom'', we find a necessary and sufficient condition for the existence and the unicity of a stationary probability measure for the VLMC. These two examples are detailed in order to provide the associated Dirichlet series as well as the generating functions of word occurrences.
20
PE, P. Billingsley · Journal of the American Statistical Association · 1996 · 6.7K citations
Choice Reviews Online · 1992 · 1.5K citations
A universal data compression system
J. Rissanen · IEEE Transactions on Information Theory · 1983 · 645 citations
Peter Bühlmann, Abraham J. Wyner · The Annals of Statistics · 1999 · 399 citations · Full text