Variable length memory chains: characterization of stationary probability measures

Stationary stochastic processes (60G10) Discrete-time Markov processes on general state spaces (60J05) Combinatorial probability (60C05) Markov renewal processes, semi-Markov processes (60K15) Convergence of probability measures (60B10)

Cites Work

Context tree selection: a unifying view
Random walks and percolation on trees
On chains of infinite order
Semi-Markov chains and hidden semi-Markov models toward applications. Their use in reliability and DNA analysis.
Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
Square summability of variations of \(g\)-functions and uniqueness of \(g\)-measures
Persistent random walks. I. Recurrence versus transience
Chains with complete connections: general theory, uniqueness, loss of memory and mixing properties
Testing statistical hypothesis on random trees and applications to the protein classification problem
Recurrence of multidimensional persistent random walks. Fourier and series criteria
Perfect simulation for locally continuous chains of infinite order
Probability on Trees and Networks
Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes
Backward Coalescence Times for Perfect Simulation of Chains with Infinite Memory
Context Trees, Variable Length Markov Chains and Dynamical Sources
Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme
Exponential inequalities for empirical unbounded context trees
Context tree estimation for not necessarily finite memory processes, via BIC and MDL
A universal data compression system
On non-regularg-measures
Non-regular g-measures and variable length memory chains
Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation
Sur des chaînes à liaisons complètes

This page was built for publication: Variable length memory chains: characterization of stationary probability measures