Context Trees, Variable Length Markov Chains and Dynamical Sources

DOI10.1007/978-3-642-27461-9_1zbMath1253.60079arXiv1007.2986OpenAlexW195770915WikidataQ105584935 ScholiaQ105584935MaRDI QIDQ2906153

Peggy Cénac, Nicolas Pouyanne, Brigitte Chauvin, Frederic Paccaut

Publication date: 29 August 2012

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.2986

zbMATH Keywords

variable length Markov chainsdynamical systems of the interval Dirichlet seriesoccurrences of wordsprobabilistic dynamical source

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Dynamical systems involving maps of the interval (37E05) Prefix, length-variable, comma-free codes (94A45)

Related Items (10)

Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme ⋮ Attractive regular stochastic chains: perfect simulation and phase transition ⋮ Local limit theorem for a Markov additive process on with a null recurrent internal Markov chain ⋮ Probability and algorithmics: a focus on some recent developments ⋮ Non-regular g-measures and variable length memory chains ⋮ Persistent random walks. I. Recurrence versus transience ⋮ Uncommon suffix tries ⋮ Variable length memory chains: characterization of stationary probability measures ⋮ Recurrence of multidimensional persistent random walks. Fourier and series criteria ⋮ Limit theorems for chains with unbounded variable length memory which satisfy Cramer condition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hitting and returning to rare events for all alpha-mixing processes
• On chains of infinite order
• A martingale approach to scan statistics
• A martingale approach to the study of occurrence of sequence patterns in repeated experiments
• The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
• Explicit distributional results in pattern formation
• A unified approach to word occurrence probabilities
• Dynamical sources in information theory: A general analysis of trie structures
• Processes with long memory: Regenerative construction and perfect simulation
• Variable length Markov chains
• Statistical properties of a nonuniformly hyperbolic map of the interval
• A universal data compression system
• Bounds for Reliability of Large Consecutive-K-out-of-N:F Systems with Unequal Component Reliability
• How many random digits are required until given sequences are obtained?
• Probability with Martingales
• Exact distribution of word occurrences in a random sequence of letters
• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
• Distribution Theory of Runs: A Markov Chain Approach

This page was built for publication: Context Trees, Variable Length Markov Chains and Dynamical Sources