Context trees, variable length Markov chains and dynamical sources
From MaRDI portal
Publication:2906153
variable length Markov chainsdynamical systems of the interval Dirichlet seriesoccurrences of wordsprobabilistic dynamical source
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Prefix, length-variable, comma-free codes (94A45) Stationary stochastic processes (60G10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Dynamical systems involving maps of the interval (37E05)
Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3858118 (Why is no real title available?)
- scientific article; zbMATH DE number 1058063 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
- A martingale approach to scan statistics
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- A unified approach to word occurrence probabilities
- A universal data compression system
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
- Bounds for Reliability of Large Consecutive-K-out-of-N:F Systems with Unequal Component Reliability
- Digital trees and memoryless sources: from arithmetics to analysis
- Distribution Theory of Runs: A Markov Chain Approach
- Dynamical sources in information theory: A general analysis of trie structures
- Exact distribution of word occurrences in a random sequence of letters
- Explicit distributional results in pattern formation
- Hitting and returning to rare events for all alpha-mixing processes
- How many random digits are required until given sequences are obtained?
- Inequalities for the occurrence times of rare events in mixing processes. The state of the art
- On chains of infinite order
- Probability with Martingales
- Processes with long memory: Regenerative construction and perfect simulation
- Statistical properties of a nonuniformly hyperbolic map of the interval
- The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
- Variable length Markov chains
Cited in
(16)- Variable length memory chains: characterization of stationary probability measures
- Probability and algorithmics: a focus on some recent developments
- Persistent random walks. I. Recurrence versus transience
- Variable length Markov chain with exogenous covariates
- Recurrence of multidimensional persistent random walks. Fourier and series criteria
- Estimation of General Stationary Processes by Variable Length Markov Chains
- Local limit theorem for a Markov additive process on with a null recurrent internal Markov chain
- scientific article; zbMATH DE number 2159642 (Why is no real title available?)
- Attractive regular stochastic chains: perfect simulation and phase transition
- Model selection for variable length Markov chains and tuning the context algorithm
- Variable length Markov chains
- Uncommon suffix tries
- Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme
- Context Tree Estimation in Variable Length Hidden Markov Models
- Non-regular g-measures and variable length memory chains
- Limit theorems for chains with unbounded variable length memory which satisfy Cramer condition
This page was built for publication: Context trees, variable length Markov chains and dynamical sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906153)
